Fetching the paper…
Reading the bibliography…
We prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits required for a quantum computation with faulty hardware and the number of logical qubits involved in the ideal computation is asymptotically constant, and can even be taken arbitrarily close to 1 in the limit of small physical error rate.
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.
Reliable computation with noisy circuits and decision trees-a general n log n lower bound
Rüdiger Reischuk and Bernd Schmeltz · 1991
Earlier work this paper cites.
Lower bounds for the complexity of reliable boolean circuits with noisy gates
Péter Gács and Anna Gál · 1994
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.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Z2-systolic freedom and quantum codes
Michael H Freedman, David A Meyer, and Feng Luo · 2002
Cited alongside, same era.
Fault-tolerant quantum computation with constant error rate
Dorit Aharonov and Michael Ben-Or · 2008
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.
An introduction to quantum error correction and fault-tolerant quantum computation
Daniel Gottesman · 2009
Cited alongside, same era.
Tradeoffs for reliable quantum information storage in surface codes and color codes
Nicolas Delfosse · 2013
Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
Larry Guth and Alexander Lubotzky · 2014
Later among the works it cites.
Decoding in hyperbolic spaces: quantum LDPC codes with linear rate and efficient error correction
Matthew B Hastings · 2014
Later among the works it cites.
Jean-Pierre Tillich and Gilles Zémor · 2014
Later among the works it cites.
Single-shot fault-tolerant quantum error correction
Héctor Bombín · 2015
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.
Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fault tolerance of quantum low-density parity check codes with sublinear distance scaling
Alexey A Kovalev and Leonid P Pryadko · 2013
Cited alongside, same era.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2014
Cited alongside, same era.
Vivien Londe and Anthony Leverrier · 2017
Later among the works it cites.
A theory of single-shot error correction for adversarial noise
Earl T Campbell · 2018
Closest in time.
Efficient decoding of random errors for quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Closest in time.