How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Two-qubit determinant obstruction to controlled T
Statement
The two-qubit controlled- matrix cannot be implemented exactly, or up to a scalar global phase, by a circuit on exactly two wires using only one-qubit Clifford+T gates and CNOT. The assertion concerns no workspace wire; it does not rule out implementations with an explicit ancilla.
Facts & Assumptions
Given: , the exact two-wire gate embeddings, and multiplicativity and column multilinearity of the determinant.
Clifford+T circuit entries lie in the dyadic cyclotomic ring: every matrix entry of a finite Clifford+T circuit lies in .
Unit-modulus elements of the dyadic cyclotomic ring: every with is an eighth root .
Clifford+T gate library and exact matrices: have the displayed exact matrices and CNOT permutes the two-wire computational basis by .
For same-sized finite square matrices over a commutative ring, : the determinant of a product of square matrices is the product of their determinants.
The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring: determinant is multilinear in its columns, so scaling all four columns by scales the determinant by .
A local gate has a unique global wire embedding: on two ordered wires, a one-wire operation acts on its selected factor and as identity on the other factor.
Denotational semantics of a finite layered circuit: a finite chronological circuit is represented by the product of its gate-embedding matrices, with later gates multiplying on the left.
Global Phase Equivalence: and are equivalent up to global phase exactly when for a scalar of modulus .
Proof
By [F6], the two one-wire embeddings are and the corresponding tensor embeddings for and scalar phases. Direct diagonal/permutation calculations give , , and . The same calculation gives determinant for embedded , determinant for embedded , and for the embedded scalar phase . CNOT is a single transposition of and , so its determinant is . Thus every primitive determinant is an even power of ; [F4,F7] make the determinant of a finite circuit product an even power as well.
The target has determinant . Exact equality contradicts step 1.1. If a two-wire circuit equals for a unit scalar as in [F8], then its entry is , so [F1] gives ; unitarity gives , so [F2] gives . By [F5], , an odd power, again contradicting step 1.1.
Unresolved supplier checks
The determinant calculation was reconciled with the actual QC09 local-wire embedding and circuit-semantics bodies. QC07's exact gate matrices and the ring-unit-circle supplier were also inspected. This records interface review, not independent acceptance of those draft suppliers.
Depends on
- Clifford+T gate library and exact matrices
- Clifford+T circuit entries lie in the dyadic cyclotomic ring
- Unit-modulus elements of the dyadic cyclotomic ring
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring
- Denotational semantics of a finite layered circuit
- A local gate has a unique global wire embedding
- Global Phase Equivalence
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Kliuchnikov, Maslov, and Mosca, Practical approximation of single-qubit unitaries by single-qubit quantum circuits (standard reference, not scraped)