Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 C as in Normalized transport schedule for a J/CZ circuit, let UC be its denotation and let U~C be the chronological product of the normalized rounds. Then

U~C=σCUC.

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.

[F1]

J(0)2=I and J(π/2)3=eiπ/4I (J-gate basis and exact phase identities).

[F2]

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).

[F3]

The current circuit denotation defines UC=ULd⋯UL1 for chronological layers and assigns the identity to an empty circuit or layer (Denotational semantics of a finite layered circuit).

Proof

1.1F1F2F3cases

In an all-J 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 J gates and nonempty matching, the two round operators compose as (J(0)⊗n)(J(0)⊗n)CZMr=CZMr by [F1]. An empty layer contributes the identity and is omitted.

1.2F1F2F3algebra

In a mixed layer, the three rounds compose with the original matching first. On every active wire the later two factors are J(0)J(0)=I, leaving the original J(αrj). On every idle wire the three factors are J(π/2)3=eiπ/4I. Since these idle factors are scalar identities, they commute with the matching and all active-wire gates. Thus the round product is eiπ(n−∣Jr∣)/4 times the original layer operator.

2.1step 1.1step 1.2F2inductioncases∎

Multiplying the equalities from step 1.1 and step 1.2 in chronological layer order gives U~C=σCUC, because σC 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