Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
Publication:5087011
DOI10.1137/20M1383689zbMath1498.81063arXiv2004.07935OpenAlexW4282924009MaRDI QIDQ5087011
Shai Evra, Gilles Zémor, Tali Kaufman
Publication date: 8 July 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.07935
Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Special quantum systems, such as solvable systems (81Q80) Quantum coding (general) (81P70) Synchronization error-correcting codes (94B50) Computational stability and error-correcting codes for quantum computation and communication processing (81P73) Expander graphs (05C48) Quantum discord (81P43)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isoperimetric inequalities for Ramanujan complexes and topological expanders
- Ramanujan complexes and high dimensional expanders
- Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\).
- Ramanujan complexes of type \(\widetilde A_d\)
- Local spectral expansion approach to high dimensional expanders. I: Descent of spectral gaps
- Fault-tolerant quantum computation by anyons
- On tensor products of CSS codes
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- Multiple-particle interference and quantum error correction
- Expander codes
- Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Buildings
- Expander graphs and their applications
- On the complexity of some coding problems (Corresp.)
- Quantum Codes from High-Dimensional Manifolds
- HIGH DIMENSIONAL EXPANDERS
- Homological product codes
- A Moore bound for simplicial complexes
- On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
- Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
- A Construction of Quantum LDPC Codes From Cayley Graphs
- Bounded degree cosystolic expanders of every dimension
This page was built for publication: Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
