A Random Coding Based Proof for the Quantum Coding Theorem
From MaRDI portal
Publication:3521587
DOI10.1142/S1230161208000055zbMath1145.81024arXiv0712.2558MaRDI QIDQ3521587
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
Quantum computation (81P68) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)
Related Items (2)
The capacity of black holes to transmit quantum information ⋮ Quantum convolutional coding with shared entanglement: general structure
Cites Work
- Fundamentals of quantum information theory
- The transition probability in the state space of a \(^*\)-algebra
- A simple formula for the average gate fidelity of a quantum dynamical operation
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- Fidelity for Mixed Quantum States
- Error Correcting Codes in Quantum Theory
- On quantum fidelities and channel capacities
- General teleportation channel, singlet fraction, and quasidistillation
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Marginal distribution of the S-matrix elements for Dyson's measure and some applications
- On entanglement-assisted classical capacity
This page was built for publication: A Random Coding Based Proof for the Quantum Coding Theorem
