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 channels and coherent information
Definition
Let and be nonzero finite-dimensional complex inner-product spaces and let be a quantum channel as in Finite-dimensional quantum channel. Choose a finite-dimensional environment and a linear isometry such that
for every ; such a dilation exists by Every finite-dimensional channel has a finite isometric dilation. The channel
is the complementary channel associated with this chosen dilation. The partial trace contracts the first factor of the ordered product (Partial trace over the first tensor factor).
It is a quantum channel: reorder to by the finite wire-permutation unitary (Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations); the reordered is still an isometry, so tracing its second factor gives a channel by An isometry followed by partial trace is a channel.
For a density operator on , choose a finite purification with (Ensemble and purification), and define . Its coherent information from to is
where is finite-dimensional von Neumann entropy in nats (Finite-dimensional von Neumann entropy). The value does not depend on the chosen purification: after padding reference spaces, any two purifications differ by a unitary on (Purifications exist and are unitarily equivalent after padding); applying preserves that unitary relation. A unitary maps an orthonormal eigenbasis to an orthonormal eigenbasis with the same eigenvalues, so entropy is unchanged (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely). Padding adds only zero eigenvalues, which do not contribute.
Remarks
The chosen complement may vary with the dilation, but its output entropy on equals : applying to the first tensor factor of the purifying vector gives a pure state on . After reordering the factors, its complementary and marginals have the same positive eigenvalues. The corresponding entropy identity is proved in Coherent information equals output entropy minus environment entropy.
Depends on
- Finite-dimensional quantum channel
- Every finite-dimensional channel has a finite isometric dilation
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Finite-dimensional von Neumann entropy
- Ensemble and purification
- Purifications exist and are unitarily equivalent after padding
- Partial trace over a finite tensor factor
- Partial trace over the first tensor factor
- Ordered tensor registers, their inner product, and wire permutations
- Finite wire permutations are unitary basis permutations
- An isometry followed by partial trace is a channel
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Finite-dimensional channels compose and tensor
Used by
- Degradable and antidegradable channels Definition
- Operational quantum, private, and entanglement-assisted capacities Definition
- Private information of a finite channel ensemble Definition
- Entanglement-assisted capacity of a noiseless qubit Example
- Additivity of optimized entanglement-assisted information Lemma
- Coherent information equals output entropy minus environment entropy Lemma
- Coherent-information concavity and subadditivity for degradable channels Lemma
- Exact flat spectral-type reduction of channel information Lemma
- Finite channel information maxima are attained Lemma
- Flat-input coherent information is achievable by subspace codes Lemma
- Flat-input entanglement-assisted achievability by Weyl coding Lemma
- Private information is an average coherent-information difference Lemma
- Product additivity of coherent and private information Lemma
- Additive entanglement-assisted classical capacity formula Theorem
- Regularized coherent-information formula for quantum capacity Theorem
- Single-letter quantum and private capacities of degradable channels Theorem
Dependency tree · two levels
64 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
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, §13.5 (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information, §8.2.2 (standard reference, not scraped)