Continuous Hamiltonian dynamics on digital quantum computers without discretization error

Abstract

We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number of gates comes at the cost of an attenuation of the measured expectation value by a known amplitude, requiring more shots per circuit. The gate count for simulation up to time $t$ is $O(t^2{\mu }^2)$ with $\mu$ the $1$-norm of the Hamiltonian, without dependence on the precision desired on the result, providing a significant improvement over previous algorithms. The only dependence in the norm makes it particularly adapted to non-sparse Hamiltonians. The algorithm generalizes to time-dependent Hamiltonians, appearing for example in adiabatic state preparation. These properties make it particularly suitable for present-day relatively noisy hardware that supports only circuits with moderate depth.

5 pages

References in corpus (6)

• Quantum algorithm for solving linear systems of equations
• Simulated Quantum Computation of Molecular Energies
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Compilation by stochastic Hamiltonian sparsification
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer
• Probabilistic Interpolation of Quantum Rotation Angles

Cited by in corpus (10)

• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Practicality of quantum adiabatic algorithm for chemistry applications
• A Hybrid Qubit Encoding: Splitting Fock Space into Fermionic and Bosonic Subspaces
• Dilution of error in digital Hamiltonian simulation
• AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
• Theory of quantum error mitigation for non-Clifford gates
• Phase estimation with partially randomized time evolution
• Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer
• Adiabatic Dynamics of Entanglement