cyclic_cubic_min_t_count
deforiginal
For a natural number n, cyclic_cubic_min_t_count n is the infimum in ℕ of the cardinalities of all parity representations S : Finset (Finset (Fin n)) of cyclic_cubic_syndrome n.
Statement
noncomputable def cyclic_cubic_min_t_count (n : ℕ) : ℕ
- Related work
- arXiv:2610.01024
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Built on 2
- is_parity_reprA finite set S of nonempty parities on n qubits is a parity representation of a syndrome s if the moment of S at every non-empty subset A…
- cyclic_cubic_syndromeFor a natural number n and a finite subset A of Fin n, cyclic_cubic_syndrome n A returns 1 in ZMod 2 if there exists j : Fin n such that A…
- Used by 1
- cyclic_cubic_min_t_count_eq_of_boundsIf there exists a parity representation of cardinality k, and all parity representations have cardinality at least k, then…
Read back from the Lean
cyclic_cubic_min_t_count is a noncomputable function taking a natural number n and returning the infimum (in ℕ) of the set of natural numbers k for which there exists a family S of subsets of Fin n such that S is a parity representation of cyclic_cubic_syndrome n and the cardinality of S is k.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The minimum cardinality of a parity representation of the cyclic cubic syndrome on n qubits. -/ noncomputable def cyclic_cubic_min_t_count (n : ℕ) : ℕ := sInf {k : ℕ | ∃ S : Finset (Finset (Fin n)), is_parity_repr S (cyclic_cubic_syndrome n) ∧ S.card = k}