Good quantum LDPC codes with linear time decoders

Cites Work

Unnamed Item
Unnamed Item
Isoperimetric inequalities for Ramanujan complexes and topological expanders
Ramanujan complexes and high dimensional expanders
Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
Homological connectivity of random 2-complexes
Explicit construction of linear sized tolerant networks
Ramanujan graphs
Fault-tolerant quantum computation by anyons
High order random walks: beyond spectral gap
Kitaev's Z_d-Codes Threshold Estimates
Expander codes
Quantum Locally Testable Codes
Expander graphs and their applications
Robust Local Testability of Tensor Products of LDPC Codes
A recursive approach to low complexity codes
Topological quantum memory
Short Locally Testable Codes and Proofs: A Survey in Two Parts
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
Quantum LDPC Codes With Almost Linear Minimum Distance
Balanced Product Quantum Codes
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
Improved analysis of higher order random walks and applications
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
Bounded degree cosystolic expanders of every dimension
Fiber bundle codes: breaking the n ^1/2 polylog( n ) barrier for Quantum LDPC codes
Near-linear time decoding of Ta-Shma’s codes via splittable regularity

This page was built for publication: Good quantum LDPC codes with linear time decoders