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.
The Knill–Laflamme criterion for a protected subsystem
Statement
Let be an isometric encoding between nonzero finite-dimensional complex inner-product spaces, let , and let be a finite Kraus representation of a channel from to . The protected subsystem is exactly correctable under , in the sense of Exact correction of a protected subsystem, if and only if there are operators such that
Equivalently, For any chosen orthonormal basis of , put and , where means under the library's linear-first convention. The same criterion is equivalent to the existence of scalars such that These are equalities of physical-space operators using the embedded gauge matrix units .
Facts & Assumptions
Given: The finite-dimensional encoding , the finite Kraus channel , and the exact-correctability definition in Exact correction of a protected subsystem.
Exact correction of a protected subsystem: a decoded channel witnesses exact correction when the recovered logical marginal equals the input logical marginal for every density operator, including every finite reference.
Finite-dimensional quantum channel, Finite Kraus representation, Trace preservation is Kraus normalization, A finite Kraus sum is completely positive, and Kraus and Choi characterizations of complete positivity: channels are completely positive and trace-preserving, finite Kraus sums are completely positive, trace preservation is Kraus normalization, and finite-dimensional completely positive maps have finite Kraus representations.
Preserving the logical marginal forces a gauge-only channel: a channel preserving the logical marginal has Kraus operators , and the marginal identity holds with every finite reference; it also verifies the gauge-reset channel.
An explicit syndrome recovery corrects a Knill–Laflamme error family: for its constructed ordinary recovery, if is defined by , then for every operator .
Exact recovery implies the Knill–Laflamme condition: exact recovery of an ordinary code implies the scalar-compression condition; An explicit syndrome recovery corrects a Knill–Laflamme error family proves its sufficiency.
Exact correction of a protected subsystem and Exact recovery of an encoded quantum code: when the gauge factor is one-dimensional, the marginal recovery definition is ordinary encoded recovery.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.
Real and complex inner product spaces, with the inner product linear in the first argument, The adjoint is characterised by , Every linear map between finite-dimensional inner product spaces has a unique adjoint, and Adjoints satisfy , , , and : the pairing is linear in its first argument, finite-dimensional adjoints exist, and .
Agreement on pure states implies complete agreement: equality of complex-linear maps on all operators gives equality after tensoring with the identity on any finite reference.
Finite registers and their ordered computational bases, Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints, and The product basis is orthonormal and tensor dimensions multiply: the gauge/logical factor order is fixed, the maps are isometries, and simple tensors span.
Product operator matrix units form a basis: tensor products of operator matrix units form a basis of the endomorphisms of a finite-dimensional ordered product space.
Proof
For necessity, let be an exact decoded recovery. By [F3], choose a finite Kraus family for . The corrected map has Kraus operators . It is completely positive by [F3], and by [F2] and [F3]. Thus is a channel. By exactness [F1], it preserves the marginal; [F4] gives for some .
For sufficiency, assume . Let and choose an orthonormal basis by [F7]. Define by , and put and . By trace preservation [F3] and from [F2], Thus is a finite Kraus representation of a channel .
Trace preservation of and gives and by [F3]. Hence Set . This proves the operator-valued condition.
For all , the assumed condition gives Apply [F5] to with the identity encoding of . It supplies a channel and a finite Kraus family for which for every .
Fix an orthonormal gauge basis using [F7]. The matrix entry of in row , column is by [F8]. Therefore This proves the matrix-unit statement in the necessary direction.
Trace preservation and imply so : applying the equality to each for fixed unit gives , and tensoring with nonzero is injective. Define the decoded recovery for a fixed unit . For a gauge matrix unit , the encoded channel output is ; applying and scaling the cross-term formula in step 2.2 from to gives logical output Here the scaling is , so the factor cancels the denominator in step 2.2. The input logical marginal of that matrix unit is also . By linearity and the product matrix-unit basis in [F12], the decoded map with output gauge reset preserves the logical marginal on every operator; [F9] extends the equality to every finite reference.
Since , the operator-valued condition gives . Conversely, multiplying this compressed equality by and and using recovers the operator-valued condition.
The Kraus operators of are . Since is unit, ; hence is a channel by [F3]. Step 3.2 proves it preserves the logical marginal on every operator, and [F9] extends that identity to every finite reference. The physical reset-and-encode map is a channel by [F4], so the protected subsystem is exactly correctable.
For a fixed orthonormal gauge basis, if the operator-valued condition holds, then , which gives the embedded matrix-unit condition after multiplying by and . Conversely, sum the embedded matrix-unit identities over . Since and , the resulting operator is . This establishes equivalence for the fixed basis; because the operator-valued condition is basis-independent, it holds for every orthonormal gauge basis.
If , every is a scalar, so the criterion becomes . Under the unitary identification , the first-factor trace leaves the logical operator unchanged, so the subsystem recovery definition [F11] is ordinary exact recovery. The necessity and sufficiency directions are [F6].
Depends on
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- 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 correction of a protected subsystem
- Exact recovery of an encoded quantum code
- Finite Kraus representation
- Partial trace over a finite tensor factor
- Finite-dimensional quantum channel
- Quantum code as an isometric encoding and its code projector
- Finite registers and their ordered computational bases
- Tensor products of finitely many linear maps
- Ordered tensor registers, their inner product, and wire permutations
- Agreement on pure states implies complete agreement
- Preserving the logical marginal forces a gauge-only channel
- The product basis is orthonormal and tensor dimensions multiply
- Product operator matrix units form a basis
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- An isometric quantum encoding gives an orthogonal code projector
- Kraus and Choi characterizations of complete positivity
- A finite Kraus sum is completely positive
- An explicit syndrome recovery corrects a Knill–Laflamme error family
- Exact recovery implies the Knill–Laflamme condition
- Trace preservation is Kraus normalization
- Tensor maps preserve composition, identities, and adjoints
- The elementary tensors of two bases form the product basis of the tensor product
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
73 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)