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.
Complementary error records in a Kraus basis
Definition
Let and be nonzero finite-dimensional complex inner-product spaces. Let be a quantum channel, meaning a completely positive, trace-preserving linear map, with a finite Kraus representation . Here denotes the linear endomorphisms of , and is the adjoint of . Choose a nonempty finite label set for the family and an environment space with orthonormal basis indexed by that set. Define by . The complementary error record associated with this representation is , where the partial trace contracts the first tensor factor. In the chosen label basis its entry is .
For an isometric code encoding with nonzero finite-dimensional logical space and code subspace , the record is logical-state independent on the code when is the same operator for every density operator on supported on . A density operator is a positive semidefinite operator of trace one; supported on means for the orthogonal projector . This condition concerns the entire record, including off-diagonal entries, and is stronger than merely requiring the diagonal entries to be independent of the code state.
Facts & Assumptions
A finite Kraus representation is the stated finite sum of operator maps. Finite Kraus representation
A finite-dimensional quantum channel is linear, completely positive and trace-preserving on all input operators. Finite-dimensional quantum channel
The first-factor partial trace is given by summing the corresponding matrix entries over an orthonormal basis of that factor. Partial trace over the first tensor factor
A complementary channel is obtained by tracing the output factor of a chosen isometric dilation. Complementary channels and coherent information
An isometric encoding has code subspace and code projector . Quantum code as an isometric encoding and its code projector
A density operator is positive semidefinite with trace one. Density operator
Ordered tensor products retain factor order and carry the factorwise product inner product, with orthonormal elementary product bases. Ordered tensor registers, their inner product, and wire permutations
For an operator on an ordered product with ordered orthonormal product basis, the second-factor partial trace has entries . Partial trace over a finite tensor factor
A complex-linear map is completely positive when, for every integer , its block amplification preserves nonnegative operators. Completely positive maps
Justification
Trace preservation and the Kraus formula give for every . Taking matrix units for shows . The product inner product and orthonormality of the label basis give , hence , so is an isometry. Expanding and tracing over gives ; thus is a dilation of the given channel. Tracing instead over gives the displayed entries, so the defined record is the complementary channel for this chosen dilation. The choice of labels and basis is part of the representation.
The code-state condition is well-defined because the code projector specifies exactly which density operators are supported on . Equality of full operators entails equality of their diagonal entries, while diagonal entries alone do not specify off-diagonal entries. For example, the two density matrices and have the same diagonal and are different. These matrices occur as complementary records for a single channel on the full two-dimensional code: take , , , and . The map is completely positive, since each amplification is a sum of conjugations, and is trace-preserving, since . The record formula gives for every density operator . Its diagonal entries are both for every code state, whereas the inputs and yield the two distinct matrices above. Thus diagonal independence over all code states does not imply full-record independence.
Depends on
- Complementary channels and coherent information
- Partial trace over the first tensor factor
- Finite Kraus representation
- Finite-dimensional quantum channel
- Quantum code as an isometric encoding and its code projector
- Density operator
- Ordered tensor registers, their inner product, and wire permutations
- Partial trace over a finite tensor factor
- Completely positive maps
Used by · 9
- Monolithic encoding and degenerate error processes
- Frequency shifts, which-path records, and passive protection
- Environment-state independence under KL
- Jump histories, distinguishability, and limits of Kraus rank
- Minimal-code decay detection without correction
- Bosonic anharmonicity and finite-energy GKP tradeoff
- Logical information leakage versus erasure flags
- Degeneracy lifting that also modifies jump operators
- Syndrome flags and logical-state-independent environmental records
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.