GAN decoder on a quantum toric code for noise-robust quantum teleportation

• URL: http://arxiv.org/abs/2409.06984v3
• Date: Mon, 25 Aug 2025 14:18:54 GMT
• Title: GAN decoder on a quantum toric code for noise-robust quantum teleportation
• Authors: Jiaxin Li, Zhimin Wang, Alberto Ferrara, Yongjian Gu, Rosario Lo Franco,
• Abstract summary: We propose a generative adversarial network (GAN)-based decoder for quantum topological codes.<n>We apply it to enhance a quantum teleportation protocol under depolarizing noise.
• Score: 21.80993228019571
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a generative adversarial network (GAN)-based decoder for quantum topological codes and apply it to enhance a quantum teleportation protocol under depolarizing noise. By constructing and training the GAN's generator and discriminator networks using eigenvalue datasets from the code, we obtain a decoder with a significantly improved decoding pseudo-threshold. Simulation results show that our GAN decoder achieves a pseudo-threshold of approximately $p=0.2108$, estimated from the crossing point of logical error rate curves for code distances $d=3$ and $d=5$, nearly double that of a classical decoder under the same conditions ($p \approx 0.1099$). Moreover, at the same target logical error rate, the GAN decoder consistently achieves higher logical fidelity compared to the classical decoder. When applied to quantum teleportation, the protocol optimized using our decoder demonstrates enhanced fidelity across noise regimes. Specifically, for code distance $d=3$, fidelity improves within the depolarizing noise threshold range $P<0.06503$; for $d=5$, the range extends to $P<0.07512$. Moreover, with appropriate training, our GAN decoder can generalize to other error models. This work positions GANs as powerful tools for decoding in topological quantum error correction, offering a flexible and noise-resilient framework for fault-tolerant quantum information processing.

Related papers

• Bidirectional Decoding for Concatenated Quantum Hamming Codes [6.26319455798863]
  We introduce a hard-decision decoder ford quantum codes with time complexity for scaling.<n>For thed $[15,3]]$ quantum Hamming code under independent bit-flip noise, the bidirectional decoder improves the threshold.<n>Our results can enhance the competitiveness of low-overhead fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2026-01-14T04:09:37Z)
• Self-attention U-Net decoder for toric codes [7.564303967741644]
  A scalable efficient decoder is most desired for the application of the quantum error correction codes.<n>In this work, we propose a self-attention U-Net quantum decoder (SU-NetQD) for toric code.<n>We achieve lower logical error rates compared with MWPM and discover an increased trend of code threshold as the increase of noise bias.
  arXiv  Detail & Related papers  (2025-06-03T10:50:47Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes. We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.0]
  We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes" One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
  arXiv  Detail & Related papers  (2023-09-18T18:00:02Z)
• Neural network decoder for near-term surface-code experiments [0.7100520098029438]
  Neural-network decoders can achieve a lower logical error rate compared to conventional decoders. These decoders require no prior information about the physical error rates, making them highly adaptable.
  arXiv  Detail & Related papers  (2023-07-06T20:31:25Z)
• A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes [12.687083899824314]
  Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms. We propose a scalable, fast, and programmable neural decoding system to meet the requirements of FTQEC for rotated surface codes (RSC) Our system achieves an extremely low decoding latency of 197 ns, and the accuracy results of our system are close to minimum weight perfect matching (MWPM)
  arXiv  Detail & Related papers  (2023-05-25T06:23:32Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• 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)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction [3.222802562733787]
  A fault-tolerant quantum computer will be supported by a classical decoding system interfacing with quantum hardware. We propose a local pre-decoder', which makes greedy corrections to reduce the amount of syndrome data sent to a standard matching decoder. We find substantial improvements in the runtime of the global decoder and the communication bandwidth by using the pre-decoder.
  arXiv  Detail & Related papers  (2022-08-09T11:01:56Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Adversarial Neural Networks for Error Correcting Codes [76.70040964453638]
  We introduce a general framework to boost the performance and applicability of machine learning (ML) models. We propose to combine ML decoders with a competing discriminator network that tries to distinguish between codewords and noisy words. Our framework is game-theoretic, motivated by generative adversarial networks (GANs)
  arXiv  Detail & Related papers  (2021-12-21T19:14:44Z)
• Dynamic Neural Representational Decoders for High-Resolution Semantic Segmentation [98.05643473345474]
  We propose a novel decoder, termed dynamic neural representational decoder (NRD) As each location on the encoder's output corresponds to a local patch of the semantic labels, in this work, we represent these local patches of labels with compact neural networks. This neural representation enables our decoder to leverage the smoothness prior in the semantic label space, and thus makes our decoder more efficient.
  arXiv  Detail & Related papers  (2021-07-30T04:50:56Z)
• Scalable and Efficient Neural Speech Coding [24.959825692325445]
  This work presents a scalable and efficient neural waveform (NWC) for speech compression. The proposed CNN autoencoder also defines quantization and coding as a trainable module. Compared to the other autoregressive decoder-based neural speech, our decoder has significantly smaller architecture.
  arXiv  Detail & Related papers  (2021-03-27T00:10:16Z)
• Enhanced noise resilience of the surface-GKP code via designed bias [0.0]
  We study the code obtained by concatenating the standard single-mode Gottesman-Kitaev-Preskill (GKP) code with the surface code. We show that the noise tolerance of this surface-GKP code with respect to (Gaussian) displacement errors improves when a single-mode squeezing unitary is applied to each mode.
  arXiv  Detail & Related papers  (2020-04-01T16:08:52Z)
• Your GAN is Secretly an Energy-based Model and You Should use Discriminator Driven Latent Sampling [106.68533003806276]
  We show that sampling in latent space can be achieved by sampling in latent space according to an energy-based model induced by the sum of the latent prior log-density and the discriminator output score. We show that Discriminator Driven Latent Sampling(DDLS) is highly efficient compared to previous methods which work in the high-dimensional pixel space.
  arXiv  Detail & Related papers  (2020-03-12T23:33:50Z)
• Deep Q-learning decoder for depolarizing noise on the toric code [0.0]
  We present an AI-based decoding agent for quantum error correction of depolarizing noise on the toric code. The agent is trained using deep reinforcement learning (DRL), where an artificial neural network encodes the state-action Q-values of error-correcting $X$, $Y$, and $Z$ Pauli operations. We argue that the DRL-type decoder provides a promising framework for future practical error correction of topological codes.
  arXiv  Detail & Related papers  (2019-12-30T13:27:07Z)

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.