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.
Exact recovery of an encoded quantum code
Definition
Let be nonzero finite-dimensional complex inner-product spaces. An encoding isometry has code projector ; An isometric quantum encoding gives an orthogonal code projector gives , so is trace-preserving. Let be a channel. The code is exactly correctable for if there is a decoded recovery channel for which
as linear maps, where . Equivalently, the physical recovery satisfies for every positive semidefinite trace-one logical operator .
It suffices to check equality on the rank-one projectors from Agreement on pure states implies complete agreement for unit vectors : by that lemma, agreement on those projectors implies agreement on every operator and after tensoring with the identity on any finite reference system.
For any chosen finite Kraus representation , trace preservation gives by Trace preservation is Kraus normalization.
Depends on
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Real and complex inner product spaces, with the inner product linear in the first argument
- Finite Kraus representation
- Finite-dimensional quantum channel
- Quantum code as an isometric encoding and its code projector
- Agreement on pure states implies complete agreement
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
- An isometric quantum encoding gives an orthogonal code projector
- Trace preservation is Kraus normalization
Used by
- Code Deviation and Fault Spread Definition
- Exact correction of a protected subsystem Definition
- Fault-Tolerant Gadget and Proper-Code Contract Definition
- Encoded error instruments and full-space CPTP error maps Lemma
- Exact recovery implies the Knill–Laflamme condition Theorem
- The Knill–Laflamme criterion for a protected subsystem Theorem
Dependency tree · two levels
31 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
- John Preskill, Quantum Information, Chapter 7: Quantum Error Correction (working draft, March 2026) (standard reference, not scraped)
- David W. Kribs, Raymond Laflamme, David Poulin, and Maia Lesosky, Operator Quantum Error Correction (standard reference, not scraped)