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.
Data processing for finite quantum mutual information
Statement
Let be nonzero finite-dimensional complex inner-product spaces, let be a density operator on , and let and be quantum channels. Then
where quantum mutual information is as in Finite quantum mutual, conditional, and conditional mutual information.
Facts & Assumptions
Given: The spaces, state, and channels in the Statement.
Finite quantum mutual, conditional, and conditional mutual information: for finite bipartite states.
Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state , .
Every finite-dimensional channel has a finite isometric dilation: each finite-dimensional channel has an isometric dilation with output obtained by tracing its finite environment.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: positive operators have finite orthonormal spectral decompositions.
Partial traces of a finite bipartite state are states: partial traces of finite-dimensional density operators are density operators.
Ordered tensor registers, their inner product, and wire permutations and Finite wire permutations are unitary basis permutations: factors may be reordered by a unitary wire permutation, preserving the state and its entropy.
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm product law used in the entropy identities underlying strong subadditivity.
Proof
First apply to . Choose a Stinespring isometry from [F3], and form . This is a state: a spectral decomposition of in [F4] shows that its nonzero eigenvalues remain the same under the isometric embedding. Its marginal is and has the same positive eigenvalues as , while its joint state has the same positive eigenvalues as . Thus [F1] gives .
Reorder to by the unitary permutation in [F6]. Apply [F2] to the ordered tripartite state , with , to obtain . Rearranging by [F1] gives . The entropy identities and their logarithm product law are supplied by [F7]. The marginal is by [F3] and the partial-trace convention; hence applying cannot increase mutual information.
Repeat step 1.1–2.1 with acting on the second register, now taking the first register to be . This gives . Combine this with step 2.1 to obtain the claimed inequality. The entropy-law prerequisite remains [F7].
Depends on
- Finite quantum mutual, conditional, and conditional mutual information
- Finite-dimensional von Neumann entropy
- Strong subadditivity of finite-dimensional quantum entropy
- Every finite-dimensional channel has a finite isometric dilation
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Partial traces of a finite bipartite state are states
- Ordered tensor registers, their inner product, and wire permutations
- Finite wire permutations are unitary basis permutations
- Finite-dimensional channels compose and tensor
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
Used by
- Additivity of optimized entanglement-assisted information Lemma
- Coherent-information concavity and subadditivity for degradable channels Lemma
- Additive entanglement-assisted classical capacity formula Theorem
- Exact quantum, private, and entanglement-assisted erasure capacities Theorem
- Regularized coherent-information formula for quantum capacity Theorem
Dependency tree · two levels
60 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 Watrous, The Theory of Quantum Information, Theorem 5.35 and Chapter 8 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, §§11.7–11.8 (standard reference, not scraped)