Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.24942

Multi-particle quantum systems within the Worldline Monte Carlo formalism

Ivan Ahumada, Max Badcott, James P. Edwards, Craig McNeile, Filippo Ricchetti, Federico Grasselli, Guido Goldoni, Olindo Corradini, Marco Palomino

quant-phhep-latSubmitted Dec 31, 2025• Announced Jan 1, 2026• 0 citations
arXivHTMLPDF

Abstract

We extend the Worldline Monte Carlo approach to computationally simulating the Feynman path integral of non-relativistic multi-particle quantum-mechanical systems. We show how to generate an arbitrary number of worldlines distributed according to the (free) kinetic part of the multi-particle quantum dynamics and how to simulate interactions between worldlines in the ensemble. We test this formalism with two- and three-particle quantum mechanical systems, with both long range Coulomb-like interactions between the particles and external fields acting separately on the particles, in various spatial dimensionality. We extract accurate estimations of the ground state energy of these systems using the late-time behaviour of the propagator, validating our approach with numerically exact solutions obtained via straightforward diagonalisation of the Hamiltonian. Systematic benchmarking of the new approach, presented here for the first time, shows that the computational complexity of Wordline Monte Carlo scales more favourably with respect to standard numerical alternatives. The method, which is general, numerically exact, and computationally not intensive, can easily be generalised to relativistic systems.

Comments
23 pages (with 3 appendices), 14 figures

Related papers

Exact, complete, and universal continuous-time worldline Monte Carlo approach to the statistics of discrete quantum systems

Nikolay V. Prokof'ev, B. V. Svistunov, I. S. Tupitsyn

We show how the worldline quantum Monte Carlo procedure, which usually relies on an artificial time discretization, can be formulated directly in continuous time, rendering the scheme exact. For an arbitrary system with discrete Hilbert space, none of the configuration update procedures contain small parameters. We find that the most effective update strategy involves the motion of worldline discontinuities (both in space and time), i.e., the evaluation of the Green’s function. Being based on local updates only, our method nevertheless allows one to work with the grand canonical ensemble and nonzero winding numbers, and to calculate any dynamical correlation function as easily as expectation values of, e.g., total energy. The principles found for the update in continuous time generalize to any continuous variables in the space of discrete virtual transitions, and in principle also make it possible to simulate continuous systems exactly.

arXiv:cond-mat/9703200•Journal of Experimental and Theoretical Physics•Aug 1, 1998•408 citations

Efficient quantum simulation algorithms in the path integral formulation

Serene Shum, Nathan Wiebe

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.

arXiv:2405.07042•Journal of Physics A Mathematical and Theoretical•May 29, 2026•1 citation

Determinantal and worldline quantum Monte Carlo methods for many-body systems

Marco Vekić, Steven R. White

We examine three different quantum Monte Carlo methods for studying systems of interacting particles. The determinantal quantum Monte Carlo method is compared to two different worldline simulations. The first worldline method consists of a simulation carried out in the real-space basis, while the second method is implemented using as basis the eigenstates of the Hamiltonian on blocks of the two-dimensional lattice. We look, in particular, at the Hubbard model on a 4\ifmmode\times\else\texttimes\fi{}4 lattice with periodic boundary conditions. The block method is superior to the real-space method in terms of the computational cost of the simulation, but shows a much worse negative sign problem. For larger values of U and away from half-filling it is found that the real-space method can provide results at lower temperatures than the determinantal method. We show that the sign problem in the block method can be slightly improved by an appropriate choice of basis.

Physical review. B, Condensed matter•Jun 15, 1993•2 citations

Worldline Monte Carlo method for few-body nuclear physics

Shailesh Chandrasekharan A, Son T. Nguyen, Thomas R. Richardson

In this work we introduce a worldline-based fermion Monte Carlo algorithm for studying few body quantum mechanics of self-interacting fermions in the Hamiltonian lattice formulation. Our motivation to construct the method comes from our interest in studying renormalization of chiral nuclear effective-field theory with lattice regularization. In particular we wish to apply our method to compute the lattice spacing dependence of local lattice interactions as we take the continuum limit of the lattice theory. Our algorithm can compute matrix elements of the operator $exp(\ensuremath{-}\ensuremath{\beta}H)$, where $H$ is the lattice Hamiltonian and $\ensuremath{\beta}$ is a free real parameter. These elements help us compute deep bound states that are well separated from scattering states even at values of $\ensuremath{\beta}$ which are not very large. Computing these bound-state energies accurately can help us study renormalization of the lattice theory. In addition to developing the algorithm, in this work we also introduce a finite-volume renormalization scheme for the lattice Hamiltonian of the leading pionless effective-field theory and show how it would work in the one- and two-body sectors.

arXiv:2402.15377•Physical Review C•Aug 14, 2024•4 citations

Path-integral Monte Carlo method for Rényi entanglement entropies

C. M. Herdman, Stephen Inglis, Pierre–Nicholas Roy +2 more

We introduce a quantum Monte Carlo algorithm to measure the Rényi entanglement entropies in systems of interacting bosons in the continuum. This approach is based on a path-integral ground state method that can be applied to interacting itinerant bosons in any spatial dimension with direct relevance to experimental systems of quantum fluids. We demonstrate how it may be used to compute spatial mode entanglement, particle partitioned entanglement, and the entanglement of particles, providing insights into quantum correlations generated by fluctuations, indistinguishability, and interactions. We present proof-of-principle calculations and benchmark against an exactly soluble model of interacting bosons in one spatial dimension. As this algorithm retains the fundamental polynomial scaling of quantum Monte Carlo when applied to sign-problem-free models, future applications should allow for the study of entanglement entropy in large-scale many-body systems of interacting bosons.

