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 correction of a protected subsystem
Definition
Let be nonzero finite-dimensional complex inner-product spaces with the fixed factor order . Let be an isometric encoding and set . The factors and are the gauge and protected logical subsystems. Let be a channel.
For any finite-dimensional residual space , use the first-factor partial trace of Partial trace over the first tensor factor on . In particular, for a reference , take and leave that factor order unchanged.
A decoded recovery is a channel . The subsystem is exactly correctable for under when some decoded recovery satisfies, for every finite-dimensional reference and every positive semidefinite trace-one operator on ,
where . The recovery may change the gauge state. The one-operator Kraus map is completely positive by A finite Kraus sum is completely positive and trace-preserving by and Trace preservation is Kraus normalization. Thus is a channel by Finite-dimensional channels compose and tensor, and it has a finite Kraus representation by Kraus and Choi characterizations of complete positivity. Explicitly, if and represent and , then represents . Taking a one-dimensional reference in the displayed recovery condition gives precisely the marginal hypothesis of Preserving the logical marginal forces a gauge-only channel. By that lemma and its converse with arbitrary finite references, this is equivalently a corrected decoded channel of the form for a channel on the gauge factor. For a unit vector , resetting the decoded gauge and re-encoding uses , where ; the same supplier proves this is a channel. If , the marginal condition is ordinary exact recovery of the code subspace in the sense of Exact recovery of an encoded quantum code.
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
- Exact recovery of an encoded quantum code
- Partial trace over the first tensor factor
- Finite-dimensional quantum channel
- Quantum code as an isometric encoding and its code projector
- Preserving the logical marginal forces a gauge-only channel
- An isometric quantum encoding gives an orthogonal code projector
- Finite-dimensional channels compose and tensor
- Kraus and Choi characterizations of complete positivity
- A finite Kraus sum is completely positive
- Trace preservation is Kraus normalization
Used by
Dependency tree · two levels
53 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)