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.
Heralded success and conditional verification contract
Definition
A heralded procedure has an explicit finite outcome set containing success and failure, a success probability , and a declared output type. For an input density operator as in Density operator, its success branch is the subnormalized state of the instrument Finite instruments and conditional states, with . If , its conditional output state is ; if , no normalized conditional state is assigned and the branch is denoted . The outcome law is specified by the instrument and the POVM conventions of Finite POVMs and their outcome law.
The contract states separately (i) the success probability, (ii) the guarantee conditional on success, (iii) any unconditional guarantee including failure, and (iv) the cost of verification and of outputting or recording the success flag. An acceptance probability from Quantum acceptance probability for a finite promise computation is not itself a conditional-state guarantee. A claim about a quantum state output uses the type and cost distinctions in Classical output, quantum-state output, and access costs.
Depends on
- Quantum acceptance probability for a finite promise computation
- Finite POVMs and their outcome law
- Finite instruments and conditional states
- Instrument outcome weights normalize
- Positive-probability instrument branches are density operators
- Density operator
- Classical output, quantum-state output, and access costs
Used by
Dependency tree · two levels
36 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 (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information (standard reference, not scraped)