Communicating Over Adversarial Quantum Channels Using Quantum List Codes

Creators: Leung, Debbie; Smith, Graeme

Style

An error occurred while generating the citation.

Abstract

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

Additional Information

© Copyright 2008 IEEE. Reprinted with permission. Manuscript received June 14, 2006; revised July 6, 2007. [Posted online: 2008-01-22] D. Leung acknowledges travel funds from the CIAR to visit IBM, and funding from the Tolman Foundation, CIAR, NSERC, CRC, CFI, and OIT. The work of G. Smith was supported by the U.S. NSF Grant PHY-0456720 and Canada's NSERC. This work was supported by the U.S. NSF Grant EIA-0086038. The material in this correspondence was presented at the Ninth Workshop on Quantum Information Processing, Paris, France, January 2006. The authors are grateful to Roberto Oliveira, John Smolin, Daniel Gottesman, and especially Aram Harrow for helpful discussions, as well as to the IBM T.J. Watson Research Center, where the bulk of this work was completed.

Files

LEUieeetit08.pdf

Files (226.2 kB)

Name	Size	Download all
LEUieeetit08.pdf md5:c45d48228c1beb73c944d7eac1262533	226.2 kB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes