Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Access

Universal Decoding of Quantum Stabilizer Codes via Classical Guesswork

Daryus Chandra, Zeynep B. Kaykac Egilmez, Yifeng Xiong, Soon Xin Ng, Robert G. Maunder, Lajos Hanzo

Published Jan 1, 2023• 14 citations
Publisher

Abstract

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 the associated design trade-offs and offer design guideline for the implementation of GRAND-based QSC decoders.

DOI
10.1109/access.2023.3247966

Related papers

Universal Decoding of Quantum Stabilizer Codes via Classical Guesswork

Zunaira Babar, Daryus Chandra, Soon Xin Ng +1 more

In this chapter, a so-called universal decoding framework is proposed for quantum stabilizer codes. It is termed as universal because it is directly suitable for the decoding of arbitrary linear codes, including polar codes, BCH codes, etc. It relies on appropriately adapting the classical guessing random additive noise decoding (GRAND) philosophy for the quantum domain. As a further benefit, this framework is shown to operate under both the so-called stabilizer-measurement-based and the inverse-encoder-based design paradigms, thereby covering a broad range of quantum error correction codes. Performance evaluations are carried out using quantum BCH and quantum polar codes. The results are reported in terms of both quantum block error rate (QBLER) and QBLER per logical qubit versus the decoding complexity. The results demonstrate that – as expected – codes having higher minimum distances achieve stronger protection, while the complexity is primarily dictated by the number of physical qubits. This chapter also provides design guidelines, establishing GRAND-based quantum decoding as a flexible design option.

Wiley eBooks•Dec 18, 2025•0 citations

Quantum Error Correction Via Noise Guessing Decoding

Diogo Cruz, Francisco A. Monteiro, Bruno Coelho Coutinho

Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. 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. 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 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 efficiently decode classical random linear codes (RLCs) performing near the maximum rate of the finite blocklength regime. By using noise statistics, GRAND is a noise-centric efficient universal decoder for classical codes, provided that a simple code membership test exists. 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 work shows it is possible to decode QECCs that are easy to adapt 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.

arXiv:2208.02744•IEEE Access•Jan 1, 2023•25 citations

Average-Case Complexity of Quantum Stabilizer Decoding

Andrey Boris Khesin, Jonathan Z. Lu, Alexander Poremba +2 more

Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all known algorithms at constant rate require exponential time. By contrast, the complexity of decoding a random quantum stabilizer code has remained an open question for quite some time. This work closes the gap in our understanding of the algorithmic hardness of decoding random quantum versus random classical codes. We prove that decoding a random stabilizer code with even a single logical qubit is at least as hard as decoding a random classical code at constant rate--the maximally hard regime. This result suggests that the easiest random quantum decoding problem is at least as hard as the hardest random classical decoding problem, and shows that any sub-exponential algorithm decoding a typical stabilizer code, at any rate, would immediately imply a breakthrough in cryptography.

arXiv:2509.20697•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2026•4 citations

Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms

Li Wan, Wenyi Zhang

Guessing Random Additive Noise Decoding (GRAND) performs decoding by sequentially guessing channel error patterns (EPs). Ordered Reliability Bits GRAND (ORBGRAND) is a notable instance suitable for efficient implementation, as it schedules EPs solely according to the ranking of soft channel outputs. In this paper, we generalize this principle to a broader class of GRAND algorithms whose testing order depends only on reliability ranking, referred to as ORB-type GRAND. We develop a unified analytical framework based on a key quantity termed the average guessing posterior (AGP), which captures the effectiveness of each EP and reduces decoding into an ordering problem over the EP space. For random code ensembles, we derive exact expressions for the block error rate (BLER), stopping-time distribution, and average number of tests under a fixed test budget. The analysis separates target-miss and target-preemption errors and shows that ordering EPs by non-increasing AGP is optimal over the EP set under consideration. For fixed linear block codes, we derive the BLER expression that isolates the code-dependent target-preemption term and characterize this term through higher-order weight relationships of codeword tuples, with a computable first-order upper bound as a useful special case. Guided by these insights, we formulate ReShuffled-ORBGRAND (RS-ORBGRAND) as an offline AGP-based reshuffling scheme. Numerical results for the Bose--Chaudhuri--Hocquenghem (BCH)$(127,113)$ code show that RS-ORBGRAND consistently improves existing ORB-type GRAND algorithms and lies within $0.1$~dB of a maximum-likelihood decoding lower-bound benchmark at a BLER of $10^{-6}$.

arXiv:2606.28030•Jun 26, 2026•3 citations

Ordered Reliability Bits Guessing Random Additive Noise Decoding

Ken R. Duffy, Wei An, Muriel Médard

Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can accurately decode any moderate redundancy block-code. It is designed with efficient circuit implementation in mind, and determines accurate decodings while retaining the original hard detection GRAND algorithm's suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide excellent soft decision block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with modest complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder. ORBGRAND offers the possibility of an accurate, energy efficient soft detection decoder suitable for delivering URLLC in a single hardware realization.

arXiv:2202.13951•IEEE Transactions on Signal Processing•Jan 1, 2022•148 citations

Nonbinary Stabilizer Codes

Pradeep Kiran Sarvepalli, Andreas Klappenecker, Salah A. Aly

