Good quantum LDPC codes with linear time decoders
From MaRDI portal
(Redirected from Publication:6499274)
Cites work
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- A recursive approach to low complexity codes
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Balanced Product Quantum Codes
- Boolean function analysis on high-dimensional expanders
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
- Expander codes
- Expander graphs and their applications
- Explicit construction of linear sized tolerant networks
- Fault-tolerant quantum computation by anyons
- Fiber bundle codes: breaking the n 1/2 polylog( n ) barrier for Quantum LDPC codes
- High order random walks: beyond spectral gap
- Homological connectivity of random 2-complexes
- Improved analysis of higher order random walks and applications
- Isoperimetric inequalities for Ramanujan complexes and topological expanders
- Kitaev's Z_d-codes threshold estimates
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Near-linear time decoding of Ta-Shma’s codes via splittable regularity
- Quantum LDPC Codes With Almost Linear Minimum Distance
- Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
- Quantum locally testable codes
- Ramanujan complexes and high dimensional expanders
- Ramanujan graphs
- Robust Local Testability of Tensor Products of LDPC Codes
- Short locally testable codes and proofs: a survey in two parts
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Topological quantum memory
Cited in
(6)- Error-correcting codes for fermionic quantum simulation
- Hierarchical quantum error correction with hypergraph product code and rotated surface code
- Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
- Pseudorandom linear codes are list-decodable to capacity
- NLTS Hamiltonians and strongly-explicit SoS lower bounds from low-rate quantum LDPC codes
- When can an expander code correct (n) errors in O(n) time?
This page was built for publication: Good quantum LDPC codes with linear time decoders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499274)
