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:2305.08935 · Physical review. B./Physical review. B

Rejection-free quantum Monte Carlo in continuous time from transition path sampling

Luke Causer, Konstantinos Sfairopoulos, Jamie F. Mair, Juan P. Garrahan

Published Jan 16, 2024• 2 citations
arXivHTMLPDF

Abstract

Continuous-time quantum Monte Carlo refers to a class of algorithms designed to sample the thermal distribution of a quantum Hamiltonian through exact expansions of the Boltzmann exponential in terms of stochastic trajectories which are periodic in imaginary time. Here, we show that for (sign-problem-free) quantum many-body systems with discrete degrees of freedom—such as spins on a lattice—this sampling can be done in a rejection-free manner using transition path sampling (TPS). The key idea is to converge the trajectory ensemble through updates where one individual degree of freedom is modified across all time while the remaining unaltered ones provide a time-dependent background. The ensuing single-body dynamics provides a way to generate trajectory updates exactly, allowing one to obtain the target ensemble efficiently via rejection-free TPS. We demonstrate our method on the transverse field Ising model in one and two dimensions, and on the quantum triangular plaquette (or Newman-Moore) model. We show that despite large autocorrelation times, our method is able to efficiently recover the respective quantum phase transition of each model. We also discuss the connection to rare event sampling in continuous-time Markov dynamics. Published by the American Physical Society 2024

DOI
10.1103/physrevb.109.024307

Related papers

Quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians

Lev Barash, Arman Babakhani, Itay Hen

We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin- 1/2 Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and simple automated protocol that produces QMC updates that are provably ergodic and satisfy detailed balance. We demonstrate the applicability and versatility of our method by considering several illustrative examples, including the simulation of the XY model on a triangular lattice, the toric code, and random k -local Hamiltonians. Published by the American Physical Society 2024

arXiv:2307.06503•Physical Review Research•Mar 14, 2024•5 citations

Efficient Quantum Monte Carlo through Cluster Expansions

Jorge Sánchez-Segovia, Álvaro M. Alhambra

The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of $(N\varepsilon^{-1})^{\mathcal{O}(\logΔ)}$, where $N$ is the system size, $\varepsilon$ the desired precision, and $Δ$ the interaction-graph degree. This becomes particularly severe in long-range systems, where $Δ\equiv N$, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime $\tilde{\mathcal{O}}(N^4\varepsilon^{-3})$. For quantum partition functions at temperatures $β\leqβ_{\mathrm{sampling}}\equiv\mathcal{O}(1)$, this improves to $\tilde{\mathcal{O}}(N^{3+1/D}\varepsilon^{-3})$, where $D$ is the lattice dimension. The framework directly applies to long-range quantum systems with interactions $\propto1/r^α$, including $2$-local models with $α>2D$.

quant-pharXiv:2610.03893•Oct 6, 2026•0 citations

Projected Density Matrix Sampling for Lattice Hamiltonians

Abhishek Kumar Karna, Wu, Hansen S., Shailesh Chandrasekharan A +1 more

Quantum Monte Carlo methods are powerful tools for studying quantum many-body systems but face difficulties in accessing excited states and in treating sign problems. We present a continuous-time path-integral Monte Carlo method for computing the low-lying spectrum of generic quantum Hamiltonians within a projection subspace. The method projects the thermal density matrix onto a subspace spanned by a chosen set of linearly independent states. It is free of Trotter discretization errors and systematically converges to the low-energy states which have finite overlap with the projection subspace as the $β$ parameter increases. While most effective for systems without a sign problem, the method also yields information about low-energy spectra when sign problems are present. We illustrate the approach on two problems. For the sign-free case, we compute the first four low-energy levels in the scaling limit of the one-dimensional Ising model with both transverse and longitudinal fields, demonstrating the flow from the conformal limit to the massive $E_8$ quantum field theory. For the sign-problem case, we apply the method to the frustrated Shastry-Sutherland model and benchmark it against exact diagonalization on small lattices. We also present results for larger systems beyond the lattice sizes accessible to exact diagonalization, while limited to small $β$ where sign problems occur. Our method provides a general route toward quantum Monte Carlo spectroscopy for lattice Hamiltonians.

arXiv:2511.19209•Nov 24, 2025•0 citations

State and superstate sampling in hybridization-expansion continuous-time quantum Monte Carlo

Alexander Kowalski, Andreas Hausoel, Markus Wallerberger +2 more

