Single-shot decoding of good quantum LDPC codes
From MaRDI portal
Publication:6121809
DOI10.1007/s00220-024-04951-6arXiv2306.12470OpenAlexW4392795040MaRDI QIDQ6121809
Shin Ho Choe, Shouzhen Gu, Zhiyang He, Eugene Tang, Libor Caha, Aleksander Kubica
Publication date: 26 March 2024
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.12470
Theory of error-correcting codes and error-detecting codes (94Bxx) Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Cites Work
- Unnamed Item
- Fault-tolerant quantum computation by anyons
- High dimensional expanders and property testing
- Multiple-particle interference and quantum error correction
- Quantum Locally Testable Codes
- Error Correcting Codes in Quantum Theory
- Quantum Codes from High-Dimensional Manifolds
- Topological quantum memory
- Quantum LDPC Codes With Almost Linear Minimum Distance
- Beyond Single-Shot Fault-Tolerant Quantum Error Correction
- Balanced Product Quantum Codes
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
- Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
- Efficient decoding of random errors for quantum expander codes
- Robust locally testable codes and products of codes
- Fiber bundle codes: breaking the n 1/2 polylog( n ) barrier for Quantum LDPC codes
- Locally testable codes with constant rate, distance, and locality
- Asymptotically good Quantum and locally testable classical LDPC codes
This page was built for publication: Single-shot decoding of good quantum LDPC codes
