Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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-T matrix C(T)=diag⁡(1,1,1,ω) 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: ω=eiπ/4, the exact two-wire gate embeddings, and multiplicativity and column multilinearity of the determinant.

[F1]

Clifford+T circuit entries lie in the dyadic cyclotomic ring: every matrix entry of a finite Clifford+T circuit lies in D.

[F2]

Unit-modulus elements of the dyadic cyclotomic ring: every λ∈D with λλˉ=1 is an eighth root ωj.

[F3]

Clifford+T gate library and exact matrices: H,T,S,Z have the displayed exact matrices and CNOT permutes the two-wire computational basis by ∣a,b⟩↦∣a,b⊕a⟩.

[F4]

For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B): the determinant of a product of square matrices is the product of their determinants.

[F5]

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 λ4.

[F6]

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.

[F7]

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.

[F8]

Global Phase Equivalence: A and B are equivalent up to global phase exactly when A=λB for a scalar λ of modulus 1.

Proof

1.1F3F4F6F7givenalgebra

By [F6], the two one-wire embeddings are H⊗I2,I2⊗H and the corresponding tensor embeddings for T,T†,S,S†,X,Y,Z and scalar phases. Direct diagonal/permutation calculations give det⁡(H⊗I2)=det⁡(I2⊗H)=1, det⁡(T⊗I2)=det⁡(I2⊗T)=ω2, and det⁡(T†⊗I2)=det⁡(I2⊗T†)=ω−2. The same calculation gives determinant ω4 for embedded S,S†, determinant 1 for embedded X,Y,Z, and ω4j for the embedded scalar phase ωjI2. CNOT is a single transposition of ∣10⟩ and ∣11⟩, so its determinant is −1=ω4. Thus every primitive determinant is an even power of ω; [F4,F7] make the determinant of a finite circuit product an even power as well.

2.1F1F2F5F8step 1.1algebra∎

The target has determinant det⁡C(T)=ω. Exact equality contradicts step 1.1. If a two-wire circuit V equals λC(T) for a unit scalar λ as in [F8], then its (0,0) entry is λ, so [F1] gives λ∈D; unitarity gives λλˉ=1, so [F2] gives λ=ωj. By [F5], det⁡V=λ4det⁡C(T)=ω4j+1, 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

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