Fetching the paper…
Reading the bibliography…
We present an algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest.
William G. Bickley, Leslie J. Comrie, Jeffrey C. P. Miller, Donald H. Sadler, and Alexander J. Thompson, Bessel functions, part II, Functions of positive integer order , Cambridge University Press, 1952
1952
Earlier work this paper cites.
Milton Abramowitz and Irene A. Stegun, Handbook of mathematical functions , National Bureau of Standards, 1964
1964
Earlier work this paper cites.
Frank W. J. Olver, Error analysis of Miller’s recurrence algorithm , Mathematics of Computation 18
1964
Earlier work this paper cites.
Richard P. Brent, Fast multiple-precision evaluation of elementary functions , Journal of the Association for Computing Machinery 23
1976
Earlier work this paper cites.
Richard P. Feynman, Simulating physics with computers , International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
Seth Lloyd, Universal quantum simulators , Science 273
1996
Earlier work this paper cites.
Peter W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer , SIAM Journal on Computing 26
1997
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser, Limit on the speed of quantum computation in determining parity , Physical Review Letters 81
1998
Earlier work this paper cites.
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf, Quantum lower bounds by polynomials , Journal of the ACM 48
2001
Earlier work this paper cites.
Dorit Aharonov and Amnon Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge , Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 20–29, June 2003
2003
Cited alongside, same era.
Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman, Exponential algorithmic speedup by quantum walk , Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 59–68, June 2003, arXiv:quant-ph/0209131
2003
Cited alongside, same era.
Andrew M. Childs, Quantum information processing in continuous time , Ph.D. thesis, Massachusetts Institute of Technology, 2004
2004
Cited alongside, same era.
Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders, Efficient quantum algorithms for simulating sparse Hamiltonians , Communications in Mathematical Physics 270
2007
Cited alongside, same era.
2011
Later among the works it cites.
2011
Later among the works it cites.
2011
Later among the works it cites.
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann, A quantum algorithm for the Hamiltonian NAND tree , Theory of Computing 4
2008
Cited alongside, same era.
Andrew M. Childs, Richard Cleve, Stephen P. Jordan, and David Yonge-Mallo, Discrete-query quantum algorithm for NAND trees , Theory of Computing 5
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2010
Cited alongside, same era.
2011
Cited alongside, same era.
2012
Later among the works it cites.
National Energy Research Scientific Computing Center, NERSC Annual Report 2013 , https://www.nersc.gov/news-publications/publications-reports/nersc-annual-reports/
2013
Later among the works it cites.
Oak Ridge Leadership Computing Facility, OLCF Annual Report 2012–2013 , https://www.olcf.ornl.gov/media-center/center-reports/
2013
Later among the works it cites.
2014
Later among the works it cites.
Robin Kothari, Efficient algorithms in quantum query complexity , Ph.D. thesis, University of Waterloo, 2014
2014
Later among the works it cites.