Efficient simulation of sparse Markovian quantum dynamics

Godfrey H. Hardy, P. Seshu Aiyar, and Bertram M. Wilson, Collected papers of Srinivasa Ramanujan , AMS, 1927

1927

Earlier work this paper cites.

Edward Brian Davies, Markovian master equations , Communications in Mathematical Physics 39

1974

Earlier work this paper cites.

Vittorio Gorini, Andrzej Kossakowski, and Ennackal C. G. Sudarshan, Completely positive dynamical semigroups of N-level systems , Journal of Mathematical Physics 17

1976

Earlier work this paper cites.

Goran Lindblad, On the generators of quantum dynamical semigroups , Communications in Mathematical Physics 48

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.

Masuo Suzuki, Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations , Physics Letters A 146

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.

Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter, Elementary gates for quantum computation , Physical Review A 52

1995

Earlier work this paper cites.

Seth Lloyd, Universal quantum simulators , Science 273

1996

Earlier work this paper cites.

Alexei Y. Kitaev, Quantum computations: Algorithms and error correction , Russian Mathematical Surveys 52

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.

Barbara M. Terhal and David P. DiVincenzo, Problem of equilibration and the computation of correlation functions on a quantum computer , Physical Review A 61

2000

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.

Lov Grover and Terry Rudolph, Creating superpositions that correspond to efficiently integrable probability distributions , 2002, arXiv:quant-ph/0208112

2002

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, ACM, 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.

Gorjan Alagic and Alexander Russell, Decoherence in quantum walks on the hypercube , Physical Review A 72

2005

Cited alongside, same era.

Vivek V. Shende, Stephen S. Bullock, and Igor L. Markov, Synthesis of quantum logic circuits , Proceedings of the 2005 Asia and South Pacific Design Automation Conference, pp. 272–275, 2005, arXiv:quant-ph/0406176

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.

Edward Farhi, Jeffrey Goldstone, and Sam Gutmann, A quantum algorithm for the Hamiltonian NAND tree , Theory of Computing 4

John Watrous, Theory of quantum information , 2011

2011

Later among the works it cites.

Dominic W. Berry and Andrew M. Childs, Black-box Hamiltonian simulation and unitary implementation , Quantum Information and Computation 12

Original

2012

Later among the works it cites.

Andrew M. Childs and Nathan Wiebe, Hamiltonian simulation using linear combinations of unitary operations , Quantum Information & Computation 12

Original

2012

Later among the works it cites.

Man-Hong Yung and Alán Aspuru-Guzik, A quantum–quantum Metropolis algorithm , Proceedings of the National Academy of Sciences 109

Original

2012

Later among the works it cites.

Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma, Exponential improvement in precision for simulating sparse Hamiltonians , Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 283–292, 2014, arXiv:1312.1414