Recently, the field of quantum error-correcting codes has rapidly emerged as an important discipline. As quantum information is extremely sensitive to noise, it seems unlikely that any large scale quantum computation is feasible without quantum error-correction. In this paper we give a brief exposition of the theory of quantum stabilizer codes. We review the stabilizer formalism of quantum codes, establish the connection between classical codes and stabilizer codes and the main methods for constructing quantum codes from classical codes. In addition to the expository part, we include new results that cannot be found elsewhere. Specifically, after reviewing some important bounds for quantum codes, we prove the nonexistence of pure perfect quantum stabilizer codes with minimum distance greater than 3. Finally, we illustrate the general methods of constructing quantum codes from classical codes by explicitly constructing two new families of quantum codes and conclude by showing how to construct new quantum codes by shortening.

Chapman & Hall/CRC applied mathematics and nonlinear science series•Sep 19, 2007•7 citations
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 the associated design trade-offs and offer design guideline for the implementation of GRAND-based QSC decoders.
In this chapter, a so-called universal decoding framework is proposed for quantum stabilizer codes. It is termed as universal because it is directly suitable for the decoding of arbitrary linear codes, including polar codes, BCH codes, etc. It relies on appropriately adapting the classical guessing random additive noise decoding (GRAND) philosophy for the quantum domain. As a further benefit, this framework is shown to operate under both the so-called stabilizer-measurement-based and the inverse-encoder-based design paradigms, thereby covering a broad range of quantum error correction codes. Performance evaluations are carried out using quantum BCH and quantum polar codes. The results are reported in terms of both quantum block error rate (QBLER) and QBLER per logical qubit versus the decoding complexity. The results demonstrate that – as expected – codes having higher minimum distances achieve stronger protection, while the complexity is primarily dictated by the number of physical qubits. This chapter also provides design guidelines, establishing GRAND-based quantum decoding as a flexible design option.
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. 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. 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 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 efficiently decode classical random linear codes (RLCs) performing near the maximum rate of the finite blocklength regime. By using noise statistics, GRAND is a noise-centric efficient universal decoder for classical codes, provided that a simple code membership test exists. 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 work shows it is possible to decode QECCs that are easy to adapt 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.
Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all known algorithms at constant rate require exponential time. By contrast, the complexity of decoding a random quantum stabilizer code has remained an open question for quite some time. This work closes the gap in our understanding of the algorithmic hardness of decoding random quantum versus random classical codes. We prove that decoding a random stabilizer code with even a single logical qubit is at least as hard as decoding a random classical code at constant rate--the maximally hard regime. This result suggests that the easiest random quantum decoding problem is at least as hard as the hardest random classical decoding problem, and shows that any sub-exponential algorithm decoding a typical stabilizer code, at any rate, would immediately imply a breakthrough in cryptography.
Guessing Random Additive Noise Decoding (GRAND) performs decoding by sequentially guessing channel error patterns (EPs). Ordered Reliability Bits GRAND (ORBGRAND) is a notable instance suitable for efficient implementation, as it schedules EPs solely according to the ranking of soft channel outputs. In this paper, we generalize this principle to a broader class of GRAND algorithms whose testing order depends only on reliability ranking, referred to as ORB-type GRAND. We develop a unified analytical framework based on a key quantity termed the average guessing posterior (AGP), which captures the effectiveness of each EP and reduces decoding into an ordering problem over the EP space. For random code ensembles, we derive exact expressions for the block error rate (BLER), stopping-time distribution, and average number of tests under a fixed test budget. The analysis separates target-miss and target-preemption errors and shows that ordering EPs by non-increasing AGP is optimal over the EP set under consideration. For fixed linear block codes, we derive the BLER expression that isolates the code-dependent target-preemption term and characterize this term through higher-order weight relationships of codeword tuples, with a computable first-order upper bound as a useful special case. Guided by these insights, we formulate ReShuffled-ORBGRAND (RS-ORBGRAND) as an offline AGP-based reshuffling scheme. Numerical results for the Bose--Chaudhuri--Hocquenghem (BCH)(127,113)(127,113)(127,113) code show that RS-ORBGRAND consistently improves existing ORB-type GRAND algorithms and lies within 0.10.10.1~dB of a maximum-likelihood decoding lower-bound benchmark at a BLER of 10−610^{-6}10−6.
Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can accurately decode any moderate redundancy block-code. It is designed with efficient circuit implementation in mind, and determines accurate decodings while retaining the original hard detection GRAND algorithm's suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide excellent soft decision block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with modest complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder. ORBGRAND offers the possibility of an accurate, energy efficient soft detection decoder suitable for delivering URLLC in a single hardware realization.
Recently, the field of quantum error-correcting codes has rapidly emerged as an important discipline. As quantum information is extremely sensitive to noise, it seems unlikely that any large scale quantum computation is feasible without quantum error-correction. In this paper we give a brief exposition of the theory of quantum stabilizer codes. We review the stabilizer formalism of quantum codes, establish the connection between classical codes and stabilizer codes and the main methods for constructing quantum codes from classical codes. In addition to the expository part, we include new results that cannot be found elsewhere. Specifically, after reviewing some important bounds for quantum codes, we prove the nonexistence of pure perfect quantum stabilizer codes with minimum distance greater than 3. Finally, we illustrate the general methods of constructing quantum codes from classical codes by explicitly constructing two new families of quantum codes and conclude by showing how to construct new quantum codes by shortening.