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.

arXiv comment5 pages

References in corpus (45)

• Quantum algorithm for solving linear systems of equations
• Quantum Simulation
• Quantum computational chemistry
• Adiabatic Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Error mitigation for short-depth quantum circuits
• Hamiltonian Simulation by Qubitization
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Efficient quantum algorithms for simulating sparse Hamiltonians
• On the relationship between continuous- and discrete-time quantum walk
• A random compiler for fast Hamiltonian simulation
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Virtual Distillation for Quantum Error Mitigation
• Exponential improvement in precision for simulating sparse Hamiltonians
• Nearly optimal lattice simulation by product formulas
• Faster quantum simulation by randomization
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Algorithms for quantum simulation at finite energies
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• A randomized quantum algorithm for statistical phase estimation
• Classically optimized Hamiltonian simulation
• Shorter gate sequences for quantum computing by mixing unitaries
• Compilation by stochastic Hamiltonian sparsification
• Optimised Trotter Decompositions for Classical and Quantum Computing
• Randomizing multi-product formulas for Hamiltonian simulation
• Realization of quantum signal processing on a noisy quantum computer
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
• On the complexity of implementing Trotter steps
• Protecting Expressive Circuits with a Quantum Error Detection Code
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics
• qSWIFT: High-order randomized compiler for Hamiltonian simulation
• Simulating prethermalization using near-term quantum computers
• Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
• Composite Quantum Simulations
• Importance sampling for stochastic quantum simulations
• Probabilistic Interpolation of Quantum Rotation Angles
• Doubling the order of approximation via the randomized product formula

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