Fault-tolerant Coding for Entanglement-Assisted Communication

• URL: http://arxiv.org/abs/2210.02939v2
• Date: Tue, 6 Feb 2024 21:06:17 GMT
• Title: Fault-tolerant Coding for Entanglement-Assisted Communication
• Authors: Paula Belzig, Matthias Christandl, Alexander M\"uller-Hermes
• Abstract summary: This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. 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.
• Score: 46.0607942851373
• License: http://creativecommons.org/licenses/by/4.0/
• 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\"uller-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.

Related papers

• Fault-tolerant quantum input/output [6.787248655856051]
  We show that any quantum circuit with quantum input and output can be transformed into a fault-tolerant circuit. The framework allows the direct composition of the statements, enabling versatile future applications.
  arXiv  Detail & Related papers  (2024-08-09T12:26:38Z)
• Covert Quantum Communication Over Optical Channels [2.094817774591302]
  We show a emphsquare root law (SRL) for quantum covert communication similar to that for classical. Our proof uses photonic dual-rail qubit encoding, which has been proposed for long-range repeater-based quantum communication. Our converse employs prior covert signal power limit results and adapts well-known methods to upper bound quantum capacity of optical channels.
  arXiv  Detail & Related papers  (2024-01-12T18:54:56Z)
• Flexible polar encoding for information reconciliation in QKD [2.627883025193776]
  Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure. Errors that are generally considered to be due to the adversary's tempering with the quantum channel need to be corrected using classical communication over a public channel. We show that the reliability sequence can be derived and used to design an encoder independent of the choice of decoder.
  arXiv  Detail & Related papers  (2023-11-30T16:01:10Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Error Correction Code Transformer [92.10654749898927]
  We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths. We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately. The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
  arXiv  Detail & Related papers  (2022-03-27T15:25:58Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Capacity-Approaching Autoencoders for Communications [4.86067125387358]
  The current approach to train an autoencoder relies on the use of the cross-entropy loss function. We propose a methodology that computes an estimate of the channel capacity and constructs an optimal coded signal approaching it.
  arXiv  Detail & Related papers  (2020-09-11T08:19:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.