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 and be the initial and endpoint isometries in a finite adiabatic braid input, let be the ideal logical unitary, and let be a compiled logical unitary. Suppose and let the JRS leakage amplitude be bounded by . Fix a finite POVM on the physical output space. If the implemented measurement distribution differs from the distribution of this same on by at most in total variation, then for every input density operator the total measured-output variation from the ideal compiled output is at most 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 .
JRS bounds the leakage amplitude of the followed band by . Finite JRS leakage amplitude and probability
Pure-state trace distance is bounded by the difference of unit vectors. Pure-state trace distance is bounded by vector error
Finite POVM output variation is bounded by trace distance. Measurement Variation At Most Trace Distance
The trace norm is homogeneous and satisfies the triangle inequality. Trace Norm Duality And Norm Properties
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
Put and , both isometries. With , decompose Since lies in , this identity is exact. The three terms have operator norms at most by [F1], by the transport premise, and because is an isometry. The triangle inequality gives .
For a pure logical input , the output vectors and 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 by [F5]; trace-norm triangle and homogeneity [F4] give the same bound after mixing. Applying [F3] bounds exact-measurement total variation by .
The implemented measurement differs from the exact output measurement by at most 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 or corrected according to the phase-reference record; no phase is omitted.
Depends on
- Finite JRS leakage amplitude and probability
- Finite adiabatic braid compilation input
- Braid phase reference and correction ledger
- Pure-state trace distance is bounded by vector error
- Measurement Variation At Most Trace Distance
- Trace Norm Duality And Norm Properties
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Density operator
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
- Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, Bounds for the adiabatic approximation with applications to quantum computation (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)