Fetching the paper…
Reading the bibliography…
Performing large calculations with a quantum computer will likely require a fault-tolerant architecture based on quantum error-correcting codes.
1901
Earlier work this paper cites.
1904
Earlier work this paper cites.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1910
Earlier work this paper cites.
Jack Edmonds, “Paths, trees and flowers,” Canadian Journal of Mathematics 17
1965
Earlier work this paper cites.
Charles H. Bennett, “Efficient estimation of free energy differences from Monte Carlo data,” Journal of Computational Physics 22
1976
Earlier work this paper cites.
P. W. Shor, “Fault-tolerant quantum computation,” in Proceedings of the 37th Annual Symposium on Foundations of Computer Science , FOCS ’96 (IEEE Computer Society, USA, 1996) p. 56, arXiv:quant-ph/9605011 [quant-ph]
1996
Earlier work this paper cites.
E. Knill, R. Laflamme, and W. Zurek, “Threshold accuracy for quantum computation,” (1996), arXiv:quant-ph/9610011 [quant-ph]
1996
Earlier work this paper cites.
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, and William K. Wootters, “Mixed-state entanglement and quantum error correction,” Physical Review A 54
1996
Earlier work this paper cites.
Peter W. Shor and John A. Smolin, “Quantum error-correcting codes need not completely reveal the error syndrome,” (1996), arXiv:quant-ph/9604006 [quant-ph]
1996
Earlier work this paper cites.
A. R. Calderbank and Peter W. Shor, “Good quantum error-correcting codes exist,” Physical Review A 54
1996
Earlier work this paper cites.
Andrew Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452
1996
Earlier work this paper cites.
Dorit Aharonov and Michael Ben-Or, “Fault-tolerant quantum computation with constant error,” in STOC ’97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (1997) p. 176, arXiv:quant-ph/9611025 [quant-ph]
1997
Earlier work this paper cites.
A. Yu. Kitaev, “Quantum computations: algorithms and error correction,” Russian Math. Surveys 52
1997
Earlier work this paper cites.
S. B. Bravyi and A. Yu. Kitaev, “Quantum codes on a lattice with boundary,” (1998), arXiv:quant-ph/9811052 [quant-ph]
1998
Earlier work this paper cites.
David P. DiVincenzo, Peter W. Shor, and John A. Smolin, “Quantum-channel capacity of very noisy channels,” Physical Review A 57
1998
Earlier work this paper cites.
2001
Earlier work this paper cites.
Eric Jones, Travis Oliphant, Pearu Peterson, et al. , “SciPy: Open source scientific tools for Python,” (2001–), https://www.scipy.org/
2001
Earlier work this paper cites.
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill, “Topological quantum memory,” Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
A.Yu. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics 303
2003
Earlier work this paper cites.
Xiao-Gang Wen, “Quantum orders in an exact soluble model,” Physical Review Letters 90
2003
Earlier work this paper cites.
Chenyang Wang, Jim Harrington, and John Preskill, “Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory,” Annals of Physics 303
2003
Cited alongside, same era.
Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Physical Review A 71
2005
Cited alongside, same era.
R. Raussendorf, J. Harrington, and K. Goyal, “A fault-tolerant one-way quantum computer,” Annals of Physics 321
2006
Cited alongside, same era.
Graeme Smith and John A. Smolin, “Degenerate quantum codes for Pauli channels,” Physical Review Letters 98
2007
Cited alongside, same era.
Robert Raussendorf and Jim Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Physical Review Letters 98
2007
Cited alongside, same era.
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
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…
R Raussendorf, J Harrington, and K Goyal, “Topological fault-tolerance in cluster state quantum computation,” New Journal of Physics 9
2007
Cited alongside, same era.
2008
Cited alongside, same era.
2008
Cited alongside, same era.
Z. Nussinov and G. Ortiz, “A symmetry principle for topological quantum order,” Ann. Phys. 324
2009
Cited alongside, same era.
2009
Cited alongside, same era.
Vladimir Kolmogorov, “Blossom V: A new implementation of a minimum cost perfect matching algorithm,” Mathematical Programming Computation 1
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
Mark M. Wilde, Quantum Information Theory , 2nd ed. (Cambridge University Press, 2017)
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Theodore J. Yoder and Isaac H. Kim, “The surface code with a twist,” Quantum 1
2017
Later among the works it cites.
Fredrik Johansson et al. , mpmath: a Python library for arbitrary-precision floating-point arithmetic (version 1.0) (2017), http://mpmath.org/
2017
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Christophe Vuillot, Lingling Lao, Ben Criger, Carmen García Almudéver, Koen Bertels, and Barbara M. Terhal, “Code deformation and lattice surgery are gauge fixing,” New J. Phys. 21
2019
Later among the works it cites.
2019
Later among the works it cites.
Naomi H. Nickerson and Benjamin J. Brown, “Analysing correlated noise in the surface code using adaptive decoding algorithms,” Quantum 3
2019
Later among the works it cites.
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier, “Constant overhead quantum fault tolerance with quantum expander codes,” Commun. ACM 64
2020
Closest in time.
Anirudh Krishna and David Poulin, “Topological wormholes: Nonlocal defects on the toric code,” Physical Review Research 2
2020
Closest in time.
David K. Tuckett, Tailoring surface codes: Improvements in quantum error correction with biased noise , Ph.D. thesis , University of Sydney (2020)
2020
Closest in time.
Charles R. Harris, K. Jarrod Millman, Stéfan J. van der Walt, Ralf Gommers, Pauli Virtanen, David Cournapeau, Eric Wieser, Julian Taylor, Sebastian Berg, Nathaniel J. Smith, Robert Kern, Matti Picus, Stephan Hoyer, Marten H. van Kerkwijk, Matthew Brett, Allan Haldane, Jaime Fernández del Río, Mark Wiebe, Pearu Peterson, Pierre Gérard-Marchant, Kevin Sheppard, Tyler Reddy, Warren Weckesser, Hameer Abbasi, Christoph Gohlke, and Travis E. Oliphant, “Array programming with NumPy,” Nature 585
2020
Closest in time.
Anirudh Krishna and David Poulin, “Fault-tolerant gates on hypergraph product codes,” Phys. Rev. X 11
2021
Closest in time.
David K. Tuckett, “qecsim: Quantum error correction simulator,” (2021), https://qecsim.github.io/
2021
Closest in time.