Fault-tolerant Coding for Quantum Communication
Matthias Christandl, Alexander M\"uller-Hermes

TL;DR
This paper develops fault-tolerant quantum coding techniques that enable reliable quantum communication even when quantum gates are noisy, establishing thresholds for error rates below which near-optimal transmission rates are achievable.
Contribution
It introduces fault-tolerant quantum capacities and proves threshold theorems, bridging quantum error correction and quantum communication for practical noisy quantum systems.
Findings
Existence of error thresholds for quantum communication rates
Fault-tolerant quantum capacities close to standard capacities
Applicability to both long-distance and on-chip quantum communication
Abstract
Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that these circuits can be implemented using noise-free gates. While this assumption is satisfied for classical machines in many scenarios, it is not expected to be satisfied in the near term future for quantum machines where decoherence leads to faults in the quantum gates. As a result, fundamental questions regarding the practical relevance of quantum channel coding remain open. By combining techniques from fault-tolerant quantum computation with techniques from quantum communication, we initiate the study of these questions. We introduce fault-tolerant versions of quantum capacities quantifying the optimal communication rates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
