Comparing the Overhead of Topological and Concatenated Quantum Error Correction

P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput

1997

Earlier work this paper cites.

A. M. Steane, “Efficient fault-tolerant quantum computing,” Nature

1999

Earlier work this paper cites.

Cambridge University Press, 2000

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2000

Earlier work this paper cites.

E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” J. Math. Phys

2002

Earlier work this paper cites.

M. D. Barrett, T. Schaetz, J. Chiaverini, D. Leibfried, J. Britton, W. M. Itano, J. D. Jost, E. Knill, C. Langer, R. Ozeri, and D. Wineland, “Quantum information processing with trapped ions,” in Proceedings of ICAP

2004

Earlier work this paper cites.

S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Phys. Rev. A

2005

Earlier work this paper cites.

P. Aliferis, D. Gottesman, and J. Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” Quanum Info. Comput

2006

Earlier work this paper cites.

K. M. Svore, D. P. Divincenzo, and B. M. Terhal, “Noise threshold for a fault-tolerant two-dimensional lattice architecture,” Quantum Info. Comput

2007

Earlier work this paper cites.

A. Blais, J. Gambetta, A. Wallraff, D. I. Schuster, S. M. Girvin, M. H. Devoret, and R. J. Schoelkopf, “Quantum-information processing with circuit quantum electrodynamics,” Phys. Rev. A

2007

Earlier work this paper cites.

P. Aliferis and A. W. Cross, “Subsystem Fault Tolerance with the Bacon-Shor Code,” Phys. Rev. Lett

2007

Earlier work this paper cites.

R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault-tolerance in cluster state quantum computation,” New J. Phys

Original

2007

Earlier work this paper cites.

F. M. Spedalieri and V. P. Roychowdhury, “Latency in local, two-dimensional, fault-tolerant quantum computing,” Quanum Info. Comput

2009

Cited alongside, same era.

A. Fowler, A. Stephens, and P. Groszkowski, “High threshold universal quantum computation on the surface code,” Phys. Rev. A

2009

Cited alongside, same era.

J. Martinis, “Quantum-information processing with circuit quantum electrodynamics,” Quant. Inf. Proc

2009

Cited alongside, same era.

M. Saffman, T. G. Walker, and K. Mølmer, “Quantum information with rydberg atoms,” Rev. Mod. Phys

2010

Cited alongside, same era.

A. Bocharov and K. M. Svore, “Resource-optimal single-qubit quantum circuits,” Phys. Rev. Lett

2012

Cited alongside, same era.

O. Theogarajan, A. Faruque, G. Long, and F. Chong, “Preliminary Implementation of the Shortest Vector Problem Algorithm,” IARPA QCS Project report

2012

Later among the works it cites.

J. Black, “Preliminary Resource Estimates for Hallgren’s Quantum Class Number Algorithm,” IARPA QCS Project report

2012

Later among the works it cites.

C.-F. Chiang, “Analysis of an Implementation of a Quantum Algorithm for the Triangle Finding Problem,” IARPA QCS Project report

2012

Later among the works it cites.

M. Suchara, A. Faruque, C.-Y. Lai, G. Paz, F. Chong, and J. Kubiatowicz, “QuRE: The Quantum Resource Estimation Toolbox,” UC Berkeley Technical Report

2013

Closest in time.

M. Suchara, A. Faruque, C.-Y. Lai, G. Paz, F. Chong, and J. Kubiatowicz, “QuRE: The Quantum Resource Estimator Toolbox,” in Proceedings of ICCD

2013

Closest in time.