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.
Additivity of optimized entanglement-assisted information
Statement
For a finite-dimensional channel , define
For any two finite-dimensional channels ,
Facts & Assumptions
Given: The channels, finite input spaces, and coherent-information convention in the Statement.
Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: for a fixed dilation , .
Finite quantum mutual, conditional, and conditional mutual information: for finite bipartite states.
Data processing for finite quantum mutual information: applying local channels to two registers cannot increase their quantum mutual information.
Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state, .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: finite-dimensional density operators have finite orthonormal eigenbases.
The maximally mixed state maximizes finite quantum entropy: a density operator on a register of dimension has entropy at most .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: is increasing, , and for positive .
Density operator and Finite-dimensional von Neumann entropy: a density operator is non-negative with trace one, and its entropy is in an orthonormal eigenbasis.
Proof
Strong subadditivity [F4] with the middle register one-dimensional gives subadditivity for every bipartite state: tensoring with the unique one-dimensional state leaves all nontrivial spectra unchanged. The proof of this consequence uses the natural-log entropy convention and its product-spectrum calculation, with [F7] supplying the logarithm product law. Thus by [F2].
Fix an arbitrary state , and set to its marginals, , and using product Stinespring dilations. Expanding each entropy by [F1] and each mutual information by [F2] yields . By [F3] applied to the local complementary channels, . Step 1.1 gives , so the displayed difference is nonpositive. Therefore .
For product inputs , diagonalize each density operator using [F5]. The positive eigenvalues of the product are , so expanding and applying [F7] proves entropy additivity and hence . For any density operator, [F5] and [F8] give nonnegative eigenvalues summing to one, so every positive eigenvalue lies in . Monotonicity and in [F7] therefore make each term nonnegative. Together with [F6], this bounds each of , , and between zero and the logarithm of its fixed register dimension, so is bounded above and below and its supremum is finite. For any , choose with . The product input gives . Letting proves the reverse inequality.
Depends on
- Complementary channels and coherent information
- Coherent information equals output entropy minus environment entropy
- Finite quantum mutual, conditional, and conditional mutual information
- Data processing for finite quantum mutual information
- Strong subadditivity of finite-dimensional quantum entropy
- 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
- The maximally mixed state maximizes finite quantum entropy
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- Finite-dimensional von Neumann entropy
- Density operator
Used by
Dependency tree · two levels
55 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, Lemma 8.38 (standard reference, not scraped)
- Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal, Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem, §IV (standard reference, not scraped)