Communicating Over Adversarial Quantum Channels Using Quantum List Codes
From MaRDI portal
Publication:3604548
DOI10.1109/TIT.2007.913433zbMATH Open1311.94004arXivquant-ph/0605086OpenAlexW2109145250MaRDI QIDQ3604548FDOQ3604548
Authors:
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/quant-ph/0605086
Recommendations
- Noisy interactive quantum communication
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
- Capacity approaching coding for low noise interactive quantum communication
- Reliability of Calderbank–Shor–Steane codes and security of quantum key distribution
- Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels
Communication theory (94A05) Quantum coding (general) (81P70) Authentication, digital signatures and secret sharing (94A62)
Cited In (3)
This page was built for publication: Communicating Over Adversarial Quantum Channels Using Quantum List Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604548)
