Fetching the paper…
Reading the bibliography…
This work provides the first explicit and non-random family of $[[N,K,D]]$ LDPC quantum codes which encode $K \in \Theta(N^\frac{4}{5})$ logical qubits with distance $D \in \Omega(N^\frac{3}{5})$.
W. Magnus, Noneuclidean tesselations and their groups . Academic Press, 1974
1974
Earlier work this paper cites.
R. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory , vol. 27, no. 5, pp. 533–547, 1981
1981
Earlier work this paper cites.
A. Lubotzky, R. Phillips, and P. Sarnak, “Ramanujan graphs,” Combinatorica , vol. 8, no. 3, pp. 261–277, 1988
1988
Earlier work this paper cites.
N. Alon and F. R. Chung, “Explicit construction of linear sized tolerant networks,” Discrete Mathematics , vol. 72, no. 1-3, pp. 15–19, 1988
1988
Earlier work this paper cites.
U. Langer and G. Rosenberger, “Erzeugende endlicher projektiver linearer Gruppen,” Results in Mathematics , vol. 15, no. 1-2, pp. 119–148, 1989
1989
Earlier work this paper cites.
C. J. Moreno and O. Moreno, “Exponential sums and goppa codes. i,” Proceedings of the American Mathematical Society , vol. 111, no. 2, pp. 523–531, 1991
1991
Earlier work this paper cites.
J. H. van Lint, “Repeated-root cyclic codes,” IEEE Transactions on Information Theory , vol. 37, no. 2, pp. 343–345, 1991
1991
Earlier work this paper cites.
M. Sipser and D. A. Spielman, “Expander Codes,” IEEE Transactions on Information Theory , vol. 42, no. 6, pp. 1710–1722, 1996
1996
Earlier work this paper cites.
M. H. Freedman, D. A. Meyer, and F. Luo, “ ℤ 2 \mathbb{Z}_{2} -Systolic Freedom and Quantum Codes,” Mathematics of quantum computation, Chapman & Hall/CRC , pp. 287–320, 2002
2002
Earlier work this paper cites.
J. Friedman, “Relative expanders or weakly relatively ramanujan graphs,” Duke Mathematical Journal , vol. 118, no. 1, pp. 19–35, 2003
2003
Earlier work this paper cites.
G. Davidoff, P. Sarnak, and A. Valette, Elementary number theory, group theory and Ramanujan graphs . Cambridge University Press, 2003, vol. 55
2003
Earlier work this paper cites.
S. I. Gelfand and Y. I. Manin, Methods of Homological Algebra , ser. Springer Monographs in Mathematics. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. [Online]. Available: http://link.springer.com/10.1007/978-3-662-12492-5
2003
Earlier work this paper cites.
J. G. Ratcliffe, S. Axler, and K. Ribet, Foundations of Hyperbolic Manifolds . Springer, 2006, vol. 149
2006
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, “Homological error correction: Classical and quantum codes,” Journal of mathematical physics , vol. 48, no. 5, p. 052105, 2007
2007
Earlier work this paper cites.
S. Bravyi, B. M. Terhal, and B. Leemhuis, “Majorana fermion codes,” New Journal of Physics , vol. 12, no. 8, p. 083039, 2010
2010
Earlier work this paper cites.
T. Kaufman and A. Wigderson, “Symmetric ldpc codes and local testing,” in Property testing . Springer, 2010, pp. 312–319
2010
Cited alongside, same era.
T. Kaufman and A. Lubotzky, “Edge transitive ramanujan graphs and highly symmetric ldpc good codes,” 2011
2011
Cited alongside, same era.
I. M. James, General topology and homotopy theory . Springer Science & Business Media, 2012
2012
Cited alongside, same era.
J. Van Lint and G. Van der Geer, Introduction to coding theory and algebraic geometry . Birkhäuser, 2012, vol. 12
2012
Cited alongside, same era.
J.-P. Tillich and G. Zémor, “Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Transactions on Information Theory , vol. 60, no. 2, pp. 1193–1202, 2013
2013
Cited alongside, same era.
M. Dowling and S. Gao, “Fast decoding of expander codes,” IEEE Transactions on Information Theory , vol. 64, no. 2, pp. 972–978, 2017
2017
Later among the works it cites.
G. D. Forney, “Codes on graphs: Models for elementary algebraic topology and statistical physics,” IEEE Transactions on Information Theory , vol. 64, no. 12, pp. 7465–7487, 2018
2018
Later among the works it cites.
R. Meshulam, “Graph codes and local systems,” arXiv preprint arXiv:1803.05643 , 2018
2018
Later among the works it cites.
O. Fawzi, A. Grospellier, and A. Leverrier, “Constant overhead quantum fault-tolerance with quantum expander codes,” in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) . IEEE, 2018, pp. 743–754
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
N. P. Breuckmann and B. M. Terhal, “Space-time circuit-to-hamiltonian construction and its applications,” Journal of Physics A: Mathematical and Theoretical , vol. 47, no. 19, p. 195304, 2014
2014
Cited alongside, same era.
M. Leslie, “Hypermap-homology quantum codes,” International Journal of Quantum Information , vol. 12, no. 01, p. 1430001, 2014
2014
Cited alongside, same era.
L. Guth and A. Lubotzky, “Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds,” Journal of Mathematical Physics , vol. 55, no. 8, p. 082202, 2014
2014
Cited alongside, same era.
B. M. Terhal, “Quantum error correction for quantum memories,” Reviews of Modern Physics , vol. 87, no. 2, p. 307, 2015
2015
Cited alongside, same era.
M. B. Hastings, “Weight reduction for quantum codes,” arXiv preprint arXiv:1611.03790 , 2016
2016
Cited alongside, same era.
N. P. Breuckmann and B. M. Terhal, “Constructions and noise threshold of hyperbolic surface codes,” IEEE transactions on Information Theory , vol. 62, no. 6, pp. 3731–3744, 2016
2016
Cited alongside, same era.
D. Bacon, S. T. Flammia, A. W. Harrow, and J. Shi, “Sparse quantum codes from quantum circuits,” IEEE Transactions on Information Theory , vol. 63, no. 4, pp. 2464–2479, 2017
2017
Cited alongside, same era.
T. C. Bohdanowicz, E. Crosson, C. Nirkhe, and H. Yuen, “Good approximate quantum LDPC codes from spacetime circuit hamiltonians,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , 2019, pp. 481–490
2019
Later among the works it cites.
2019
Later among the works it cites.
W. Zeng and L. P. Pryadko, “Higher-dimensional quantum hypergraph-product codes with finite rates,” Physical review letters , vol. 122, no. 23, p. 230501, 2019
2019
Later among the works it cites.
S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum ldpc codes beyond the n \sqrt{n} distance barrier using high dimensional expanders,” 2020
2020
Closest in time.
T. Kaufman and R. J. Tessler, “New cosystolic expanders from tensors imply explicit quantum ldpc codes with ω ( n log k n ) \omega(\sqrt{n}\log^{k}n) distance,” 2020
2020
Closest in time.
2020
Closest in time.
——, “Quantum ldpc codes with almost linear minimum distance,” 2020
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.