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.
J-gate basis and exact phase identities
Statement
For every , is unitary and is an orthonormal basis. The exact identities
hold in the fixed phase convention.
Facts & Assumptions
Given: , , and .
The current QC07 draft defines and in the ordered computational basis (Exact one-qubit gates and rotations). Its complete definition and verification were inspected.
The J-gate definition fixes , , and (J gate and ordered equatorial measurement vectors).
Proof
Since , . Direct multiplication from [F1] gives and , so [F2] gives . Hence maps the orthonormal computational basis to an orthonormal basis.
Substituting in [F2] gives , and therefore . Matrix multiplication using [F1] and [F2] gives and , proving the exact phase identity.
From [F1] and [F2], . Multiplying this matrix three times gives . This phase will be retained in the transport normalization.
Depends on
Used by
- Circuit-to-open-graph resource encoding with normalized transport rounds Definition
- Finite open-graph adaptive measurement pattern Definition
- Normalized transport schedule for a J/CZ circuit Definition
- Adaptive J angle and Pauli-frame update Lemma
- Four-branch open-graph pattern for CZ Lemma
- Normalized transport rounds preserve the circuit up to a recorded phase Lemma
- One-bit J-gate teleportation branch identity Lemma
- Circuit and pattern translations are branch preserving and universal Theorem
- Pattern branch probabilities and zero-probability transcripts Theorem
Dependency tree · two levels
19 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
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415, §20.6 (standard reference, not scraped)
- Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel, Measurement-based quantum computation on cluster states, arXiv:quant-ph/0301052, §§II B and II E (standard reference, not scraped)