Fetching the paper…
Reading the bibliography…
We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Z\'emor can correct a constant fraction of random errors with very high probability.
Low-density parity-check codes
Robert Gallager · 1962
Earlier work this paper cites.
Maximum matching and a polyhedron with 0, 1-vertices
Jack Edmonds · 1965
Earlier work this paper cites.
Bootstrap percolation
Joan Adler · 1991
Earlier work this paper cites.
Random walks, capacity and percolation on trees
Russell Lyons · 1992
Earlier work this paper cites.
Good quantum error-correcting codes exist
A Robert Calderbank and Peter W Shor · 1996
Earlier work this paper cites.
Expander codes
Michael Sipser and Daniel A Spielman · 1996
Earlier work this paper cites.
Error correcting codes in quantum theory
Andrew M Steane · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
Dorit Aharonov and Michael Ben-Or · 1997
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
The number of connected components in graphs and its applications
Ryuhei Uehara et al · 1999
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Cited alongside, same era.
Z2-systolic freedom and quantum codes
Michael H Freedman, David A Meyer, and Feng Luo · 2002
Cited alongside, same era.
Fault-tolerant quantum computation by anyons
A Yu Kitaev · 2003
Cited alongside, same era.
Quantum codes on Hurwitz surfaces
Isaac Hyun Kim · 2007
Cited alongside, same era.
Modern coding theory
Tom Richardson and Ruediger Urbanke · 2008
Cited alongside, same era.
A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
Sergey Bravyi and Barbara Terhal · 2009
Cited alongside, same era.
On percolation in random graphs with given vertex degrees
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel
Nicolas Delfosse and Gilles Zémor · 2013
Later among the works it cites.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2013
Later among the works it cites.
Decoding in hyperbolic spaces: Ldpc codes with linear rate and efficient error correction
Matthew B Hastings · 2013
Later among the works it cites.
Fault tolerance of quantum low-density parity check codes with sublinear distance scaling
Alexey A Kovalev and Leonid P Pryadko · 2013
Later among the works it cites.
Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
Larry Guth and Alexander Lubotzky · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Svante Janson · 2009
Cited alongside, same era.
Threshold error rates for the toric and surface codes
David S Wang, Austin G Fowler, Ashley M Stephens, and Lloyd Christopher L Hollenberg · 2009
Cited alongside, same era.
On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
Gilles Zémor · 2009
Cited alongside, same era.
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane
Nicolas Delfosse and Gilles Zémor · 2010
Cited alongside, same era.
Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength
Jean-Pierre Tillich and Gilles Zémor · 2014
Later among the works it cites.
Quantum expander codes
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Later among the works it cites.
Combinatorial interpretation of raney numbers and tree enumerations
Chin Hee Pah and Mohamed Ridza Wahiddin · 2015
Later among the works it cites.
Almost-linear time decoding algorithm for topological codes
Nicolas Delfosse and Naomi H. Nickerson · 2017
Closest in time.
Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds
Vivien Londe and Anthony Leverrier · 2017
Closest in time.