Fetching the paper…
Reading the bibliography…
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations.
Richard P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics, 21
1982
Earlier work this paper cites.
A. Yu. Kitaev, “Quantum measurements and the abelian stabilizer problem,” arXiv preprint quant-ph/9511026 (1995)
1995
Earlier work this paper cites.
Seth Lloyd, “Universal quantum simulators,” Science, 273
1996
Earlier work this paper cites.
Peter W. Shor, “Fault-tolerant quantum computation,” in Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on (IEEE, 1996) pp. 56–65
1996
Earlier work this paper cites.
Daniel S. Abrams and Seth Lloyd, “Simulation of many-body Fermi systems on a universal quantum computer,” Physical Review Letters, 79
1997
Earlier work this paper cites.
Dorit Aharonov and Michael Ben-Or, “Fault-tolerant quantum computation with constant error,” in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (ACM, 1997) pp. 176–188
1997
Earlier work this paper cites.
Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca, “Quantum algorithms revisited,” in Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , Vol. 454 (The Royal Society, 1998) pp. 339–354
1998
Earlier work this paper cites.
Daniel S. Abrams and Seth Lloyd, “Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,” Physical Review Letters, 83
1999
Earlier work this paper cites.
Andrew M. Steane, “Efficient fault-tolerant quantum computing,” Nature, 399
1999
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.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser, “Quantum computation by adiabatic evolution,” (2000), quant-ph/0001106
2000
Earlier work this paper cites.
R. Somma, G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme, “Simulating physical phenomena by quantum networks,” Physical Review A, 65
2002
Earlier work this paper cites.
Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi, Classical and quantum computation , Vol. 47 (American Mathematical Society Providence, 2002)
2002
Earlier work this paper cites.
D. Aharonov and A. Ta-Shma, “Adiabatic quantum state generation and statistical zero knowledge,” Proc. 35th Annual ACM Symp. on Theo. Comp., 20 (2003)
2003
Earlier work this paper cites.
Mario Szegedy, “Quantum speed-up of Markov chain based algorithms,” in Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on (IEEE, 2004) pp. 32–41
2004
Cited alongside, same era.
Emanuel Knill, “Fault-tolerant postselected quantum computation: Schemes,” arXiv preprint quant-ph/0402171 (2004)
2004
Cited alongside, same era.
Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon, “Simulated quantum computation of molecular energies,” Science, 309
2005
Cited alongside, same era.
Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,” Physical Review A, 71
2005
Cited alongside, same era.
C. Marriott, and J. Watrous, “ Quantum Arthur-Merlin games,” Computational Complexity, 14
2005
Cited alongside, same era.
V. Kliuchnikov, D. Maslov, and M. Mosca, “Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits,” Physical Review Letters, 110
2013
Later among the works it cites.
2014
Later among the works it cites.
Dave Wecker, Bela Bauer, Bryan K. Clark, Matthew B. Hastings, and Matthias Troyer, “Gate-count estimates for performing quantum chemistry on small quantum computers,” Physical Review A, 90
2014
Later among the works it cites.
Dave Wecker, Matthew B. Hastings, Nathan Wiebe, Bryan K. Clark, Chetan Nayak, and Matthias Troyer, “Solving strongly correlated electron models on a quantum computer,” Physical Review A, 92
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Christopher M. Dawson and Michael A. Nielsen, “The Solovay-Kitaev algorithm,” Quantum Information & Computation, 6
2006
Cited alongside, same era.
Robert Raussendorf and Jim Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Physical Review Letters, 98
2007
Cited alongside, same era.
R. D. Somma, S. Boixo, Howard Barnum, and E. Knill, “Quantum simulations of classical annealing processes,” Physical Review Letters, 101
2008
Cited alongside, same era.
David Poulin and Pawel Wocjan, “Preparing ground states of quantum many-body systems on a quantum computer,” Physical Review Letters, 102
2009
Cited alongside, same era.
2009
Cited alongside, same era.
Kristan Temme, Tobias J. Osborne, Karl G. Vollbrecht, David Poulin, and Frank Verstraete, “Quantum metropolis sampling,” Nature, 471
2011
Cited alongside, same era.
Stephen P. Jordan, Keith S. M. Lee, and John Preskill, “Quantum algorithms for quantum field theories,” Science, 336
2012
Cited alongside, same era.
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma, “Simulating hamiltonian dynamics with a truncated taylor series,” Physical Review Letters, 114
2015
Later among the works it cites.
Alex Bocharov, Martin Roetteler, and Krysta M. Svore, “Efficient synthesis of universal repeat-until-success quantum circuits,” Physical Review Letters, 114
2015
Later among the works it cites.
Alex Bocharov, Martin Roetteler, and Krysta M. Svore, “Efficient synthesis of probabilistic quantum circuits with fallback,” Physical Review A, 91
2015
Later among the works it cites.
David Poulin, Matthew B. Hastings, Dave Wecker, Nathan Wiebe, Andrew C. Doherty, and Matthias Troyer, “The trotter step size required for accurate quantum simulation of quantum chemistry,” Quantum Information and Computation, 15
2015
Later among the works it cites.
Bela Bauer, Dave Wecker, Andrew J. Millis, Matthew B. Hastings, and Matthias Troyer, “Hybrid quantum-classical approach to correlated materials,” Physical Review X, 6
2016
Later among the works it cites.
2016
Later among the works it cites.
Guang Hao Low and Isaac L. Chuang, “Optimal hamiltonian simulation by quantum signal processing,” Physical Review Letters, 118
2017
Closest in time.
Jeongwan Haah, Matthew B. Hastings, D. Poulin, and D. Wecker, “Magic state distillation with low space overhead and optimal asymptotic input count,” Quantum, 1
2017
Closest in time.
2017
Closest in time.