Exponential improvement in precision for simulating sparse Hamiltonians
@article{Berry2014ExponentialII, title={Exponential improvement in precision for simulating sparse Hamiltonians}, author={D. Berry and Andrew M. Childs and R. Cleve and Robin Kothari and R. Somma}, journal={Proceedings of the forty-sixth annual ACM symposium on Theory of computing}, year={2014} }
We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a d-sparse Hamiltonian H on n qubits can be simulated for time t with precision ε using O(τlog(τ/ε)/log log(τ/ε)) queries and O(τnlog2(τ/ε)/log log(τ/ε)) additional 2-qubit gates, where τ=d2||H||maxt. Unlike previous approaches based on product formulas, the query complexity is… Expand
Supplemental Presentations
Paper Mentions
Blog Post
156 Citations
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
- Mathematics, Physics
- 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
- 2018
- 50
- PDF
Hamiltonian simulation with nearly optimal dependence on spectral norm
- Mathematics, Physics
- STOC
- 2019
- 13
- PDF
A quantum algorithm for simulating non-sparse Hamiltonians
- Computer Science, Physics
- Quantum Inf. Comput.
- 2020
- 12
- PDF
Optimal Hamiltonian Simulation by Quantum Signal Processing.
- Mathematics, Medicine
- Physical review letters
- 2017
- 176
- Highly Influenced
- PDF
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
- Mathematics, Physics
- 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
- 2015
- 179
- PDF
Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
- Physics, Mathematics
- 2015
- 30
- PDF
References
SHOWING 1-6 OF 6 REFERENCES
Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
- Computer Science, Mathematics
- Quantum Inf. Comput.
- 2016
- 31
- Highly Influential
- PDF
Adiabatic quantum state generation and statistical zero knowledge
- Mathematics, Physics
- STOC '03
- 2003
- 273
- Highly Influential
- PDF
Repeat-until-success: non-deterministic decomposition of single-qubit unitaries
- Mathematics, Computer Science
- Quantum Inf. Comput.
- 2014
- 64
- Highly Influential
- PDF
A Quantum Algorithm for the Hamiltonian NAND Tree
- Mathematics, Computer Science
- Theory Comput.
- 2008
- 247
- Highly Influential
- PDF
Quantum Arthur–Merlin games
- Mathematics, Computer Science
- Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
- 2004
- 201
- Highly Influential
- PDF
and R
- D. Somma. Exponential improvement in precision for simulating sparse Hamiltonians
- 2013