Quantum Error Correction via Noise Guessing Decoding
arXiv:2208.02744 · doi:10.1109/ACCESS.2023.3327214
Abstract
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 that 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.
References in corpus (33)
- Good Quantum Error-Correcting Codes Exist
- Improved Simulation of Stabilizer Circuits
- Quantum Error Correction for Quantum Memories
- Multiple Particle Interference and Quantum Error Correction
- Suppressing quantum errors by scaling a surface code logical qubit
- Quantum Error Correction for Beginners
- Stabilizer Codes and Quantum Error Correction
- Quantum teleportation and entanglement distribution over 100-kilometre free-space channels
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- High threshold universal quantum computation on the surface code
- Fidelity benchmarks for two-qubit gates in silicon
- Quantum Error Correction: An Introductory Guide
- Quantum Low-Density Parity-Check Codes
- High-rate, high-fidelity entanglement of qubits across an elementary quantum network
- A Link Layer Protocol for Quantum Networks
- Capacity-achieving Guessing Random Additive Noise Decoding (GRAND)
- Quantum Internet: from Communication to Distributed Computing!
- Ordered Reliability Bits Guessing Random Additive Noise Decoding
- Fault-tolerant quantum computing with color codes
- Approximate Degradable Quantum Channels
- Distributing Multipartite Entanglement over Noisy Quantum Networks
- Quantum Technologies in the Telecommunications Industry
- Quantum coding with low-depth random circuits
- Quantum Computing: Towards Industry Reference Problems
- CRC Codes as Error Correction Codes
- Useful states and entanglement distillation
- Robustness of Noisy Quantum Networks
- Quantum Error Correction with Quantum Autoencoders
- Short random circuits define good quantum error correcting codes
- Short Codes for Quantum Channels with One Prevalent Pauli Error Type
- Symbol-Level GRAND for High-Order Modulation over Flat Fading Channels
- Finite-rate sparse quantum codes aplenty