Exponential improvement in precision for simulating sparse Hamiltonians

George N. Watson, A treatise on the theory of Bessel functions , Cambridge University Press, 1922

1922

Earlier work this paper cites.

Richard P. Feynman, Simulating physics with computers , International Journal of Theoretical Physics 21

1982

Earlier work this paper cites.

Jacky Huyghebaert and Hans De Raedt, Product formula methods for time-dependent Schrödinger problems , Journal of Physics A 23

1990

Earlier work this paper cites.

Masuo Suzuki, General theory of fractal path integrals with applications to many-body theories and statistical physics , Journal of Mathematical Physics 32

1991

Earlier work this paper cites.

Rajeev Motwani and Prabhakar Raghavan, Randomized algorithms , Cambridge University Press, 1995

1995

Earlier work this paper cites.

Seth Lloyd, Universal quantum simulators , Science 273

1996

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.

Edward Farhi and Sam Gutmann, Analog analogue of a digital quantum computation , Physical Review A 57

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 ACM Symposium on Theory of Computing, pp. 20–29, 2003, arXiv:quant-ph/0301023

2003

Earlier work this paper cites.

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, 2003, arXiv:quant-ph/0209131

2003

Earlier work this paper cites.

Andrew M. Childs, Quantum information processing in continuous time , Ph.D. thesis, Massachusetts Institute of Technology, 2004

2004

Cited alongside, same era.

Matthias Christandl, Nilanjana Datta, Artur Ekert, and Andrew J. Landahl, Perfect state transfer in quantum spin networks , Physical Review Letters 92

2004

Cited alongside, same era.

Chris Marriott and John Watrous, Quantum Arthur–Merlin games , Computational Complexity 14

2005

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.

Carlos Mochon, Hamiltonian oracles , Physical Review A 75

2007

Cited alongside, same era.

Andris Ambainis, Andrew M. Childs, Ben W. Reichardt, Robert Špalek, and Shengyu Zhang, Any AND-OR formula of size N N can be evaluated in time N 1 / 2 + o ⁡ ( 1 ) N^{1/2+o(1)} on a quantum computer , SIAM Journal on Computing 39

Original

2010

Later among the works it cites.

Andris Ambainis, Loïck Magnin, Martin Roetteler, and Jérémie Roland, Symmetry-assisted adversaries for quantum state generation , Proceedings of the 26th IEEE Conference on Computational Complexity, pp. 167–177, 2011, arXiv:1012.2112

Original

2011

Later among the works it cites.

Andrew M. Childs and Robin Kothari, Simulating sparse Hamiltonians with star decompositions , Theory of Quantum Computation, Communication, and Cryptography (TQC 2010), Lecture Notes in Computer Science, vol. 6519, pp. 94–103, 2011, arXiv:1003.3683

Original

2011

Later among the works it cites.

Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Špalek, and Mario Szegedy, Quantum query complexity of state conversion , Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science, pp. 344–353, 2011, arXiv:1011.3020

Original

2011