gf8_oracle_min_t_count
def
The minimal T-count of the GF(8) multiplication phase oracle on nine qubits in the Hadamard-free {CNOT, T} model, defined via the Amy-Mosca correspondence as the infimum cardinality of a parity representation of the oracle syndrome.
Statement
noncomputable def gf8_oracle_min_t_count : ℕ
- Defined in
- arXiv:2610.01024, Definition 18 and Fact 19
- Verified
- 25 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…
- gf8_oracle_syndromeThe syndrome s_A of the GF(8) multiplication phase oracle U_3 |x, y, z> = (-1)^{z . (x * y)} |x, y, z> on nine qubits: s_A = 1 iff A =…
- Used by 2
- gf8_oracle_min_t_count_le_29The minimal T-count of the GF(8) multiplication oracle is at most 29, certified by an explicit 29-parity representation.
- gf8_oracle_min_t_count_ge_20The slice-rank lower bound: the minimal T-count of the GF(8) multiplication oracle is at least 20.
Read back from the Lean
The definition gf8_oracle_min_t_count is the infimum (sInf) in ℕ of the set of natural numbers k such that there exists a finset S of finsets of Fin 9 (subsets of {0, …, 8}) with S.card = k satisfying is_parity_repr S gf8_oracle_syndrome.
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 minimal T-count of the GF(8) multiplication phase oracle in the Hadamard-free model, defined as the infimum cardinality of a parity representation of its syndrome. -/ noncomputable def gf8_oracle_min_t_count : ℕ := sInf {k : ℕ | ∃ S : Finset (Finset (Fin 9)), is_parity_repr S gf8_oracle_syndrome ∧ S.card = k}