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-phase reduction for Clifford+T Rz synthesis up to phase

Statement

For R=Rz(θ) and a one-qubit Clifford+T operator U, if ∥R−λU∥op≤ε for some unit scalar λ, then the same projective T-count has a representative whose phase parameter is one of 1 or eiπ/8. The exact representative in the operator-norm constraint remains explicit in the pair (λ,U). Thus the up-to-phase search need only compare the two scaled candidate problems. If such a phase-equivalent operator is placed under a control, its phase must be restored as a relative phase:

C(λU)=(diag⁡(1,λ)⊗I)C(U).

Facts & Assumptions

Given: Rz(θ) and each Clifford+T word are unitary, det⁡Rz(θ)=1, and λ is a complex scalar with ∣λ∣=1.

[F1]

Determinants of one-qubit Clifford+T words are eighth roots: every exact one-qubit Clifford+T word has determinant ωk for some integer k.

[F3]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: ∥A∥op=max⁡∥v∥=1∥Av∥ for a finite-dimensional nonzero domain.

[F4]

For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B): det⁡(AB)=det⁡(A)det⁡(B) for square matrices over a commutative ring.

[F5]

Global Phase Equivalence: A and B are phase-equivalent when A=λB for a unit scalar λ.

[F6]

Ancilla-free Rz approximation problem and T-count: Rz(θ)=diag⁡(e−iθ/2,eiθ/2) and scalar Clifford phases do not contribute to T-count.

[F7]

Global Phase Under Control: in control-first order, C(λU)=(diag⁡(1,λ)⊗I)C(U).

[F8]

Controlled Unitary Access: C(U)=diag⁡(I,U) on the control-first register.

[F9]

t↦(cos⁡t,sin⁡t) is a bijection from [0,2π) onto the real unit circle and exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0: every unit complex scalar has a real angular parameter, and Euler's formula gives ∣1−eix∣=2∣sin⁡(x/2)∣.

[F10]

Signs, monotonicity intervals, and ranges of sine and cosine: sine is strictly increasing on [0,π/2] and strictly decreasing on [π/2,3π/2]; cosine is strictly decreasing on [0,π].

[F11]

Quarter-turn values and shifts by pi/2 and pi: sin⁡(x+π/2)=cos⁡x and cos⁡(π/2)=0.

[F12]

Parity and the Pythagorean identity for sine and cosine: cos⁡(−x)=cos⁡x, sin⁡2x+cos⁡2x=1, and sine and cosine are bounded by 1.

Proof

1.1F1F2F4F6F9givenchoose

Write det⁡U=ωk by [F1], and set V=e−ikπ/8R∗U. Since det⁡R=1, [F4] gives det⁡V=e−ikπ/4ωk=1. The unitary V is normal, so [F2] diagonalizes it. Its two eigenvalues have product 1 and modulus 1, hence are eiϕ,e−iϕ for some ϕ by [F9]; consequently tr⁡V=2cos⁡ϕ is real. Choose σ∈{1,−1} such that W=σV has nonnegative trace. Since −1=ei8π/8, W=einπ/8R∗U for an integer n, and W is unitary with determinant 1.

2.1F2F3F9F10F11F12step 1.1algebra

Since W∈SU(2), its eigenvalues are a unit scalar and its conjugate; by [F9] write them eit,e−it and, swapping them if needed, choose α∈[0,π] with eigenvalues eiα,e−iα. Then tr⁡W=2cos⁡α≥0; [F10,F11] imply α≤π/2. For any unit scalar μ, choose its angle t∈[0,2π) by [F9] and set ψ=t if t≤π, or ψ=t−2π otherwise. Thus ψ∈[−π,π]. By [F2] and [F3], ∥I−W∥op=∣1−eiα∣ and ∥I−μW∥op=max⁡{∣1−ei(ψ+α)∣,∣1−ei(ψ−α)∣}. If ψ≥0, put t=ψ+α∈[α,3π/2]. For t≤π, sin⁡(t/2)≥sin⁡(α/2) by [F10]; for t≥π, sine decreases on [π/2,3π/2], so sin⁡(t/2)≥sin⁡(3π/4). By [F11,F12], sin⁡(3π/4)=sin⁡(π/4)=1/2, and α/2≤π/4 gives sin⁡(α/2)≤1/2 by [F10]. If ψ≤0, apply the same bound to t=∣ψ∣+α from the second eigenvalue. By [F9,F10], ∣1−eix∣=2∣sin⁡(x/2)∣ and these bounds imply ∥I−W∥op≤∥I−μW∥op.

3.1F3F6step 2.1algebra

Left multiplication by R preserves operator norm, since it preserves the norm of every vector in the maximum [F3]. As W=einπ/8R∗U, step 2.1 implies ∥R−einπ/8U∥op=∥I−W∥op≤∥R−λU∥op. Write n=2q+r with r∈{0,1}. Then einπ/8=ωqeirπ/8. Since ωq is a free scalar Clifford phase in [F6], moving it between the explicit scalar and the representative leaves the projective T-count unchanged. Thus the two phase representatives are eirπ/8∈{1,eiπ/8}, proving the reduction.

4.1F5F7F8givenalgebra∎

In the control-first basis [F8], direct block multiplication gives C(λU)=diag⁡(I,λU)=(diag⁡(1,λ)⊗I)C(U), in agreement with the supplier identity [F7]. The first factor is generally not a global scalar on the joint control-target system, so replacing U by λU under control requires this relative phase correction.

Unresolved supplier checks

The actual QC07 gate, QC08 controlled-unitary, QC09 resource, and QC11 global-phase bodies were inspected and their interfaces agree with the matrix and scalar-phase conventions here. The separate Ross–Selinger T-count and arithmetic-runtime claims have their own local suppliers and explicit probabilistic assumptions; this phase-reduction proof does not use them.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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