Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Finite braid compilation and adiabatic error budget

Statement

Let A0 and A1 be the initial and endpoint isometries in a finite adiabatic braid input, let V be the ideal logical unitary, and let Wc be a compiled logical unitary. Suppose ∥Wc−V∥op≤ϵc,∥P(1)UT(1)A0−A1V∥op≤ϵtr, and let the JRS leakage amplitude be bounded by Am(1). Fix a finite POVM M on the physical output space. If the implemented measurement distribution differs from the distribution of this same M on UT(1)A0ρA0∗UT(1)∗ by at most ϵm in total variation, then for every input density operator ρ the total measured-output variation from the ideal compiled output A1WcρWc∗A1∗ is at most ϵc+ϵtr+Am(1)+ϵm. The transport mismatch is an explicit independent premise; the JRS estimate bounds leakage only.

Facts & Assumptions

Given: The finite adiabatic input, its JRS leakage bound, compiled and ideal logical unitaries, an independent in-band transport bound, a finite measurement, and its implementation-variation bound ϵm.

[F1]

JRS bounds the leakage amplitude of the followed band by Am(1). Finite JRS leakage amplitude and probability

[F2]

Pure-state trace distance is bounded by the difference of unit vectors. Pure-state trace distance is bounded by vector error

[F3]

Finite POVM output variation is bounded by trace distance. Measurement Variation At Most Trace Distance

[F4]

The trace norm is homogeneous and satisfies the triangle inequality. Trace Norm Duality And Norm Properties

[F5]

A finite-dimensional density operator is a convex combination of pure state projectors, with nonnegative weights summing to one. Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely Density operator

Proof

1.1F1givenalgebra

Put S=UT(1)A0 and Tc=A1Wc, both isometries. With Q=I−P(1), decompose S−Tc=QS+(P(1)S−A1V)+A1(V−Wc). Since A1V lies in ran⁡P(1), this identity is exact. The three terms have operator norms at most Am(1) by [F1], ϵtr by the transport premise, and ϵc because A1 is an isometry. The triangle inequality gives ∥S−Tc∥op≤Am(1)+ϵtr+ϵc.

2.1F2F3F4F5step 1.1algebra

For a pure logical input ∣ψ⟩, the output vectors Sψ and Tcψ are unit vectors and differ by at most the step 1.1 operator bound. [F2] therefore bounds their output trace distance by that same number. For mixed ρ, decompose it as ∑jpj∣ψj⟩⟨ψj∣ by [F5]; trace-norm triangle and homogeneity [F4] give the same bound after mixing. Applying [F3] bounds exact-measurement total variation by Am(1)+ϵtr+ϵc.

3.1step 2.1givenalgebra∎

The implemented measurement differs from the exact output measurement by at most ϵm by hypothesis. The total-variation triangle inequality adds this amount to step 2.1 and gives the claimed budget. The phase of each compiled braid is included in Wc or corrected according to the phase-reference record; no phase is omitted.

Depends on

Used by

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