Due to the intrinsic complexity of the quantum many-body problem, quantum Monte Carlo algorithms and their corresponding Monte Carlo configurations can be defined in various ways. Configurations corresponding to few Feynman diagrams often lead to severe sign problems. On the other hand, computing the configuration weight becomes numerically expensive in the opposite limit in which many diagrams are grouped together. Here we show that for continuous-time quantum Monte Carlo in the hybridization expansion the efficiency can be substantially improved by dividing the local impurity trace into fragments, which are then sampled individually. For this technique, which also turns out to preserve the fermionic sign, a modified update strategy is introduced in order to ensure ergodicity. Our (super)state sampling is particularly beneficial to calculations with many $d$ orbitals and general local interactions, such as full Coulomb interaction. For illustration, we reconsider the simple albeit well-known case of a degenerate three-orbital model at low temperatures. This allows us to quantify the coherence properties of the ``spin-freezing'' crossover, even close to the Mott transition.

arXiv:1807.00361•Physical review. B./Physical review. B•Apr 8, 2019•24 citations

Quantum dynamical Hamiltonian Monte Carlo

Owen Lockwood, Peter Weiß, Filip Aronshtein +1 more

One of the open challenges in quantum computing is to find meaningful and practical methods to leverage quantum computation to accelerate classical machine-learning workflows. A ubiquitous problem in machine-learning workflows is sampling from probability distributions that we only have access to via their log probability. To this end, we extend the well-known Hamiltonian Monte Carlo (HMC) method for Markov chain Monte Carlo (MCMC) sampling to leverage quantum computation in a hybrid manner as a proposal function. Our new algorithm, Quantum Dynamical Hamiltonian Monte Carlo (QD-HMC), replaces the classical symplectic integration proposal step with simulations of quantum-coherent continuous-space dynamics on digital or analog quantum computers. We show that QD-HMC maintains key characteristics of HMC, such as maintaining the detailed balanced condition with momentum inversion, while also having the potential for polynomial speedups over its classical counterpart in certain scenarios. As sampling is a core subroutine in many forms of probabilistic inference, and MCMC in continuously parametrized spaces covers a large class of potential applications, this work widens the areas of applicability of quantum devices. Published by the American Physical Society 2024

arXiv:2403.01775•Physical Review Research•Aug 6, 2024•13 citations

Bell Sampling in Quantum Monte Carlo Simulations.

Poetri Sonya Tarabunga, Yi-Ming Ding

Quantum Monte Carlo (QMC) methods are essential for the numerical study of large-scale quantum many-body systems, yet their utility has been significantly hampered by the difficulty in computing key quantities such as off-diagonal operators and entanglement. This Letter introduces Bell-QMC, a novel QMC framework leveraging Bell sampling, a two-copy measurement protocol in the transversal Bell basis. We demonstrate that Bell-QMC enables an efficient and unbiased estimation of both challenging classes of observables, offering a significant advantage over previous QMC approaches. Notably, the entanglement across all system partitions can be computed in a single Bell-QMC simulation. We implement this method within the stochastic series expansion, where we design an efficient update scheme for sampling the configurations in the Bell basis. We demonstrate our algorithm in the one-dimensional transverse-field Ising model and the two-dimensional Z_{2} lattice gauge theory, extracting universal quantum features using only simple diagonal measurements. This Letter establishes Bell-QMC as a powerful framework that significantly expands the accessible quantum properties in QMC simulations, providing a substantial advantage over conventional QMC.

