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}
}
  • D. Berry, Andrew M. Childs, +2 authors R. Somma
  • Published 2014
  • Computer Science, Mathematics, Physics
  • Proceedings of the forty-sixth annual ACM symposium on Theory of computing
  • 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… CONTINUE READING
    154 Citations

    Paper Mentions

    Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
    • 48
    • PDF
    Hamiltonian simulation with nearly optimal dependence on spectral norm
    • 12
    • PDF
    A quantum algorithm for simulating non-sparse Hamiltonians
    • 12
    • PDF
    Optimal Hamiltonian Simulation by Quantum Signal Processing.
    • 170
    • Highly Influenced
    • PDF
    Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
    • 174
    • PDF
    Efficient algorithms in quantum query complexity
    • 22
    Compilation by stochastic Hamiltonian sparsification
    • 13
    • PDF

    References

    SHOWING 1-6 OF 6 REFERENCES
    Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
    • 31
    • Highly Influential
    • PDF
    Adiabatic quantum state generation and statistical zero knowledge
    • 271
    • Highly Influential
    • PDF
    Repeat-until-success: non-deterministic decomposition of single-qubit unitaries
    • 63
    • Highly Influential
    • PDF
    A Quantum Algorithm for the Hamiltonian NAND Tree
    • 247
    • Highly Influential
    • PDF
    Quantum Arthur–Merlin games
    • C. Marriott, J. Watrous
    • Mathematics, Computer Science
    • Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
    • 2004
    • 200
    • Highly Influential
    • PDF
    and R
    • D. Somma. Exponential improvement in precision for simulating sparse Hamiltonians
    • 2013