Communicating over adversarial quantum channels using quantum list codes
| dc.creator | Leung, Debbie | |
| dc.creator | Smith, Graeme | |
| dc.date | 2006-05-09 | |
| dc.date | 2007-04-17 | |
| dc.date.accessioned | 2026-07-07T08:56:35Z | |
| dc.date.available | 2026-07-07T08:56:35Z | |
| dc.description | 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. | |
| dc.description | 6 pages. Discussion expanded and more details provided in proofs. Far less unclear than previous version | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0605086 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0605086 | |
| dc.identifier | IEEE Trans. Info. Theory 54, 2, 883-887 (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/146665 | |
| dc.subject | Quantum Physics | |
| dc.title | Communicating over adversarial quantum channels using quantum list codes | |
| dc.type | text |