View in EDS

Efficient quantum simulation algorithms in the path integral formulation.

Saved in:
Bibliographic Details
Title: Efficient quantum simulation algorithms in the path integral formulation.
Authors: Shum, Serene1 (AUTHOR) serene.shum@mail.utoronto.ca, Wiebe, Nathan2,3 (AUTHOR)
Source: Journal of Physics A: Mathematical & Theoretical. 2026, Vol. 59 Issue 25, p1-52. 52p.
Subjects: Path integrals, Quantum computing, Lagrangian mechanics, Hamiltonian operator, Monte Carlo method, Quantum field theory
Abstract: We provide a new paradigm for quantum simulation based on path integration that allows quantum speedups to be observed for problems that are more naturally expressed using the path integral formalism rather than the conventional Hamiltonian formalism. We provide two novel quantum algorithms based on Hamiltonian versions of the path integral formulation and another for Lagrangians of the form m 2 x ˙ 2 − V (x) , while avoiding the sign problems that preclude efficient Monte-Carlo algorithms for such problems. This Lagrangian path integral algorithm is based on a new rigorous derivation of a discrete version of the Lagrangian path integral. Our first Hamiltonian path integral method breaks up the paths into short timesteps. It is efficient under appropriate sparsity assumptions and requires a number of queries to oracles that give the eigenvalues and overlaps between the eigenvectors of the Hamiltonian terms that scales as t o (1) / ϵ o (1) for simulation time t and error ϵ . The second approach uses long-time path integrals for near-adiabatic systems and has query complexity that scales as O (1 / ϵ) if the energy eigenvalue gaps and simulation time is sufficiently long. Finally, we show that our Lagrangian simulation algorithm requires a number of queries to an oracle that computes the discrete Lagrangian that scales for a system with η particles in D + 1 dimensions as O ~ (η D t 2 / ϵ) if V (x) is bounded and finite and the wavefunction obeys appropriate position and momentum cutoffs. This shows that Lagrangian dynamics can be efficiently simulated on quantum computers and opens up the possibility for quantum field theories for which the Hamiltonian is unknown to be efficiently simulated on quantum computers. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Physics A: Mathematical & Theoretical is the property of IOP Publishing and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:We provide a new paradigm for quantum simulation based on path integration that allows quantum speedups to be observed for problems that are more naturally expressed using the path integral formalism rather than the conventional Hamiltonian formalism. We provide two novel quantum algorithms based on Hamiltonian versions of the path integral formulation and another for Lagrangians of the form m 2 x ˙ 2 − V (x) , while avoiding the sign problems that preclude efficient Monte-Carlo algorithms for such problems. This Lagrangian path integral algorithm is based on a new rigorous derivation of a discrete version of the Lagrangian path integral. Our first Hamiltonian path integral method breaks up the paths into short timesteps. It is efficient under appropriate sparsity assumptions and requires a number of queries to oracles that give the eigenvalues and overlaps between the eigenvectors of the Hamiltonian terms that scales as t o (1) / ϵ o (1) for simulation time t and error ϵ . The second approach uses long-time path integrals for near-adiabatic systems and has query complexity that scales as O (1 / ϵ) if the energy eigenvalue gaps and simulation time is sufficiently long. Finally, we show that our Lagrangian simulation algorithm requires a number of queries to an oracle that computes the discrete Lagrangian that scales for a system with η particles in D + 1 dimensions as O ~ (η D t 2 / ϵ) if V (x) is bounded and finite and the wavefunction obeys appropriate position and momentum cutoffs. This shows that Lagrangian dynamics can be efficiently simulated on quantum computers and opens up the possibility for quantum field theories for which the Hamiltonian is unknown to be efficiently simulated on quantum computers. [ABSTRACT FROM AUTHOR]
ISSN:17518113
DOI:10.1088/1751-8121/ae751c