Fetching the paper…
Reading the bibliography…
What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant.
Robert G. Gallager, “Low density parity check codes,” Sc.D. thesis, MIT (1960)
1960
Earlier work this paper cites.
Jack Edmonds, “Maximum Matching and a Polyhedron With 0 , 1 0,1 -Vertices,” J. Res. Nat. Bureau Stan. B 69
1965
Earlier work this paper cites.
R. Reischuk and B. Schmeltz, “Reliable computation with noisy circuits and decision trees — a general n log n n\log n lower bound,” Proc. 32nd Symp. on Foundations of Computing (FOCS ’91), IEEE Computer Society Press, 602–611 (1991)
1991
Earlier work this paper cites.
Peter Gács and Anna Gál, “Lower bounds for the complexity of reliable Boolean circuits with noisy gates,” IEEE Trans. Info. Theory 40
1994
Earlier work this paper cites.
M. Ben-Or, D. Gottesman, A. Hassidim, “Quantum refrigerator,” arXiv:1301.1995 [quant-ph]
1995
Earlier work this paper cites.
Peter W. Shor, “Fault-tolerant quantum computation,” Proc. 37th Symp. on Foundations of Computing (FOCS ’96), IEEE Computer Society Press, 56–65 (1996), arXiv:quant-ph/9605011
1996
Earlier work this paper cites.
M. Sipser, D. A. Spielman, “Expander Codes,” IEEE Trans. Info. Theory 42
1996
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, “Fault-Tolerant Quantum Computation With Constant Error,” Proc. 29th Annual IEEE Symp. on the Theory of Computer Science (STOC’97), ACM, 176-188 (1997)
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.
Andrew Steane, “Active stabilisation, quantum computation and quantum state synthesis,” Phys. Rev. Lett. 78
1997
Earlier work this paper cites.
D. Gottesman, “Theory of fault-tolerant quantum computation,” Phys. Rev. A 57
1998
Earlier work this paper cites.
E. Knill, R. Laflamme, W. H. Zurek, “Resilient quantum computation: error models and thresholds,” Proc. Roy. Soc. London, Ser. A 454
1998
Cited alongside, same era.
D. Gottesman and I. Chuang, “Demonstrating the Viability of Universal Quantum Computation Using Teleportation and Single-Qubit Operations,” Nature 402
1999
Cited alongside, same era.
Andrew M. Steane, “Efficient fault-tolerant quantum computing,” Nature 399
1999
Cited alongside, same era.
D. Gottesman, “Fault-Tolerant Quantum Computation with Local Gates,” J. Modern Optics 47
2000
Cited alongside, same era.
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill, “Topological quantum memory,” J. Math. Phys. 43
2002
Cited alongside, same era.
Andrei Romashchenko, “Reliable Computations Based on Locally Decodable Codes,” Proc. STACS 2006, Lecture Notes in Computer Science 3884
2006
Later among the works it cites.
Robert Raussendorf and Jim Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Phys. Rev. Lett. 98
2007
Later among the works it cites.
D. Aharonov and M. Ben-Or, “Fault-Tolerant Quantum Computation with Constant Error Rate,” SIAM J. Comput. 38
2008
Later among the works it cites.
P. Aliferis, D. Gottesman, J. Preskill, “Accuracy threshold for postselected quantum computation,” Quantum Information and Computation 8
2008
Later among the works it cites.
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael H. Freedman, David A. Meyer, and Feng Luo, “ ℤ 2 \mathbb{Z}_{2} -systolic freedom and quantum codes,” Ch. 12 of Mathematics of Quantum Computation
2002
Cited alongside, same era.
Cristopher Moore and Martin Nilsson, “Parallel Quantum Computation and Quantum Codes,” SIAM J. Computing 31
2002
Cited alongside, same era.
E. Knill, “Quantum computing with realistically noisy devices,” Nature 434
2005
Cited alongside, same era.
Andrew M. Steane and Ben Ibinson, “Fault-Tolerant Logical Gate Networks for CSS Codes,” Phys. Rev. A 72
2005
Cited alongside, same era.
B. M. Terhal and G. Burkard, “Fault-Tolerant Quantum Computation For Local Non-Markovian Noise,” Phys. Rev. A 71
2005
Cited alongside, same era.
P. Aliferis, D. Gottesman, and J. Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” Quant. Information and Computation 6
2006
Cited alongside, same era.
Cited in the paper.
2009
Later among the works it cites.
2010
Later among the works it cites.
2010
Later among the works it cites.
2012
Later among the works it cites.