Single-shot decoding of good quantum LDPC codes
From MaRDI portal
(Redirected from Single-shot decoding of good quantum LDPC codes)
Abstract: Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one measurement round (consisting of constant-weight parity checks) suffices to perform reliable QEC even in the presence of measurement errors. We establish this result for both the sequential and parallel decoding algorithms introduced by Leverrier and Z'emor. Furthermore, we show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round. Combined with good code parameters, the resulting constant-time overhead of QEC and robustness to (possibly time-correlated) adversarial noise make quantum Tanner codes alluring from the perspective of quantum fault-tolerant protocols.
Recommendations
Cites work
- Asymptotically good Quantum and locally testable classical LDPC codes
- Balanced Product Quantum Codes
- Beyond Single-Shot Fault-Tolerant Quantum Error Correction
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
- Efficient decoding of random errors for quantum expander codes
- Error Correcting Codes in Quantum Theory
- Fault-tolerant quantum computation by anyons
- Fiber bundle codes: breaking the n 1/2 polylog( n ) barrier for Quantum LDPC codes
- Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
- High dimensional expanders and property testing
- scientific article; zbMATH DE number 5788515 (Why is no real title available?)
- Locally testable codes with constant rate, distance, and locality
- Multiple-particle interference and quantum error correction
- Quantum codes from high-dimensional manifolds
- Quantum LDPC Codes With Almost Linear Minimum Distance
- Quantum locally testable codes
- Robust locally testable codes and products of codes
- Topological quantum memory
This page was built for publication: Single-shot decoding of good quantum LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6121809)