•Nov 14, 2025•0 citations
Continuous-time quantum Monte Carlo refers to a class of algorithms designed to sample the thermal distribution of a quantum Hamiltonian through exact expansions of the Boltzmann exponential in terms of stochastic trajectories which are periodic in imaginary time. Here, we show that for (sign-problem-free) quantum many-body systems with discrete degrees of freedom—such as spins on a lattice—this sampling can be done in a rejection-free manner using transition path sampling (TPS). The key idea is to converge the trajectory ensemble through updates where one individual degree of freedom is modified across all time while the remaining unaltered ones provide a time-dependent background. The ensuing single-body dynamics provides a way to generate trajectory updates exactly, allowing one to obtain the target ensemble efficiently via rejection-free TPS. We demonstrate our method on the transverse field Ising model in one and two dimensions, and on the quantum triangular plaquette (or Newman-Moore) model. We show that despite large autocorrelation times, our method is able to efficiently recover the respective quantum phase transition of each model. We also discuss the connection to rare event sampling in continuous-time Markov dynamics. Published by the American Physical Society 2024
We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin- 1/2 Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and simple automated protocol that produces QMC updates that are provably ergodic and satisfy detailed balance. We demonstrate the applicability and versatility of our method by considering several illustrative examples, including the simulation of the XY model on a triangular lattice, the toric code, and random k -local Hamiltonians. Published by the American Physical Society 2024
The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of (Nε−1)O(log⁡Δ)(N\varepsilon^{-1})^{\mathcal{O}(\logΔ)}(Nε−1)O(logΔ), where NNN is the system size, ε\varepsilonε the desired precision, and ΔΔΔ the interaction-graph degree. This becomes particularly severe in long-range systems, where Δ≡NΔ\equiv NΔ≡N, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime O~(N4ε−3)\tilde{\mathcal{O}}(N^4\varepsilon^{-3})O~(N4ε−3). For quantum partition functions at temperatures β≤βsampling≡O(1)β\leqβ_{\mathrm{sampling}}\equiv\mathcal{O}(1)β≤βsampling​≡O(1), this improves to O~(N3+1/Dε−3)\tilde{\mathcal{O}}(N^{3+1/D}\varepsilon^{-3})O~(N3+1/Dε−3), where DDD is the lattice dimension. The framework directly applies to long-range quantum systems with interactions ∝1/rα\propto1/r^α∝1/rα, including 222-local models with α>2Dα>2Dα>2D.
Quantum Monte Carlo methods are powerful tools for studying quantum many-body systems but face difficulties in accessing excited states and in treating sign problems. We present a continuous-time path-integral Monte Carlo method for computing the low-lying spectrum of generic quantum Hamiltonians within a projection subspace. The method projects the thermal density matrix onto a subspace spanned by a chosen set of linearly independent states. It is free of Trotter discretization errors and systematically converges to the low-energy states which have finite overlap with the projection subspace as the βββ parameter increases. While most effective for systems without a sign problem, the method also yields information about low-energy spectra when sign problems are present. We illustrate the approach on two problems. For the sign-free case, we compute the first four low-energy levels in the scaling limit of the one-dimensional Ising model with both transverse and longitudinal fields, demonstrating the flow from the conformal limit to the massive E8E_8E8​ quantum field theory. For the sign-problem case, we apply the method to the frustrated Shastry-Sutherland model and benchmark it against exact diagonalization on small lattices. We also present results for larger systems beyond the lattice sizes accessible to exact diagonalization, while limited to small βββ where sign problems occur. Our method provides a general route toward quantum Monte Carlo spectroscopy for lattice Hamiltonians.
Due to the intrinsic complexity of the quantum many-body problem, quantum Monte Carlo algorithms and their corresponding Monte Carlo configurations can be defined in various ways. Configurations corresponding to few Feynman diagrams often lead to severe sign problems. On the other hand, computing the configuration weight becomes numerically expensive in the opposite limit in which many diagrams are grouped together. Here we show that for continuous-time quantum Monte Carlo in the hybridization expansion the efficiency can be substantially improved by dividing the local impurity trace into fragments, which are then sampled individually. For this technique, which also turns out to preserve the fermionic sign, a modified update strategy is introduced in order to ensure ergodicity. Our (super)state sampling is particularly beneficial to calculations with many ddd orbitals and general local interactions, such as full Coulomb interaction. For illustration, we reconsider the simple albeit well-known case of a degenerate three-orbital model at low temperatures. This allows us to quantify the coherence properties of the ``spin-freezing'' crossover, even close to the Mott transition.
One of the open challenges in quantum computing is to find meaningful and practical methods to leverage quantum computation to accelerate classical machine-learning workflows. A ubiquitous problem in machine-learning workflows is sampling from probability distributions that we only have access to via their log probability. To this end, we extend the well-known Hamiltonian Monte Carlo (HMC) method for Markov chain Monte Carlo (MCMC) sampling to leverage quantum computation in a hybrid manner as a proposal function. Our new algorithm, Quantum Dynamical Hamiltonian Monte Carlo (QD-HMC), replaces the classical symplectic integration proposal step with simulations of quantum-coherent continuous-space dynamics on digital or analog quantum computers. We show that QD-HMC maintains key characteristics of HMC, such as maintaining the detailed balanced condition with momentum inversion, while also having the potential for polynomial speedups over its classical counterpart in certain scenarios. As sampling is a core subroutine in many forms of probabilistic inference, and MCMC in continuously parametrized spaces covers a large class of potential applications, this work widens the areas of applicability of quantum devices. Published by the American Physical Society 2024
Quantum Monte Carlo (QMC) methods are essential for the numerical study of large-scale quantum many-body systems, yet their utility has been significantly hampered by the difficulty in computing key quantities such as off-diagonal operators and entanglement. This Letter introduces Bell-QMC, a novel QMC framework leveraging Bell sampling, a two-copy measurement protocol in the transversal Bell basis. We demonstrate that Bell-QMC enables an efficient and unbiased estimation of both challenging classes of observables, offering a significant advantage over previous QMC approaches. Notably, the entanglement across all system partitions can be computed in a single Bell-QMC simulation. We implement this method within the stochastic series expansion, where we design an efficient update scheme for sampling the configurations in the Bell basis. We demonstrate our algorithm in the one-dimensional transverse-field Ising model and the two-dimensional Z_{2} lattice gauge theory, extracting universal quantum features using only simple diagonal measurements. This Letter establishes Bell-QMC as a powerful framework that significantly expands the accessible quantum properties in QMC simulations, providing a substantial advantage over conventional QMC.