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.
Exact quantum, private, and entanglement-assisted erasure capacities
Statement
For the finite-dimensional flagged erasure channel with input dimension and erasure probability ,
All capacities are in nats per channel use. The unassisted quantum and private formulas are zero in the antidegradable regime .
Facts & Assumptions
Given: A data dimension , erasure probability , and the capacity conventions in the Statement.
Complement and degradation maps of the erasure channel: the channel is degradable for and antidegradable for .
Single-letter quantum and private capacities of degradable channels: for a degradable channel, .
Regularized coherent-information formula for quantum capacity, Regularized private-information formula for quantum channel capacity, and Additive entanglement-assisted classical capacity formula: general capacities are given by the respective regularized or additive information formulas.
Data processing for finite quantum mutual information: applying a channel to one register cannot increase finite quantum mutual information.
Finite quantum mutual, conditional, and conditional mutual information: for finite bipartite states.
Private information is an average coherent-information difference: private information is for a finite input ensemble and its complementary output.
The maximally mixed state maximizes finite quantum entropy: , with equality at .
Finite-dimensional channels compose and tensor: tensor products of finite-dimensional channels are channels and tensor products of complements implement the product dilation.
Coherent information equals output entropy minus environment entropy: coherent information equals receiver-output entropy minus complementary-output entropy for every finite channel and fixed dilation.
Proof
By [F1] and [F8], the coherent information of an input state is , with and . If , its maximum is , attained at .
Now suppose . By [F2], there is an antidegrading channel with . Its tensor powers are channels by [F9]. For any -use input state and purification reference , [F5] gives . The joint state from a product Stinespring isometry is pure, so Schmidt decomposition gives and . By the mutual-information definition [F6], where the last equality is [F10]. Hence the data-processing inequality forces . A pure input attains zero, so the -use coherent-information supremum is zero and [F4] gives .
For , [F2] says the channel is degradable; applying [F3] to step 1.1 gives . This includes , where the value is zero.
For any finite -use ensemble, [F7] and [F6] express private information as . The antidegrading channel on and [F5] make this difference nonpositive. The singleton ensemble has private information zero, so each -use private-information supremum is zero; [F4] gives .
By [F1] and [F4], the entanglement-assisted objective is . Since , [F8] makes its maximum , proving the final formula.
Depends on
- Finite-dimensional quantum erasure channel
- Operational quantum, private, and entanglement-assisted capacities
- Complement and degradation maps of the erasure channel
- Coherent information of a qudit erasure channel
- The finite-dimensional erasure map is a quantum channel
- Data processing for finite quantum mutual information
- Finite quantum mutual, conditional, and conditional mutual information
- The maximally mixed state maximizes finite quantum entropy
- Single-letter quantum and private capacities of degradable channels
- Regularized coherent-information formula for quantum capacity
- Regularized private-information formula for quantum channel capacity
- Additive entanglement-assisted classical capacity formula
- Finite-dimensional channels compose and tensor
- Private information is an average coherent-information difference
- Coherent information equals output entropy minus environment entropy
- Schmidt decomposition
Used by
Dependency tree · two levels
80 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, §8.3.2 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, Proposition 24.7.1 (standard reference, not scraped)