Good quantum LDPC codes with linear time decoders

Cites Work

Title not available (Why is that?)
Fault-tolerant quantum computation by anyons
Isoperimetric inequalities for Ramanujan complexes and topological expanders
Expander codes
Expander graphs and their applications
Robust Local Testability of Tensor Products of LDPC Codes
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
Ramanujan graphs
Explicit construction of linear sized tolerant networks
Topological quantum memory
A recursive approach to low complexity codes
Spectral independence in high-dimensional expanders and applications to the hardcore model
Kitaev's $\mathbb Z_d$-codes threshold estimates
Short locally testable codes and proofs: a survey in two parts
Balanced Product Quantum Codes
High order random walks: beyond spectral gap
Boolean function analysis on high-dimensional expanders
Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
Quantum LDPC Codes With Almost Linear Minimum Distance
Fiber bundle codes: breaking the n ^1/2 polylog( n ) barrier for Quantum LDPC codes
Improved analysis of higher order random walks and applications
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Quantum locally testable codes
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
Near-linear time decoding of Ta-Shma’s codes via splittable regularity

Cited In (1)

Error-correcting codes for fermionic quantum simulation

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)