Fault-tolerant Coding for Entanglement-Assisted Communication

Abstract

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly noiseless gates. In the case of communication over quantum channels, however, this assumption is widely believed to be unrealistic, even in the long-term, due to the fragility of quantum information, which is affected by the process of decoherence. Christandl and Müller-Hermes have therefore initiated the study of fault-tolerant channel coding for quantum channels, i.e. coding schemes where encoder and decoder circuits are affected by noise, and have used techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. Here, we extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero. A main tool, which might be of independent interest, is the introduction of fault-tolerant entanglement distillation. We furthermore focus on the modularity of the techniques used, so that they can be easily adopted in other fault-tolerant communication scenarios.

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• Fault-tolerant quantum computation by anyons
• Multiple Particle Interference and Quantum Error Correction
• Distillation of secret key and entanglement from quantum states
• The capacity of the noisy quantum channel
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Resilient Quantum Computation: Error Models and Thresholds
• Quantum Reverse Shannon Theorem
• A Resource Framework for Quantum Shannon Theory
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• Tema Con Variazioni: Quantum Channel Capacity
• The classical communication cost of entanglement manipulation: Is entanglement an inter-convertible resource?
• Classical information capacity of superdense coding
• Tight continuity bounds for the quantum conditional mutual information, for the Holevo quantity and for capacities of quantum channels
• Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
• Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement
• Long-distance quantum communication over noisy networks without long-time quantum memory
• Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy
• Fault-tolerant Coding for Quantum Communication

Cited by in corpus (4)

• Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computer
• Mitigating errors in logical qubits
• Fundamental Limit on the Power of Entanglement Assistance in Quantum Communication
• Information storage and transmission under Markovian noise