Fetching the paper…
Reading the bibliography…
We improve the number of T gates needed to perform an n-bit adder from 8n + O(1) to 4n + O(1).
A regular layout for parallel adders
Richard P Brent and H-T_ Kung · 1982
Earlier work this paper cites.
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter · 1995
Earlier work this paper cites.
Quantum codes on a lattice with boundary
S. B. Bravyi and A. Yu. Kitaev · 1998
Earlier work this paper cites.
Topological quantum memory
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill · 2002
Earlier work this paper cites.
Classical and quantum computation
Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi · 2002
Earlier work this paper cites.
A new quantum ripple-carry addition circuit, 2004
Steven A. Cuccaro, Thomas G. Draper, Samuel A. Kutin, and David Petrie Moulton · 2004
Earlier work this paper cites.
A logarithmic-depth quantum carry-lookahead adder
Thomas G. Draper, Samuel A. Kutin, Eric M. Rains, and Krysta M. Svore · 2004
Earlier work this paper cites.
Fault-tolerant quantum computation with high threshold in two dimensions
R. Raussendorf and J. Harrington · 2007
Earlier work this paper cites.
Topological fault-tolerance in cluster state quantum computation
Robert Raussendorf, Jim Harrington, and Kovid Goyal · 2007
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2009
Cited alongside, same era.
Scalable architecture for quantum information processing with atoms in optical micro-structures
Malte Schlosser, Sascha Tichelmann, Jens Kruse, and Gerhard Birkl · 2011
Cited alongside, same era.
Surface codes: Towards practical large-scale quantum computation
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland · 2012
Cited alongside, same era.
Surface code quantum computing by lattice surgery
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter · 2012
Cited alongside, same era.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
M. Amy, D. Maslov, M. Mosca, and M. Roetteler · 2013
Private correspondence, Aug 2017
Austin Fowler, Dmitri Maslov, Cody Jones, and Matt Amy · 2017
Closest in time.
Building logical qubits in a superconducting quantum computing system
J. M. Gambetta, J. M. Chow, and M. Steffen · 2017
Closest in time.
Application of a resource theory for magic states to fault-tolerant quantum computing
Mark Howard and Earl Campbell · 2017
Closest in time.
A short introduction to topological quantum computation
V. Lahtinen and J. K. Pachos · 2017
Closest in time.
Blueprint for a microwave trapped-ion quantum computer
B. Lekitsch, S. Weidt, A. G. Fowler, K. Mølmer, S. J. Devitt, C. Wunderlich, and W. K. Hensinger · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Low-overhead constructions for the fault-tolerant toffoli gate
Cody Jones · 2013
Cited alongside, same era.
Superconducting quantum circuits at the surface code threshold for fault tolerance
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and John M. Martinis · 2014
Cited alongside, same era.
Edgard Muñoz-Coreas and Himanshu Thapliyal · 2017
Closest in time.
Encoding electronic spectra in quantum circuits with linear T complexity
Ryan Babbush, Craig Gidney, Dominic W Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven · 2018
Closest in time.