Fetching the paper…
Reading the bibliography…
We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers.
Simulating physics with computers
R. P. Feynman · 1982
Earlier work this paper cites.
The number field sieve
A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard · 1990
Earlier work this paper cites.
An approximate Fourier transform useful in quantum factoring, (1994), arXiv:quant-ph/0201067
D. Coppersmith · 1994
Earlier work this paper cites.
Elementary gates for quantum computation
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter · 1995
Earlier work this paper cites.
Universal quantum simulators
S. Lloyd · 1996
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1997
Earlier work this paper cites.
Addition on a quantum computer, (2000), arXiv:quant-ph/0008033
T. Draper · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Identity check is QMA-complete, (2003), arXiv:quant-ph/0305050
D. Janzing, P. Wocjan, and T. Beth · 2003
Earlier work this paper cites.
Universal quantum computation with ideal Clifford gates and noisy ancillas
S. Bravyi and A. Kitaev · 2005
Earlier work this paper cites.
Fast quantum modular exponentiation
R. Van Meter and K. M. Itoh · 2005
Earlier work this paper cites.
Data structures and algorithms for simplifying reversible circuits
A. K. Prasad, V. V. Shende, I. L. Markov, J. P. Hayes, and K. N. Patel · 2006
Earlier work this paper cites.
Efficient quantum algorithms for simulating sparse Hamiltonians
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders · 2007
Earlier work this paper cites.
Quantum circuit simplification and level compaction
D. Maslov, G. W. Dueck, D. M. Miller, and C. Negrevergne · 2008
Earlier work this paper cites.
Scaling laws for Shor’s algorithm with a banded quantum Fourier transform
Y. S. Nam and R. Blümel, · 2013
Cited alongside, same era.
Quipper: A scalable quantum programming language
A. S. Green, P. L. Lumsdaine, N. J. Ross, P. Selinger, and B. Valiron · 2013
Cited alongside, same era.
Synthesis and optimization of reversible circuits—a survey
M. Saeedi and I. L. Markov · 2013
Cited alongside, same era.
A bridge to lower overhead quantum computation, (2013), arXiv:1209.0510
A. G. Fowler and S. J. Devitt · 2013
Cited alongside, same era.
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
Optimal ancilla-free Clifford+T approximation of z -rotations
N. J. Ross and P. Selinger · 2016
Later among the works it cites.
Quantum Algorithm Zoo
S. P. Jordan · 2017
Closest in time.
Quantum Experience
IBM Research · 2017
Closest in time.
UK national quantum technologies programme
EPSRC · 2017
Closest in time.
Europe’s billion-euro quantum project takes shape
E. Gibney · 2017
Closest in time.
IBM sets sight on quantum computing
R. Hackett · 2017
Closest in time.
Practical quantum computers
R. Juskalian · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. Kliuchnikov, D. Maslov, and M. Mosca · 2013
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
Cited alongside, same era.
Intel invests US$50 million to advance quantum computing
Intel · 2015
Cited alongside, same era.
Google’s quantum dream machine
T. Simonite · 2015
Cited alongside, same era.
Demonstration of a small programmable quantum computer with atomic qubits
S. Debnath, N. M. Linke, C. Figgatt, K. A. Landsman, K. Wright, and C. Monroe · 2016
Cited alongside, same era.
IBM makes quantum computing available on IBM cloud to accelerate innovation
IBM · 2016
Cited alongside, same era.
Microsoft spends big to build a computer out of science fiction
J. Markoff · 2016
Cited alongside, same era.
Advancing Quantum Information Science: National Challenges and Opportunities
National Science and Technology Council · 2016
Cited alongside, same era.
Closest in time.
https://github.com/njross/optimizer (2017)
Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, Optimizer, Github, · 2017
Closest in time.
RSA factoring challenge
Wikipedia · 2017
Closest in time.
Quantum computation with realistic magic state factories
J. O’Gorman and E. T. Campbell · 2017
Closest in time.
Personal communication, December 6, 2017
A. G. Fowler · 2017
Closest in time.
The Certicom ECC challenge
Certicom · 2017
Closest in time.
An efficient quantum compiler that reduces T count, (2017), arXiv:1712.01557
L. Heyfron and E. T. Campbell · 2017
Closest in time.
Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning
M. Amy, D. Maslov, and M. Mosca · 2042
Closest in time.