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 schedule for a J/CZ circuit
Definition
Let be a finite -wire circuit over the and gates, with chronological layers and source wire labels as in Finite circuit syntax and ordered wire labels. Schedule index denotes source wire . For each source layer , let be the matching of its occurrences after reindexing a source pair as , and let be the indices carrying one-qubit gates . The source layer has pairwise disjoint gate supports by Finite circuit syntax and ordered wire labels, so no gate in meets an edge of . By Gates on disjoint wires commute, its denotation may be written with the CZ matching first and then at most one per schedule index . The normalized transport schedule is the finite chronological list of rounds and the scalar defined as follows. A round applies its matching first and then one gate on each wire. Define . The round list is the concatenation, in source-layer order, of the blocks specified by the first matching case below; the empty product is . This order makes the zero-wire empty-layer case unambiguous:
- If and , the block is empty.
- If and , the block consists of one round with matching and the original angles .
- If and , the block consists of two rounds: the first has matching and angle on every wire; the second has no matching and angle on every wire.
- If , the block consists of three rounds. The first has matching , angle on active wires , and angle on idle wires. The next two have no matching, angle on active wires, and angle on idle wires. The factor for this mixed layer is included in the displayed product defining .
The rounds are numbered in concatenation order. Their schedule indices continue to denote the corresponding source wires . Angles at indices without an original gate are padding angles. For a mixed layer, the active-wire product is and each idle wire contributes ; the scalar is therefore recorded in rather than suppressed. The no- matching case has two transports, whose product is . No claim about the transport graph's simplicity is part of this definition.
Depends on
Used by
- Circuit-to-open-graph resource encoding with normalized transport rounds Definition
- Normalized transport encoding is a finite simple graph of bounded size Lemma
- Normalized transport rounds preserve the circuit up to a recorded phase Lemma
- A finite J/CZ circuit is simulated branch by branch by its adaptive pattern Theorem
Dependency tree · two levels
26 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)