arXiv:1404.7104•Physical Review E•Jul 25, 2014•44 citations

Accelerating Quantum Monte Carlo via Graphics Processing Units

Benjamin Himberg, Adrian Del Maestro

An exact quantum Monte Carlo algorithm for interacting particles in the spatial continuum is extended to exploit the massive parallelism offered by graphics processing units. Its efficacy is tested on the Calogero-Sutherland model describing a system of bosons interacting in one spatial dimension via an inverse square law. Due to the long range nature of the interactions, this model has proved difficult to simulate via conventional path integral Monte Carlo methods running on conventional processors. Using Graphics Processing Units, optimal speedup factors of up to 640 times are obtained for N = 126 particles. The known results for the ground state energy are confirmed and, for the first time, the effects of thermal fluctuations at finite temperature are explored.

Bulletin of the American Physical Society•Mar 5, 2018•0 citations
We extend the Worldline Monte Carlo approach to computationally simulating the Feynman path integral of non-relativistic multi-particle quantum-mechanical systems. We show how to generate an arbitrary number of worldlines distributed according to the (free) kinetic part of the multi-particle quantum dynamics and how to simulate interactions between worldlines in the ensemble. We test this formalism with two- and three-particle quantum mechanical systems, with both long range Coulomb-like interactions between the particles and external fields acting separately on the particles, in various spatial dimensionality. We extract accurate estimations of the ground state energy of these systems using the late-time behaviour of the propagator, validating our approach with numerically exact solutions obtained via straightforward diagonalisation of the Hamiltonian. Systematic benchmarking of the new approach, presented here for the first time, shows that the computational complexity of Wordline Monte Carlo scales more favourably with respect to standard numerical alternatives. The method, which is general, numerically exact, and computationally not intensive, can easily be generalised to relativistic systems.
We show how the worldline quantum Monte Carlo procedure, which usually relies on an artificial time discretization, can be formulated directly in continuous time, rendering the scheme exact. For an arbitrary system with discrete Hilbert space, none of the configuration update procedures contain small parameters. We find that the most effective update strategy involves the motion of worldline discontinuities (both in space and time), i.e., the evaluation of the Green’s function. Being based on local updates only, our method nevertheless allows one to work with the grand canonical ensemble and nonzero winding numbers, and to calculate any dynamical correlation function as easily as expectation values of, e.g., total energy. The principles found for the update in continuous time generalize to any continuous variables in the space of discrete virtual transitions, and in principle also make it possible to simulate continuous systems exactly.
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.
We examine three different quantum Monte Carlo methods for studying systems of interacting particles. The determinantal quantum Monte Carlo method is compared to two different worldline simulations. The first worldline method consists of a simulation carried out in the real-space basis, while the second method is implemented using as basis the eigenstates of the Hamiltonian on blocks of the two-dimensional lattice. We look, in particular, at the Hubbard model on a 4\ifmmode\times\else\texttimes\fi{}4 lattice with periodic boundary conditions. The block method is superior to the real-space method in terms of the computational cost of the simulation, but shows a much worse negative sign problem. For larger values of U and away from half-filling it is found that the real-space method can provide results at lower temperatures than the determinantal method. We show that the sign problem in the block method can be slightly improved by an appropriate choice of basis.
In this work we introduce a worldline-based fermion Monte Carlo algorithm for studying few body quantum mechanics of self-interacting fermions in the Hamiltonian lattice formulation. Our motivation to construct the method comes from our interest in studying renormalization of chiral nuclear effective-field theory with lattice regularization. In particular we wish to apply our method to compute the lattice spacing dependence of local lattice interactions as we take the continuum limit of the lattice theory. Our algorithm can compute matrix elements of the operator $exp(\ensuremath{-}\ensuremath{\beta}H)$, where HHH is the lattice Hamiltonian and $\ensuremath{\beta}$ is a free real parameter. These elements help us compute deep bound states that are well separated from scattering states even at values of $\ensuremath{\beta}$ which are not very large. Computing these bound-state energies accurately can help us study renormalization of the lattice theory. In addition to developing the algorithm, in this work we also introduce a finite-volume renormalization scheme for the lattice Hamiltonian of the leading pionless effective-field theory and show how it would work in the one- and two-body sectors.
We introduce a quantum Monte Carlo algorithm to measure the Rényi entanglement entropies in systems of interacting bosons in the continuum. This approach is based on a path-integral ground state method that can be applied to interacting itinerant bosons in any spatial dimension with direct relevance to experimental systems of quantum fluids. We demonstrate how it may be used to compute spatial mode entanglement, particle partitioned entanglement, and the entanglement of particles, providing insights into quantum correlations generated by fluctuations, indistinguishability, and interactions. We present proof-of-principle calculations and benchmark against an exactly soluble model of interacting bosons in one spatial dimension. As this algorithm retains the fundamental polynomial scaling of quantum Monte Carlo when applied to sign-problem-free models, future applications should allow for the study of entanglement entropy in large-scale many-body systems of interacting bosons.
An exact quantum Monte Carlo algorithm for interacting particles in the spatial continuum is extended to exploit the massive parallelism offered by graphics processing units. Its efficacy is tested on the Calogero-Sutherland model describing a system of bosons interacting in one spatial dimension via an inverse square law. Due to the long range nature of the interactions, this model has proved difficult to simulate via conventional path integral Monte Carlo methods running on conventional processors. Using Graphics Processing Units, optimal speedup factors of up to 640 times are obtained for N = 126 particles. The known results for the ground state energy are confirmed and, for the first time, the effects of thermal fluctuations at finite temperature are explored.