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.
Single-letter quantum and private capacities of degradable channels
Statement
Let be a finite-dimensional degradable channel with a fixed complement . Then
and both regularizations in the quantum and private capacity formulas collapse to this one-use maximum.
Facts & Assumptions
Given: The finite-dimensional degradable channel and chosen complement in the Statement.
Degradable and antidegradable channels: a degrading channel satisfies .
Coherent-information concavity and subadditivity for degradable channels: for a degradable channel, coherent information is concave and nonnegative; for product degradable channels it is subadditive on joint inputs and its optimized value is additive.
Finite channel information maxima are attained: the finite-dimensional coherent information maximum is attained.
Regularized coherent-information formula for quantum capacity and Regularized private-information formula for quantum channel capacity: the general capacities equal their regularized coherent-information and private-information sequences, respectively.
Private information is an average coherent-information difference: for an ensemble , .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: each density operator is a finite convex combination of rank-one eigenprojections.
Proof
The tensor power of a degradable channel is degradable: the product degrading map is a channel by Finite-dimensional channels compose and tensor, and it maps to . Therefore [F2] gives . Substituting in the regularized quantum formula [F4] yields .
For any -use input ensemble , its tensor-power channel is degradable by step 1.1. By [F5], its private information is the coherent information of the average minus the average branch coherent information. Each branch term is nonnegative by [F2], so this private information is at most . Hence the -use private-information supremum has the same upper bound.
Choose a maximizing state using [F3], and decompose it spectrally as using [F6]. For a pure input , choose a one-dimensional purification reference; the joint output-reference state has the same nonzero eigenvalues as , so the defining formula in Complementary channels and coherent information gives . Therefore the pure-state ensemble has private information by [F5]. Thus ; step 2.1 with gives the reverse inequality, and step 2.1 for all gives . The regularized formula [F4] therefore yields .
The identities in steps 1.1 and 3.1 prove the stated equality and remove both regularizations.
Depends on
- Degradable and antidegradable channels
- Complementary channels and coherent information
- Operational quantum, private, and entanglement-assisted capacities
- Private information of a finite channel ensemble
- Coherent-information concavity and subadditivity for degradable channels
- Finite channel information maxima are attained
- Regularized coherent-information formula for quantum capacity
- Regularized private-information formula for quantum channel capacity
- Finite-dimensional channels compose and tensor
- Private information is an average coherent-information difference
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Used by
Dependency tree · two levels
71 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, Chapter 8 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, Theorem 13.5.2 and §24.8 (standard reference, not scraped)
- Devetak and Shor, The capacity of a quantum channel for simultaneous transmission of classical and quantum information, §4 (standard reference, not scraped)