Communicating over adversarial quantum channels using quantum list codes

Abstract

We study quantum communication in the presence of adversarial noise. In this setting, communicating with perfect fidelity requires using a quantum code of bounded minimum distance, for which the best known rates are given by the quantum Gilbert-Varshamov (QGV) bound. By asking only for arbitrarily high fidelity and allowing the sender and reciever to use a secret key with length logarithmic in the number of qubits sent, we achieve a dramatic improvement over the QGV rates. In fact, we find protocols that achieve arbitrarily high fidelity at noise levels for which perfect fidelity is impossible. To achieve such communication rates, we introduce fully quantum list codes, which may be of independent interest.

arXiv comment6 pages. Discussion expanded and more details provided in proofs. Far less unclear than previous version

References in corpus (12)

• Mixed State Entanglement and Quantum Error Correction
• Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
• The capacity of the noisy quantum channel
• Coding Theorem and Strong Converse for Quantum Channels
• Quantum Channels with Memory
• Approximate quantum error correction can lead to better codes
• A family of quantum protocols
• The Capacity of Quantum Channel with General Signal States
• Bounds on classical information capacities for a class of quantum memory channels
• Approximate quantum error correction
• Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
• Channel capacities of classical and quantum list decoding