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.
Normalized transport rounds preserve the circuit up to a recorded phase
Statement
For a circuit as in Normalized transport schedule for a J/CZ circuit, let be its denotation and let be the chronological product of the normalized rounds. Then
Facts & Assumptions
Given: A finite ordered J/CZ circuit with layers and normalized rounds as defined in Normalized transport schedule for a J/CZ circuit.
The schedule processes the finite circuit layers chronologically and forms each round by applying its matching before its listed one-qubit gates (Normalized transport schedule for a J/CZ circuit).
The current circuit denotation defines for chronological layers and assigns the identity to an empty circuit or layer (Denotational semantics of a finite layered circuit).
Proof
In an all- layer, the schedule appends exactly the original matching and original one-qubit gates, so that layer's round operator equals the original layer operator. In a layer with no gates and nonempty matching, the two round operators compose as by [F1]. An empty layer contributes the identity and is omitted.
In a mixed layer, the three rounds compose with the original matching first. On every active wire the later two factors are , leaving the original . On every idle wire the three factors are . Since these idle factors are scalar identities, they commute with the matching and all active-wire gates. Thus the round product is times the original layer operator.
Multiplying the equalities from step 1.1 and step 1.2 in chronological layer order gives , because is the product of exactly the mixed-layer scalars and no other layer contributes a scalar. This includes zero layers and zero wires, where both products are empty.
Depends on
Used by
Dependency tree · two levels
13 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, §§II D–F (standard reference, not scraped)