Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Dominic W. Berry, Graeme Ahokas, Richard Cleve et al. · Communications in Mathematical Physics · 2006
Cited by 688 works. doi:10.1007/s00220-006-0150-x Open-access PDF
Authors
References
- Simulating physics with computers
- Quantum Mechanics Helps in Searching for a Needle in a Haystack
- Universal Quantum Simulators
- Quantum random-walk search algorithm
- Locality in Distributed Graph Algorithms
- Deterministic coin tossing with applications to optimal parallel list ranking
- An Example of the Difference Between Quantum and Classical Random Walks
- Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- The Complexity of the Local Hamiltonian Problem