Corollary 2: full ancilla-free determinant characterization
OpenQAlgorithms.Papers.Independent.Intakethird100.P85.ancillaFree_characterizationLet be a unitary operator on qubits. Put and . Then is exactly representable by an ancilla-free Clifford+T circuit if and only if every entry belongs to and
The gate set includes the scalar and preserves absolute phase. The final regime is retained even though the entry and unitary conditions already imply it. This characterizes the ancilla-free group in every qubit dimension.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P85
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P85
open scoped Classical BigOperators
open QAlgorithms
open QAlgorithms.Papers.Independent.Gap48.P10
(InZomega InDomega Residue bits residue residueMultiply Reducible)
open QAlgorithms.Papers.Independent.Support21.P13
(synthesisRing integralRing coordinateValue HTLetter htWordMatrix EntriesInRing cliffordTLibrary)
local notation "omega" => QAlgorithms.gateT true true
local notation "sqrtTwo" => ((Real.sqrt 2 : ℝ) : ℂ)
/-- Corollary 2, PDF p.6: all four exact ancilla-free determinant regimes. -/
theorem ancillaFree_characterization (n : ℕ) (U : Matrix (Qubits n) (Qubits n) ℂ)
(unitary : U ∈ Matrix.unitaryGroup (Qubits n) ℂ) :
(∃ c : Circuit gateSet n, c.unitary = U) ↔
EntriesInRing U ∧
(4 ≤ n → U.det = 1) ∧
(n = 3 → U.det ∈ ({-1, 1} : Set ℂ)) ∧
(n = 2 → U.det ∈ ({Complex.I, -1, -Complex.I, 1} : Set ℂ)) ∧
(n ≤ 1 → U.det ∈ ({omega, Complex.I, omega ^ 3, -1,
omega ^ 5, -Complex.I, omega ^ 7, 1} : Set ℂ)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P85
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let be the Boolean strings of length , let , and let be the smallest subring of containing and . For every unitary matrix indexed by , there exists a finite circuit on exactly wires with matrix exactly if and only if every entry of lies in and all the following implications hold:
The allowed circuit gates are , , , CNOT sending to , and a zero-wire gate with sole entry . Each gate is embedded on an injectively chosen set of wires by preserving all other bits; the circuit matrix is the reverse-ordered product of the embedded matrices, and the empty circuit gives . The zero-wire gate embeds as . In particular, the last determinant implication applies both to and to ; the space indexed by is one-dimensional.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.