Fetching the paper…
Reading the bibliography…
Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing.
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.
Approximate quantum fourier transform and decoherence
Adriano Barenco, Artur Ekert, Kalle-Antti Suominen, and Päivi Törmä · 1996
Earlier work this paper cites.
Purification of noisy entanglement and faithful teleportation via noisy channels
Charles H. Bennett, Gilles Brassard, Sandu Popescu, Benjamin Schumacher, John A. Smolin, and William K. Wootters · 1996
Earlier work this paper cites.
Quantum privacy amplification and the security of quantum cryptography over noisy channels
David Deutsch, Artur Ekert, Richard Jozsa, Chiara Macchiavello, Sandu Popescu, and Anna Sanpera · 1996
Earlier work this paper cites.
Reliable quantum computers
John Preskill · 1998
Earlier work this paper cites.
Quantum algorithms revisited
R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca · 1998
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Classical and Quantum Computation
Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi · 2002
Earlier work this paper cites.
A new quantum ripple-carry addition circuit
Steven A. Cuccaro, Thomas G. Draper, Samuel A. Kutin, and David Petrie Moulton · 2004
Earlier work this paper cites.
Scalability of shor’s algorithm with a limited set of rotation gates
Austin G. Fowler and Lloyd C. L. Hollenberg · 2004
Earlier work this paper cites.
Universal quantum computation with ideal clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
Fast quantum modular exponentiation
Rodney Van Meter and Kohei M. Itoh · 2005
Earlier work this paper cites.
The Solovay-Kitaev Algorithm
Christopher M. Dawson and Michael A. Nielsen · 2006
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 · 2006
Cited alongside, same era.
Running a quantum circuit at the speed of data
N. Isailovic, M. Whitney, Y. Patel, and J. Kubiatowicz · 2008
Cited alongside, same era.
Restrictions on transversal encoded quantum gate sets
Bryan Eastin and Emanuel Knill · 2009
Cited alongside, same era.
High-threshold universal quantum computation on the surface code
Austin G. Fowler, Ashley M. Stephens, and Peter Groszkowski · 2009
Cited alongside, same era.
Resource requirements for fault-tolerant quantum simulation: The ground state of the transverse Ising model
Craig R. Clark, Tzvetan S. Metodi, Samuel D. Gasster, and Kenneth R. Brown · 2009
Cited alongside, same era.
Transversality versus universality for additive quantum codes
Bei Zeng, A. Cross, and I.L. Chuang · 2011
Quantum circuits of T-depth one
Peter Selinger · 2012
Later among the works it cites.
Magic-state distillation with low overhead
Sergey Bravyi and Jeongwan Haah · 2012
Later among the works it cites.
Multilevel distillation of magic states for quantum computing
Cody Jones · 2012
Later among the works it cites.
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2012
Later among the works it cites.
Andrew J. Landahl and Chris Cesare · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Layered Architecture for Quantum Computing
N. Cody Jones, Rodney Van Meter, Austin G. Fowler, Peter L. McMahon, Jungsang Kim, Thaddeus D. Ladd, and Yoshihisa Yamamoto · 2012
Cited alongside, same era.
A bridge to lower overhead quantum computation
Austin G. Fowler and Simon J. Devitt · 2012
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.
Faster quantum chemistry simulation on fault-tolerant quantum computers
N Cody Jones, James D Whitfield, Peter L McMahon, Man-Hong Yung, Rodney Van Meter, Alán Aspuru-Guzik, and Yoshihisa Yamamoto · 2012
Cited alongside, same era.
Magic-state distillation with the four-qubit code
Adam M. Meier, Bryan Eastin, and Emanuel Knill · 2012
Cited alongside, same era.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler · 2012
Cited alongside, same era.
Later among the works it cites.
Distilling one-qubit magic states into Toffoli states
Bryan Eastin · 2012
Later among the works it cites.
A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
Guillaume Duclos-Cianci and Krysta M. Svore · 2012
Later among the works it cites.
Surface code implementation of block code state distillation
Austin G. Fowler, Simon J. Devitt, and Cody Jones · 2013
Closest in time.
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
Matthew Amy, Dmitri Maslov, and Michele Mosca · 2013
Closest in time.
Low-overhead constructions for the fault-tolerant Toffoli gate
Cody Jones · 2013
Closest in time.
Quantum algorithm to calculate electromagnetic scattering cross sections
B. D. Clader, B. C. Jacobs, and C. R. Sprouse · 2013
Closest in time.
Efficient Decomposition of Single-Qubit Gates into V V Basis Circuits
Alex Bocharov, Yuri Gurevich, and Krysta M. Svore · 2013
Closest in time.