Quantum Error Correction via Noise Guessing Decoding
Auteurs : Diogo Cruz, Francisco A. Monteiro, Bruno C. Coutinho
Résumé scientifique
Quantum error correction codes (QECCs) play a central role both in quantum communications and in quantum computation, given how error-prone quantum technologies are. Practical quantum error correction codes, such as stabilizer codes, are generally structured to suit a specific use, and present rigid code lengths and code rates, limiting their adaptability to changing requirements. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime, for any chosen code length and when the code rate is sufficiently high. A recently proposed strategy for decoding classical codes called GRAND (guessing random additive noise decoding) opened doors to decoding classical random linear codes (RLCs) that perform near the capacity of the finite blocklength regime. By making use of the noise statistics, GRAND is a noise-centric efficient universal decoder for classical codes, providing there is a simple code membership test. These conditions are particularly suitable for quantum systems and therefore the paper extends these concepts to quantum random linear codes (QRLCs), which were known to be possible to construct but whose decoding was not yet feasible. By combining QRLCs and a newly proposed quantum GRAND, this paper shows that decoding versatile quantum error correction is possible, allowing for QECCs that are simple to adapt on the fly to changing conditions. The paper starts by assessing the minimum number of gates in the coding circuit needed to reach the QRLCs' asymptotic performance, and subsequently proposes a quantum GRAND algorithm that makes use of quantum noise statistics, not only to build an adaptive code membership test, but also to efficiently implement syndrome decoding.
Les articles autour de lui, par date et par proximité
Plus haut, c’est plus proche de cet article ; à gauche, c’est plus ancien. Les traits relient les articles proches entre eux : les groupes de traits sont des sous-thèmes. Sélectionnez un point pour voir pourquoi il est là. Retour au résumé de cet article
Les articles autour de celui-ci
Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.
Les articles les plus proches
-
Fault-Tolerant Noise Guessing Decoding of Quantum Random CodesDiogo Cruz, Francisco A. Monteiro, André Roque et al. · 2024 · IEEE Transactions on Quantum Engineering · cité 4 fois · Pas encore résumé
Résumé scientifique
This work addresses the open question of implementing fault-tolerant quantum random linear codes (QRLCs) with feasible computational overhead. We present a new decoder for QRLCs capable of dealing with imperfect decoding operations. A first approach, introduced by Cruz et al. (2023), only considered channel errors and perfect gates at the decoder. Here, we analyze the fault-tolerant characteristics of QRLCs with a new noise guessing decoding technique, when considering preparation, measurement, and gate errors in the syndrome extraction procedure, while also accounting for error degeneracy. Our findings indicate a threshold error rate (<inline-formula><tex-math notation="LaTeX">${p_{\text{th…
-
Universal Decoding of Quantum Stabilizer Codes via Classical GuessworkDaryus Chandra, Zeynep B. Kaykac Egilmez, Yifeng Xiong et al. · 2023 · IEEE Access · cité 15 fois · Pas encore résumé
Résumé scientifique
A universal decoding scheme is conceived for quantum stabilizer codes (QSCs) by appropriately adapting the ‘guessing random additive noise decoding’ (GRAND) philosophy of classical domain codes. We demonstrate that the generalized quantum decoder conceived is eminently suitable for different QSC decoding paradigms, namely for both stabilizer-measurement-based as well as the inverse-encoder-based decoding. We then harness the resultant decoder for both quantum Bose-Chaudhuri-Hocquenghem (BCH) codes and quantum polar codes and quantify both their quantum block error rate (QBLER), and QBLER per logical qubits as well as their decoding complexity. Furthermore, we provide a parametric study of th…
-
Duality of Quantum and Classical Error Correction Codes: Design Principles and ExamplesZunaira Babar, Daryus Chandra, H. Nguyen et al. · 2019 · IEEE Communications Surveys and Tutorials · cité 68 fois · Pas encore résumé
Résumé scientifique
Quantum error correction codes (QECCs) can be constructed from the known classical coding paradigm by exploiting the inherent isomorphism between the classical and quantum regimes, while also addressing the challenges imposed by the strange laws of quantum physics. In this spirit, this paper provides deep insights into the duality of quantum and classical coding theory, hence aiming for bridging the gap between them. Explicitly, we survey the rich history of both classical as well as quantum codes. We then provide a comprehensive slow-paced tutorial for constructing stabilizer-based QECCs from arbitrary binary as well as quaternary codes, as exemplified by the dual-containing and non-dual-co…
-
Quantum Codes for Generalized Amplitude-damping NoiseSourav Dutta, A. Rudra, Manav Seksaria et al. · 2026 · Pas encore résumé
Résumé scientifique
Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, …
-
Decoder- and Noise-Aware Optimization Framework for Clifford-Deformed Quantum Error-Correcting CodesJulius Rye Bønnelykke, Benjamin Joecker, Peter Krogstrup et al. · 2026 · Pas encore résumé
Résumé scientifique
Practical fault-tolerant quantum computing requires qubit-efficient quantum error correction (QEC). Clifford deformations (CDs) modify the stabilizers of a QEC code to lower its logical error rate at no additional resource cost. However, the number of possible CDs grows exponentially with the number of qubits, making exhaustive search infeasible beyond small codes. In this work, we further show that under circuit level noise the optimal CD depends strongly on both the noise model and decoder. To make systematic CD optimization possible, we introduce Evolution-Based Best-arm Identification (EBBI), a shot-efficient search algorithm that treats the circuit, noise model and decoder as a black bo…
-
Stabilizer Codes and Quantum Error CorrectionD. Gottesman · 1997 · arXiv: Quantum Physics · preprint, non relu par les pairs · cité 3 412 fois · Pas encore résumé
Résumé scientifique
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum cha…
-
Quantum error correction for beginnersS. Devitt, W. Munro, K. Nemoto · 2009 · Reports on progress in physics. Physical Society · cité 852 fois · Pas encore résumé
Résumé scientifique
Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspects of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large-scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large-scale …
-
LiftDiff: Guided Discrete Diffusion for Quantum Code ConstructionY. Peled, Eliya Nachmani · 2026 · Pas encore résumé
Résumé scientifique
The realization of fault-tolerant quantum computation relies on Quantum Error-Correcting Codes (QECC). Of particular interest are codes that combine a high encoding rate with sufficient distance. Existing algebraic constructions, such as lifted product (LP) codes, build a large quantum low-density parity-check (qLDPC) code from a classical base matrix. In this work we introduce LiftDiff, a generative approach to the discovery of QECC. A discrete denoising diffusion model is trained to generate base matrices over the group algebra $\mathbb{F}_2[\mathbb{Z}_\ell]$, which are then expanded into LP codes. The reverse diffusion process is guided by an energy function that evaluates quantum code pr…
Les travaux antérieurs sur lesquels il s’appuie
-
Short random circuits define good quantum error correcting codesWinton Brown, Omar Fawzi · 2013 · 2013 IEEE International Symposium on Information Theory · cité 48 fois · Pas encore résumé
Résumé scientifique
We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with O(nlog2 n) gates can be used to encode k qubits in n qubits with a distance d provided k/n <; 1 - d/n log2 3-h(d/n). In addition, we prove that such circuits typically have a depth of O(log3 n).
-
Quantum Coding with Low-Depth Random CircuitsM. Gullans, Stefan Krastanov, D. Huse et al. · 2020 · Physical Review X · cité 73 fois · Pas encore résumé
Résumé scientifique
Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts. Here, we use ensembles of low-depth random circuits with local connectivity in $D\ge 1$ spatial dimensions to generate quantum error-correcting codes. For random stabilizer codes and the erasure channel, we find strong evidence that a depth $O(\log N)$ random circuit is necessary and sufficient to converge (with high probability) to zero failure probability for any finite amount below the channel capacity for any $D$. Previous results on random circuits have only shown that $O(N^{1/D})$ depth suffices or that $O(\log^3 N)$ depth …
-
Capacity-Achieving Guessing Random Additive Noise DecodingK. Duffy, Jian-Ge Li, M. Médard · 2018 · IEEE Transactions on Information Theory · cité 257 fois · Pas encore résumé
Résumé scientifique
We introduce a new algorithm for realizing maximum likelihood (ML) decoding for arbitrary codebooks in discrete channels with or without memory, in which the receiver rank-orders noise sequences from most likely to least likely. Subtracting noise from the received signal in that order, the first instance that results in a member of the codebook is the ML decoding. We name this algorithm GRAND for Guessing Random Additive Noise Decoding. We establish that GRAND is capacity-achieving when used with random codebooks. For rates below capacity, we identify error exponents, and for rates beyond capacity, we identify success exponents. We determine the scheme’s complexity in terms of the number of …
-
Construction of Multiple-Rate Quantum LDPC Codes Sharing One Scalable Stabilizer CircuitYun-Jiang Wang, Zhu Xiao, Yi Zhang et al. · 2023 · IEEE Transactions on Communications · cité 3 fois · Pas encore résumé
Résumé scientifique
Variable-rate coding schemes that support a variety of different rates while maintaining the same fundamental encoder/decoder architectures are of great interest in practical communication systems. Similar error-correcting code schemes are also in demand in quantum settings. However, generally, it is difficult to introduce the variable-rate coding schemes into the quantum coding domain attributed to two challenges: Obtaining new quantum codes from old ones systematically and sharing encoder-decoder components among the newly obtained quantum codes. In this correspondence, a multiple-rate coding scheme is introduced into the quantum coding domain, we achieve this goal by providing a systemati…
-
Guessing Random Additive Noise Decoding With Symbol Reliability Information (SRGRAND)K. Duffy, M. Médard, Wei An · 2019 · IEEE Transactions on Communications · cité 70 fois · Pas encore résumé
Résumé scientifique
The design and implementation of error correcting codes has long been informed by two fundamental results: Shannon’s 1948 capacity theorem, which established that long codes use noisy channels most efficiently; and Berlekamp, McEliece, and Van Tilborg’s 1978 theorem on the NP-completeness of decoding linear codes. These results shifted focus away from creating code-independent decoders, but recent low-latency communication applications necessitate relatively short codes, providing motivation to reconsider the development of universal decoders. We introduce a scheme for employing binarized symbol soft information within Guessing Random Additive Noise Decoding, a universal hard detection decod…
Les articles qui le citent
-
Efficient entanglement purification based on noise guessing decodingAndré Roque, Diogo Cruz, Francisco A. Monteiro et al. · 2023 · Quantum · cité 6 fois · Pas encore résumé
Résumé scientifique
In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs. We provide numerical and semi-analytical results to corroborate our findings and provide a detailed comparison with the hashing protocol of Bennet et al. Although that pioneering work devised performance bounds, it did not offer an explicit construction for implementa…
-
Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code DecodingLukas Rapp, Muriel Médard, Eugene Tang et al. · 2026 · Physical Review A · cité 1 fois · Pas encore résumé
Résumé scientifique
We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-output decoding entire component codes rather than individual parity checks, we mitigate the effects of trapping sets and cycles, resulting in improved convergence. Because our decoder preserves the message passing structure of standard belief propagation (BP), it is compatible with many BP enhancements. We demonstrate this with OSD postprocessing, quaternary BP, and RelayBP, each yielding further gains. Standalone SOGRAND outperforms the standard BP+OSD baseline by over two orders of magnitude in logical error rate. …
-
An Analysis of Speculative Window Decoders for Quantum Error CorrectionJocelyn Li, M. Martonosi · 2026 · Pas encore résumé
Résumé scientifique
Fault-tolerant quantum computing is essential for realizing the substantial computational speedups that quantum computing can bring, but it requires real-time error decoding with high performance. Speculative window decoding improves performance by reducing the time spent waiting for dependencies from prior decoding windows. However, speculative decoders have only been evaluated under the regime of superconducting qubits with fast gate speeds, surface codes, and matching decoders. Since different quantum technologies can have slower gate speeds, we evaluate the performance of speculative decoding under slow gate speeds. We also examine its sensitivity to speculation accuracy, decoder latency…
-
GPU-Accelerated Syndrome Decoding for Quantum LDPC Codes below the 63 μs Latency ThresholdOscar Ferraz, Bruno C. Coutinho, Gabriel Falcão et al. · 2025 · Asilomar Conference on Signals, Systems and Computers · cité 5 fois · Pas encore résumé
Résumé scientifique
This paper presents a GPU-accelerated decoder for quantum low-density parity-check (QLDPC) codes that achieves sub-63 μs latency, below the surface code decoder’s real-time threshold demonstrated on Google’s Willow quantum processor. While surface codes have demonstrated below-threshold performance, the encoding rates approach zero as code distances increase, posing challenges for scalability. Recently proposed QLDPC codes, such as those by Panteleev and Kalachev, offer constant-rate encoding and asymptotic goodness but introduce higher decoding complexity. To address such limitation, this work presents a parallelized belief propagation decoder leveraging syndrome information on commodity GP…
-
On Constructing and Decoding Quantum Triorthogonal CodesAlessio Baldelli, Olai Å. Mostad, Hsuan-Yin Lin et al. · 2026 · arXiv.org · preprint, non relu par les pairs · cité 7 fois · Pas encore résumé
Résumé scientifique
Triorthogonal codes are a basic ingredient in magic-state distillation, as they enable transversal implementation of logical $\mathsf{T}$ gates. As a non-Clifford operation, the $\mathsf{T}$ gate enables universal fault-tolerant quantum computation when combined with Clifford operations. We derive an existence criterion for even-weight triorthogonal generator matrices with a target dual minimum distance. The criterion combines triorthogonality constraints with MacWilliams identities via Krawtchouk-polynomial conditions on the dual weight distribution, yielding an integer linear programming formulation for the construction problem. We find novel nontrivial triorthogonal codes (degenerate and …
Aller plus loin
Comment ces articles sont-ils trouvés ?
Nous comparons le titre et le résumé de cet article avec ceux de tous les articles résumés sur ce site, et avec les articles que Semantic Scholar recommande, ceux qu’il cite et ceux qui le citent (pour un article très cité, ses citations les plus récentes et, depuis OpenAlex, les plus citées). Parmi les travaux antérieurs et les suites, les articles qui s’utilisent en profondeur, une méthode qu’il utilise et les suites très citées remontent un peu. Les niveaux (très proche, proche, apparenté) viennent de la similarité des textes, pas d’un jugement de qualité ; * signale un article sans résumé, comparé par son titre. La phrase sous un article est écrite par une IA à partir des deux résumés : vérifiez-la dans les articles. Un article jugé hors sujet par trois lecteurs quitte la liste.
Mis à jour le 6 novembre 2026.