Fetching the paper…
Reading the bibliography…
We adapt a construction of Guth and Lubotzky [arXiv:1310.5555] to obtain a family of quantum LDPC codes with non-vanishing rate and minimum distance scaling like $n^{0.1}$ where $n$ is the number of physical qubits.
Regular honeycombs in hyperbolic space
Harold Stephen Macdonald Coxeter · 1954
Earlier work this paper cites.
Number fields
Daniel A Marcus · 1977
Earlier work this paper cites.
Scheme for reducing decoherence in quantum computer memory
Peter W Shor · 1995
Earlier work this paper cites.
Good quantum error-correcting codes exist
A Robert Calderbank and Peter W Shor · 1996
Earlier work this paper cites.
A simple intrinsic proof of the gauss-bonnet formula for closed riemannin manifolds
Shiing-shen Chern · 1996
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Z2-systolic freedom and quantum codes
Michael H Freedman, David A Meyer, and Feng Luo · 2002
Earlier work this paper cites.
Abstract regular polytopes
Peter McMullen and Egon Schulte · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A Yu Kitaev · 2003
Earlier work this paper cites.
Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes
James William Harrington · 2004
Earlier work this paper cites.
Foundations of hyperbolic manifolds
John Ratcliffe · 2006
Cited alongside, same era.
Homological error correction: Classical and quantum codes
Hector Bombin and Miguel A Martin-Delgado · 2007
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.
The finite simple groups
Robert Wilson · 2009
Cited alongside, same era.
Tradeoffs for reliable quantum information storage in 2d systems
Sergey Bravyi, David Poulin, and Barbara Terhal · 2010
Cited alongside, same era.
https://mathcs.clarku.edu/ djoyce/poincare/poincare.html · 2010
Cited alongside, same era.
Constructions and noise threshold of hyperbolic surface codes
Nikolas P Breuckmann and Barbara M Terhal · 2016
Later among the works it cites.
Quantum codes from high-dimensional manifolds
MB Hastings · 2016
Later among the works it cites.
Local decoders for the 2d and 4d toric code
Nikolas P Breuckmann, Kasper Duivenvoorden, Dominik Michels, and Barbara M Terhal · 2016
Later among the works it cites.
Systole of congruence coverings of arithmetic hyperbolic manifolds
Plinio GP Murillo · 2016
Later among the works it cites.
Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel
Nicolas Delfosse and Gilles Zémor · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tradeoffs for reliable quantum information storage in surface codes and color codes
Nicolas Delfosse · 2013
Cited alongside, same era.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2013
Cited alongside, same era.
Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
Larry Guth and Alexander Lubotzky · 2014
Cited alongside, same era.
Bruno Martelli · 2015
Cited alongside, same era.
Closest in time.
Almost-linear time decoding algorithm for topological codes
Nicolas Delfosse and Naomi H Nickerson · 2017
Closest in time.
On Arithmetic Manifolds with Large Systole
Plinio GP Murillo · 2017
Closest in time.
Hyperbolic and semi-hyperbolic surface codes for quantum storage
Nikolas P Breuckmann, Christophe Vuillot, Earl Campbell, Anirudh Krishna, and Barbara M Terhal · 2017
Closest in time.
Constant overhead quantum fault-tolerance with quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Closest in time.
Efficient decoding of random errors for quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Closest in time.