Novel constructions for the fault-tolerant Toffoli gate

Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter, “Elementary gates for quantum computation,” Phys. Rev. A 52

1995

Earlier work this paper cites.

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

1997

Earlier work this paper cites.

John Preskill, “Reliable quantum computers,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454

1998

Earlier work this paper cites.

Daniel Gottesman and Isaac L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature 402

1999

Earlier work this paper cites.

Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information , 1st ed. (Cambridge University Press, 2000)

2000

Earlier work this paper cites.

Xinlan Zhou, Debbie W. Leung, and Isaac L. Chuang, “Methodology for quantum logic gate construction,” Phys. Rev. A 62

2000

Earlier work this paper cites.

Rodney Van Meter and Kohei M. Itoh, “Fast quantum modular exponentiation,” Phys. Rev. A 71

2005

Earlier work this paper cites.

Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,” Phys. Rev. A 71

2005

Cited alongside, same era.

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.

N. Isailovic, M. Whitney, Y. Patel, and J. Kubiatowicz, “Running a quantum circuit at the speed of data,” in 35th International Symposium on Computer Architecture, 2008 (ISCA’08) (2008)

2008

Cited alongside, same era.

Craig R. Clark, Tzvetan S. Metodi, Samuel D. Gasster, and Kenneth R. Brown, “Resource requirements for fault-tolerant quantum simulation: The ground state of the transverse Ising model,” Phys. Rev. A 79

2009

Cited alongside, same era.

Austin G. Fowler, Ashley M. Stephens, and Peter Groszkowski, “High-threshold universal quantum computation on the surface code,” Phys. Rev. A 80

Sergey Bravyi and Jeongwan Haah, “Magic state distillation with low overhead,” (2012), Preprint arXiv:1209.2426v1

Original

2012

Closest in time.

Cody Jones, “Multilevel distillation of magic states for quantum computing,” (2012), Preprint arXiv:1210.3388v1

Original

2012

Closest in time.

Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler, “A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits,” (2012), Preprint arXiv:1206.0758v2

Original

2012

Closest in time.

Peter Selinger, “Quantum circuits of T-depth one,” (2012), Preprint arXiv:1210.0974v1

Original

2012

Closest in time.

Bryan Eastin, “Distilling one-qubit magic states into Toffoli states,” (2012), private communication