A Random Coding Based Proof for the Quantum Coding Theorem

DOI10.1142/S1230161208000055MaRDI QIDQ3521587zbMATH OpenFDO

Authors Rochus Klesse

Publication date 26 August 2008

Published in Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0712.2558

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Quantum computation (81P68) Coding theorems (Shannon theory) (94A24)

Abstract: We present a proof for the quantum channel coding theorem which relies on the fact that a randomly chosen code space typically is highly suitable for quantum error correction. In this sense, the proof is close to Shannon's original treatment of information transmission via a noisy classical channel.

Recommendations

• Quantum Coding Theorem from Privacy and Distinguishability
• Quantum coding theorems
• Strong converse to the quantum channel coding theorem
• Coding theorem and strong converse for quantum channels
• A note on random coding bounds for classical-quantum channels

Cites work

• A simple formula for the average gate fidelity of a quantum dynamical operation
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Error Correcting Codes in Quantum Theory
• Fidelity for Mixed Quantum States
• Fundamentals of quantum information theory
• General teleportation channel, singlet fraction, and quasidistillation
• Marginal distribution of the S-matrix elements for Dyson's measure and some applications
• On entanglement-assisted classical capacity
• On quantum fidelities and channel capacities
• The transition probability in the state space of a \(^*\)-algebra
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel

Cited in

(10)

• On the reliability function for a quantum communication channel.
• A note on random coding bounds for classical-quantum channels
• The randomness in 2 1 quantum random access code without a shared reference frame
• The capacity of black holes to transmit quantum information
• A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem
• Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
• A Decoupling Approach to the Quantum Capacity
• Quantum Coding Theorem from Privacy and Distinguishability
• Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
• Quantum convolutional coding with shared entanglement: general structure

This page was built for publication: A Random Coding Based Proof for the Quantum Coding Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521587)