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.
One-Qubit Euler Decomposition
Statement
Use the rotation convention of Exact one-qubit gates and rotations and define : For every there are real with If , the scalar factor is unnecessary and .
Facts & Assumptions
Given: A unitary matrix and the rotation conventions in the Statement.
Every nonzero complex number has a unique polar form with and : every nonzero complex number has polar form with .
is a bijection from onto the real unit circle: every point of the real unit circle is for some .
Signs, monotonicity intervals, and ranges of sine and cosine gives the monotonicity intervals of sine and cosine and their range . Quarter-turn values and shifts by pi/2 and pi gives the quarter-turn values and the identities and .
For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix: determinant is the Leibniz sum over permutations, and conjugating every entry conjugates that sum.
For every square matrix over a commutative ring, : for every square matrix over a commutative ring.
For same-sized finite square matrices over a commutative ring, : for same-sized square matrices over a commutative ring.
The Pauli matrices: and in the ordered computational basis.
Proof
Direct multiplication of the matrices in [F8] gives . Grouping the even and odd terms of the exponential series in [F7] then gives and . Thus the matrices used in the Statement match the QC7 convention exactly.
The Leibniz formula [F4] gives ; by [F5], . Thus [F6] and give .
By [F1], choose with and put . The scalar has modulus one and [F4],[F6] give , so is unitary with determinant one.
Write the first column of as . Its norm is one, so is on the unit circle in the closed first quadrant. By [F2], choose with and . By [F3], sine is positive on : it increases from to on and decreases to on . Its -shift makes it negative on , so forces . Cosine decreases strictly on and vanishes at , so then forces . Set . This also covers either zero coordinate.
The unit vector orthogonal to is a unit scalar multiple of . If its scalar is , the determinant of the matrix with these columns is ; since , the second column is exactly . Choose phases so and ; when one modulus is zero choose its phase arbitrarily.
Put and . Direct multiplication of the matrices obtained in step 1.1 gives The phase choices in step 4.1 make this exactly the two columns of , including the cases and .
Restoring the scalar from step 2.1 proves the formula for arbitrary . If , choose in step 2.1, so , and apply steps 3.1–5.1.
Depends on
- Exact one-qubit gates and rotations
- The Pauli matrices
- Real and complex inner-product spaces and their induced length
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Every nonzero complex number has a unique polar form $r(\cos\theta+i\sin\theta)$ with $r>0$ and $-\pi<\theta\le\pi$
- $t\mapsto(\cos t,\sin t)$ is a bijection from $[0,2\pi)$ onto the real unit circle
- Signs, monotonicity intervals, and ranges of sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- For every square matrix over a commutative ring, $\det(A^{\mathsf T})=\det(A)$
Used by
- Gray-Path Synthesis of a Two-Level Gate Algorithm
- A Two-Level Rotation on Two Qubits Example
- Effective synthesis of fixed-dimensional unitaries Lemma
- Exact Central Controlled-Z Absorption at a QSD Node Lemma
- Parameter Count for a Fixed CNOT Skeleton Lemma
- Circuit and pattern translations are branch preserving and universal Theorem
- Correctness of Gray-Path Two-Level Synthesis Theorem
- Exact Controlled One-Qubit Unitary with Two CNOTs Theorem
- Exact QSD CNOT Upper Bound Theorem
- Exact Three-CNOT Synthesis of Two-Qubit Unitaries Theorem
- Exact Two-Qubit Cartan Decomposition Theorem
Dependency tree · two levels
49 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
- Adriano Barenco et al., Elementary gates for quantum computation, arXiv:quant-ph/9503016v1 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)