Compilation by stochastic Hamiltonian sparsification

  title={Compilation by stochastic Hamiltonian sparsification},
  author={Yingkai Ouyang and D. R. White and E. Campbell},
  journal={arXiv: Quantum Physics},
  • Yingkai Ouyang, D. R. White, E. Campbell
  • Published 2019
  • Physics, Computer Science
  • arXiv: Quantum Physics
  • Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantum system is decomposed into its constituent terms, where the effect of each term during time-evolution is individually computed. For many physical systems, the Hamiltonian has a large number of terms, constraining the scalability of established simulation methods. To address this limitation we introduce a new scheme… CONTINUE READING
    13 Citations

    Figures from this paper

    A Sparse Model of Quantum Holography
    • 6
    • PDF
    Nearly tight Trotterization of interacting electrons
    • 2
    • PDF
    A Theory of Trotter Error
    • 30
    • PDF
    Time-dependent Hamiltonian simulation with $L^1$-norm scaling
    • 13
    • PDF
    Virtual Distillation for Quantum Error Mitigation
    • 4
    • PDF
    Quantum storage in quantum ferromagnets
    • 3
    • PDF


    Random Compiler for Fast Hamiltonian Simulation.
    • 48
    • Highly Influential
    • PDF
    Optimal Hamiltonian Simulation by Quantum Signal Processing.
    • 166
    • PDF
    Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
    • 363
    • PDF
    Exponential improvement in precision for simulating sparse Hamiltonians
    • 152
    • PDF
    Simulation of electronic structure Hamiltonians using quantum computers
    • 223
    • PDF
    Faster quantum simulation by randomization.
    • 33
    • Highly Influential
    • PDF
    Stochastic gradient descent for hybrid quantum-classical optimization
    • 39
    • PDF