pith. sign in

arxiv: quant-ph/0605086 · v2 · submitted 2006-05-09 · 🪐 quant-ph

Communicating over adversarial quantum channels using quantum list codes

classification 🪐 quant-ph
keywords quantumfidelityachieveratesadversarialarbitrarilycodescommunicating
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.