REVIEW 3 cited by
Coding Theorems of Quantum Information Theory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.
Forward citations
Cited by 3 Pith papers
-
Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution
A no-signalling-based lifting of commitment techniques yields the first single-shot loss-tolerant QPV protocol with exponential security decay in the commitment threshold k and 3.7% noise robustness.
-
Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem
The authors prove the Burnashev-Holevo conjecture by deriving a finite-blocklength random coding bound with a dimension-independent prefactor for classical-quantum channels, using a new operator layer cake theorem.
-
Rate-reliability tradeoff for deterministic identification
Imposing exponentially small identification errors removes the superlinear message growth of deterministic identification and yields linear rates governed by the Minkowski dimension of the channel output set.
Discussion (0). Continue with ORCID to comment.