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.
End-to-end channel and output error contract
Definition
A finite -stage composition contract consists of nonzero finite-dimensional complex Hilbert spaces and, for each , an ideal channel and an implemented channel with the same domain and codomain. Channels are completely positive and trace-preserving on the full operator space, as in Finite-dimensional quantum channel. Products act right to left, so applies stage first, following Denotational semantics of a finite layered circuit.
For channels on the same nonzero finite-dimensional complex Hilbert input and output spaces define the normalized diamond distance where is the unhalved supremum of induced trace norms over all finite reference spaces, as in Diamond Norm. For density operators define , as in Trace Distance. For probability distributions on a common finite output alphabet define .
The local channel error at stage is . The final channel error is . A final output-distribution error is total variation distance between the finite laws obtained by applying a declared final POVM to the two output states. A failure probability is the probability of a declared failure event in the finite execution history. These four quantities have different definitions and must be reported separately.
When an input is entangled with a finite reference register, include that reference in the density operator of Density operator and retain it through the channel call; the diamond distance already takes the supremum over such references. Channel, state, and classical output contracts are distinct. Cost coordinates for input description and preprocessing, state preparation, gates, queries including controlled and inverse access, workspace, measurement, postprocessing, and classical output are specified separately by Classical output, quantum-state output, and access costs and Circuit-family and computation cost model.
Depends on
Used by
- Allocate local error budgets through a pipeline Algorithm
- Entry queries alone do not provide Tang's sampling access Counterexample
- Squared-vector distributions are close in total variation Lemma
- Allocated local errors meet the global budget Theorem
- Hybrid bound for a composed channel circuit Theorem
- Tang's conditional recommendation sampler Theorem
- Tensor-product channel error bound Theorem
Dependency tree · two levels
32 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information (standard reference, not scraped)