Quantum Coding Theorem from Privacy and Distinguishability
From MaRDI portal
Abstract: We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.
Recommendations
Cited in
(13)- A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory
- Eigenstate thermalization hypothesis and approximate quantum error correction
- A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem
- A Random Coding Based Proof for the Quantum Coding Theorem
- Towards a unified approach to information-disturbance tradeoffs in quantum measurements
- Quantum sources and a quantum coding theorem
- scientific article; zbMATH DE number 1944611 (Why is no real title available?)
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
- Private quantum codes: introduction and connection with higher rank numerical ranges
- Quantum convolutional coding with shared entanglement: general structure
- Quantum communication in Rindler spacetime
- Separability and the detection of hidden channels
This page was built for publication: Quantum Coding Theorem from Privacy and Distinguishability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521588)