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.
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.
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.
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.
Classical information technologies employ binary encodings in which data are represented as sequences of bits taking values of “0” or “1.” In this chapter, the authors describe how the procedure can be generalized to create [[n, k, d]] stabilizer codes, where n is the total number of qubits, k is the number of logical qubits, and d is the code distance. They outline a construction known as the surface code. We must also understand how to perform operations on a state encoded in a quantum code without losing the code's protection against errors, and how to safely perform error correction when the gates used are themselves noisy. A protocol that performs these tasks is called fault tolerant. The authors revisit the problems discussed by introducing a more rigorous mathematical framework in analogy with classical error correction theory.
Quantum error correction draws many of its principles and constructions from classical coding theory, adapted to the unique aspects of quantum mechanics. Here we extend this correspondence to a block of logical qubits, each prepared in the same quantum code, by coupling the block through a classical error correcting code: syndrome qubits then carry error information from several logical qubits at once, and collective inference recovers the errors. Algebraically, the construction defines subgroups of the product stabilizer group corresponding to duals of classical codes, and we prove that a lookup table decoder corrects every error pattern respecting the correction radii of the two constituent codes. For classical algebraic code families, the number of syndrome qubits serving L logical qubits scales as O(log2(L+1)) at the code-capacity level, though at the price of stabilizer weight growing with the block length. An entropy bound shows that check weights need not grow with L. Under a phenomenological noise model, the same lookup table identifies measurement errors by nearest-neighbor post-processing, and classical algebraic decoders locate exactly the logical qubits carrying errors even with noisy syndromes. More broadly, we argue that quantum error correction, reduced to its functional core, is source compression in the sense of Shannon, whose source and channel coding theorems bound the overhead rates of quantum post-selection tasks.
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.
CRC codes have long since been adopted in a vast range of applications. The established notion that they are suitable primarily for error detection can be set aside through use of the recently proposed Guessing Random Additive Noise Decoding (GRAND). Hard-detection (GRAND-SOS) and soft-detection (ORBGRAND) variants can decode any short, high-rate block code, making them suitable for error correction of CRC-coded data. When decoded with GRAND, short CRC codes have error correction capability that is at least as good as popular codes such as BCH codes, but with no restriction on either code length or rate.The state-of-the-art CA-Polar codes are concatenated CRC and Polar codes. For error correction, we find that the CRC is a better short code than either Polar or CA-Polar codes. Moreover, the standard CA-SCL decoder only uses the CRC for error detection and therefore suffers severe performance degradation in short, high rate settings when compared with the performance GRAND provides, which uses all of the CA-Polar bits for error correction.Using GRAND, existing systems can be upgraded from error detection to low-latency error correction without re-engineering the encoder, and additional applications of CRCs can be found in IoT, Ultra-Reliable Low Latency Communication (URLLC), and beyond. The universality of GRAND, its ready parallelized implementation in hardware, and the good performance of CRC as codes make their combination a viable solution for low-latency applications.