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 and a one-qubit Clifford+T operator , if for some unit scalar , then the same projective T-count has a representative whose phase parameter is one of or . The exact representative in the operator-norm constraint remains explicit in the pair . 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:
Facts & Assumptions
Given: and each Clifford+T word are unitary, , and is a complex scalar with .
Determinants of one-qubit Clifford+T words are eighth roots: every exact one-qubit Clifford+T word has determinant for some integer .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite-dimensional normal complex operator has an orthonormal eigenbasis.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: for a finite-dimensional nonzero domain.
For same-sized finite square matrices over a commutative ring, : for square matrices over a commutative ring.
Global Phase Equivalence: and are phase-equivalent when for a unit scalar .
Ancilla-free Rz approximation problem and T-count: and scalar Clifford phases do not contribute to T-count.
Global Phase Under Control: in control-first order, .
Controlled Unitary Access: on the control-first register.
is a bijection from onto the real unit circle and , , and : every unit complex scalar has a real angular parameter, and Euler's formula gives .
Signs, monotonicity intervals, and ranges of sine and cosine: sine is strictly increasing on and strictly decreasing on ; cosine is strictly decreasing on .
Parity and the Pythagorean identity for sine and cosine: , , and sine and cosine are bounded by .
Proof
Write by [F1], and set . Since , [F4] gives . The unitary is normal, so [F2] diagonalizes it. Its two eigenvalues have product and modulus , hence are for some by [F9]; consequently is real. Choose such that has nonnegative trace. Since , for an integer , and is unitary with determinant .
Since , its eigenvalues are a unit scalar and its conjugate; by [F9] write them and, swapping them if needed, choose with eigenvalues . Then ; [F10,F11] imply . For any unit scalar , choose its angle by [F9] and set if , or otherwise. Thus . By [F2] and [F3], and . If , put . For , by [F10]; for , sine decreases on , so . By [F11,F12], , and gives by [F10]. If , apply the same bound to from the second eigenvalue. By [F9,F10], and these bounds imply .
Left multiplication by preserves operator norm, since it preserves the norm of every vector in the maximum [F3]. As , step 2.1 implies . Write with . Then . Since 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 , proving the reduction.
In the control-first basis [F8], direct block multiplication gives , in agreement with the supplier identity [F7]. The first factor is generally not a global scalar on the joint control-target system, so replacing by 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
- Global Phase Under Control
- Clifford+T gate library and exact matrices
- Ancilla-free Rz approximation problem and T-count
- Global Phase Equivalence
- Controlled Unitary Access
- Determinants of one-qubit Clifford+T words are eighth roots
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- $t\mapsto(\cos t,\sin t)$ is a bijection from $[0,2\pi)$ onto the real unit circle
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- Signs, monotonicity intervals, and ranges of sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
- Parity and the Pythagorean identity for sine and cosine
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
- Ross and Selinger, Optimal ancilla-free Clifford+T approximation of z-rotations (standard reference, not scraped)