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.14082 · SciPost Physics Core

Clock factorized quantum Monte Carlo method for long-range interacting systems

Zhijie Fan, Chao Zhang, Youjin Deng

Published Apr 8, 2025• 3 citations
arXivHTMLPDF

Abstract

Simulating long-range interacting systems is a challenging task due to its computational complexity that the computational effort for each local update is of order \mathcal{O}(N) 𝒪 ( N ) , where N N is the size of the system. In this work, we introduce the clock factorized quantum Monte Carlo method, an efficient technique for simulating long-range interacting quantum systems. The method is developed by generalizing the clock Monte Carlo method for classical systems [Phys. Rev. E 99 010105 (2019)] to the path-integral representation of long-range interacting quantum systems, with some specific treatments for quantum cases and a few significant technical improvements in general. We first explain how the clock factorized quantum Monte Carlo method is implemented to reduce the computational overhead from \mathcal{O}(N) 𝒪 ( N ) to \mathcal{O}(1) 𝒪 ( 1 ) . In particular, the core ingredients, including the concepts of bound probabilities and bound rejection events, the recursive sampling procedure, and the fast algorithms for sampling an extensive set of discrete and small probabilities, are elaborated. Next, we show how the clock factorized quantum Monte Carlo method can be flexibly implemented in various update strategies, like the Metropolis and worm-type algorithms. Finally, we demonstrate the high efficiency of the clock factorized quantum Monte Carlo algorithms using examples of three typical long-range interacting quantum systems, including the transverse field Ising model with long-range z z - z z interaction, the extended Bose-Hubbard model with long-range density-density interactions, and the XXZ Heisenberg model with long-range spin interactions. We expect that the clock factorized quantum Monte Carlo method would find broad applications in statistical and condensed-matter physics.

DOI
10.21468/scipostphyscore.8.2.036

Related papers

Quantum Monte Carlo studies of strongly correlated systems for quantum simulators

Stephan Humeniuk

Many strongly correlated quantum systems are difficult to study numerically because of the exponential growth of the Hilbert space combined with the failure of numerical methods in important parameter regimes. This includes the long-standing problems of high-temperature superconductivity and frustrated magnetism. A promising solution to this dilemma are quantum simulators, well-controlled (synthetic) quantum systems, emulating model Hamiltonians not only of condensed matter systems, where parameters can be tuned at will and model complexity can be added step by step. This dissertation presents numerical simulation studies that are motivated by quantum simulators. Using large-scale quantum Monte Carlo computer simulations and mean-field theory the semiquantitative ground state phase diagram of a Penning ion trap quantum simulator, realizing a two-dimensional model of quantum magnetism with long-range interactions, is obtained. We study also thermal and quantum phase transitions in one-dimensional transverse-field Ising models with long-range interactions, which exhibit a Kosterlitz-Thouless transition and universality classes with continuously varying critical exponents. The second part of this thesis is concerned with the Fermi-Hubbard model, which has been realized recently with ultracold atoms in optical lattices, both for repulsive and attractive interactions. Equipped with a quantum gas microscope, which allows single-site single-atom detection, these experimental setups can collect histograms of the particle number from repeated projective measurements. This dissertation presents a method to compute such full counting statistics for quadratic operators such as particle number or magnetization in the framework of determinantal quantum Monte Carlo. From an analysis of the full counting statistics of the particle number for different subsystem sizes the size of preformed pairs or Cooper pairs in the attractive Hubbard model is inferred. Furthermore, excellent agreement of the numerically computed probability distribution of the staggered magnetization with a recent quantum gas experiment demonstrates that current experiments are capable of resolving the differences between the Hubbard model and its limiting Heisenberg model. An extensive method section reviews the stochastic series expansion quantum Monte Carlo method for Ising models in a transverse field, which is free of the sign problem for arbitrary interactions, with special emphasis on the efficient simulation of long-range interactions. Also a self-contained introduction to the determinantal quantum Monte Carlo method is provided.

•Jan 1, 2018•5 citations

Monte Carlo Based Techniques for Quantum Magnets with Long-Range Interactions

Patrick Adelhardt, Jan Alexander Koziol, Anja Langheld +1 more

Long-range interactions are relevant for a large variety of quantum systems in quantum optics and condensed matter physics. In particular, the control of quantum-optical platforms promises to gain deep insights into quantum-critical properties induced by the long-range nature of interactions. From a theoretical perspective, long-range interactions are notoriously complicated to treat. Here, we give an overview of recent advancements to investigate quantum magnets with long-range interactions focusing on two techniques based on Monte Carlo integration. First, the method of perturbative continuous unitary transformations where classical Monte Carlo integration is applied within the embedding scheme of white graphs. This linked-cluster expansion allows extracting high-order series expansions of energies and observables in the thermodynamic limit. Second, stochastic series expansion quantum Monte Carlo integration enables calculations on large finite systems. Finite-size scaling can then be used to determine the physical properties of the infinite system. In recent years, both techniques have been applied successfully to one- and two-dimensional quantum magnets involving long-range Ising, XY, and Heisenberg interactions on various bipartite and non-bipartite lattices. Here, we summarise the obtained quantum-critical properties including critical exponents for all these systems in a coherent way. Further, we review how long-range interactions are used to study quantum phase transitions above the upper critical dimension and the scaling techniques to extract these quantum critical properties from the numerical calculations.

arXiv:2403.00421•Entropy•May 1, 2024•18 citations

Algorithms for quantum simulation: design, analysis, implementation, and application

Yuan Su

Simulating the Hamiltonian dynamics of quantum systems is one of the most promising applications of digital quantum computers. In this dissertation, we develop an understanding of quantum simulation algorithms concerning their design, analysis, implementation, and application. We implement three leading simulation algorithms, employing diverse techniques to tighten their error analyses and optimize circuit implementations. We produce concrete resource estimates for simulating a Heisenberg spin system, a problem arising in condensed matter physics that is otherwise difficult to solve on a classical computer. The resulting circuits are orders of magnitude smaller than those for the simplest classically-infeasible instances of factoring and quantum chemistry, suggesting the simulation of spin systems as a promising candidate for an early demonstration of practical quantum computation. We design new simulation algorithms by using classical randomness. We show that by simply randomizing how the terms in the Hamiltonian are ordered, one can prove stronger bounds for product formulas and thereby give more efficient quantum simulations. We also develop a classical sampler for time-dependent Hamiltonians, using which we give a simulation algorithm that substantially improves over previous approaches when the Hamiltonian varies significantly with time. We propose a general theory to analyzing product formulas, an approach to quantum simulation widely used in experimental demonstrations but whose error scaling was poorly understood. Our approach directly exploits the commutativity of Hamiltonian, overcoming the limitations of prior error analyses. We prove new speedups of product formulas for simulating many quantum systems, including simulations of nearest-neighbor lattice systems, second-quantized plane-wave electronic structure, $k$-local Hamiltonians, rapidly decaying power-law interactions, and clustered Hamiltonians, nearly matching or even outperforming the best previous results in quantum simulation. We accompany our analysis with numerical calculation, which suggests that the bounds also have nearly tight constant prefactors. We identify applications of quantum simulation to designing other quantum algorithms and improving quantum Monte Carlo methods. We develop an algorithmic framework ``quantum singular value transformation'' using techniques from quantum simulation and apply it to implement principal component regression. We also apply our new analysis of product formulas and obtain improved quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets.

•Jan 1, 2020•0 citations

Towards a quantum Monte Carlo for lattice systems

S. Figueroa-Manrique, Karen Rodríguez

In this work we build the foundations of a quantum Monte Carlo as a stochastic numerical method to solve lattice many-body quantum systems with nearest-neighbor interactions at most. As motivation, we briefly describe the bilinear-biquadratic Heisenberg model with an external field, for spin-1 particles, as an effective Hamiltonian of the Bose-Hubbard model with an external quadratic Zeeman field in the Mott insulator phase at unit filling. Then, we discuss how to implement the world line Monte Carlo with local updates to circumvent the difficulties that arise on these type of systems by mapping the quantum partition function into the one of an effective classical model, in one additional dimension, given by the imaginary time evolution of the system. Such a mapping is performed by means of the Suzuki-Trotter decomposition, which transforms the original partition function into a summation of weights given by the classical configurations. Later, we present a set of observables that can be measured through this method and show how to use a Metropolis update scheme to accomplish the measurements. At last, we present the maximization of the configuration weights for three parameter sets as the first and relevant step to perform future measurements.

Suplemento de la Revista Mexicana de Física•Aug 22, 2020•0 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

Density-matrix quantum Monte Carlo method

Nick S. Blunt, Thomas W. Rogers, James S. Spencer +1 more

We present a quantum Monte Carlo method capable of sampling the full density matrix of a many-particle system at finite temperature. This allows arbitrary reduced density matrix elements and expectation values of complicated nonlocal observables to be evaluated easily. The method resembles full configuration interaction quantum Monte Carlo but works in the space of many-particle operators instead of the space of many-particle wave functions. One simulation provides the density matrix at all temperatures simultaneously, from $T=\ensuremath{\infty}$ to $T=0$, allowing the temperature dependence of expectation values to be studied. The direct sampling of the density matrix also allows the calculation of some previously inaccessible entanglement measures. We explain the theory underlying the method, describe the algorithm, and introduce an importance-sampling procedure to improve the stochastic efficiency. To demonstrate the potential of our approach, the energy and staggered magnetization of the isotropic antiferromagnetic Heisenberg model on small lattices, the concurrence of one-dimensional spin rings, and the Renyi ${S}_{2}$ entanglement entropy of various sublattices of the $6\ifmmode\times\else\texttimes\fi{}6$ Heisenberg model are calculated. The nature of the sign problem in the method is also investigated.

arXiv:1303.5007•Physical Review B•Jun 18, 2014•108 citations
Simulating long-range interacting systems is a challenging task due to its computational complexity that the computational effort for each local update is of order \mathcal{O}(N) 𝒪 ( N ) , where N N is the size of the system. In this work, we introduce the clock factorized quantum Monte Carlo method, an efficient technique for simulating long-range interacting quantum systems. The method is developed by generalizing the clock Monte Carlo method for classical systems [Phys. Rev. E 99 010105 (2019)] to the path-integral representation of long-range interacting quantum systems, with some specific treatments for quantum cases and a few significant technical improvements in general. We first explain how the clock factorized quantum Monte Carlo method is implemented to reduce the computational overhead from \mathcal{O}(N) 𝒪 ( N ) to \mathcal{O}(1) 𝒪 ( 1 ) . In particular, the core ingredients, including the concepts of bound probabilities and bound rejection events, the recursive sampling procedure, and the fast algorithms for sampling an extensive set of discrete and small probabilities, are elaborated. Next, we show how the clock factorized quantum Monte Carlo method can be flexibly implemented in various update strategies, like the Metropolis and worm-type algorithms. Finally, we demonstrate the high efficiency of the clock factorized quantum Monte Carlo algorithms using examples of three typical long-range interacting quantum systems, including the transverse field Ising model with long-range z z - z z interaction, the extended Bose-Hubbard model with long-range density-density interactions, and the XXZ Heisenberg model with long-range spin interactions. We expect that the clock factorized quantum Monte Carlo method would find broad applications in statistical and condensed-matter physics.
Many strongly correlated quantum systems are difficult to study numerically because of the exponential growth of the Hilbert space combined with the failure of numerical methods in important parameter regimes. This includes the long-standing problems of high-temperature superconductivity and frustrated magnetism. A promising solution to this dilemma are quantum simulators, well-controlled (synthetic) quantum systems, emulating model Hamiltonians not only of condensed matter systems, where parameters can be tuned at will and model complexity can be added step by step. This dissertation presents numerical simulation studies that are motivated by quantum simulators. Using large-scale quantum Monte Carlo computer simulations and mean-field theory the semiquantitative ground state phase diagram of a Penning ion trap quantum simulator, realizing a two-dimensional model of quantum magnetism with long-range interactions, is obtained. We study also thermal and quantum phase transitions in one-dimensional transverse-field Ising models with long-range interactions, which exhibit a Kosterlitz-Thouless transition and universality classes with continuously varying critical exponents. The second part of this thesis is concerned with the Fermi-Hubbard model, which has been realized recently with ultracold atoms in optical lattices, both for repulsive and attractive interactions. Equipped with a quantum gas microscope, which allows single-site single-atom detection, these experimental setups can collect histograms of the particle number from repeated projective measurements. This dissertation presents a method to compute such full counting statistics for quadratic operators such as particle number or magnetization in the framework of determinantal quantum Monte Carlo. From an analysis of the full counting statistics of the particle number for different subsystem sizes the size of preformed pairs or Cooper pairs in the attractive Hubbard model is inferred. Furthermore, excellent agreement of the numerically computed probability distribution of the staggered magnetization with a recent quantum gas experiment demonstrates that current experiments are capable of resolving the differences between the Hubbard model and its limiting Heisenberg model. An extensive method section reviews the stochastic series expansion quantum Monte Carlo method for Ising models in a transverse field, which is free of the sign problem for arbitrary interactions, with special emphasis on the efficient simulation of long-range interactions. Also a self-contained introduction to the determinantal quantum Monte Carlo method is provided.
Long-range interactions are relevant for a large variety of quantum systems in quantum optics and condensed matter physics. In particular, the control of quantum-optical platforms promises to gain deep insights into quantum-critical properties induced by the long-range nature of interactions. From a theoretical perspective, long-range interactions are notoriously complicated to treat. Here, we give an overview of recent advancements to investigate quantum magnets with long-range interactions focusing on two techniques based on Monte Carlo integration. First, the method of perturbative continuous unitary transformations where classical Monte Carlo integration is applied within the embedding scheme of white graphs. This linked-cluster expansion allows extracting high-order series expansions of energies and observables in the thermodynamic limit. Second, stochastic series expansion quantum Monte Carlo integration enables calculations on large finite systems. Finite-size scaling can then be used to determine the physical properties of the infinite system. In recent years, both techniques have been applied successfully to one- and two-dimensional quantum magnets involving long-range Ising, XY, and Heisenberg interactions on various bipartite and non-bipartite lattices. Here, we summarise the obtained quantum-critical properties including critical exponents for all these systems in a coherent way. Further, we review how long-range interactions are used to study quantum phase transitions above the upper critical dimension and the scaling techniques to extract these quantum critical properties from the numerical calculations.
Simulating the Hamiltonian dynamics of quantum systems is one of the most promising applications of digital quantum computers. In this dissertation, we develop an understanding of quantum simulation algorithms concerning their design, analysis, implementation, and application. We implement three leading simulation algorithms, employing diverse techniques to tighten their error analyses and optimize circuit implementations. We produce concrete resource estimates for simulating a Heisenberg spin system, a problem arising in condensed matter physics that is otherwise difficult to solve on a classical computer. The resulting circuits are orders of magnitude smaller than those for the simplest classically-infeasible instances of factoring and quantum chemistry, suggesting the simulation of spin systems as a promising candidate for an early demonstration of practical quantum computation. We design new simulation algorithms by using classical randomness. We show that by simply randomizing how the terms in the Hamiltonian are ordered, one can prove stronger bounds for product formulas and thereby give more efficient quantum simulations. We also develop a classical sampler for time-dependent Hamiltonians, using which we give a simulation algorithm that substantially improves over previous approaches when the Hamiltonian varies significantly with time. We propose a general theory to analyzing product formulas, an approach to quantum simulation widely used in experimental demonstrations but whose error scaling was poorly understood. Our approach directly exploits the commutativity of Hamiltonian, overcoming the limitations of prior error analyses. We prove new speedups of product formulas for simulating many quantum systems, including simulations of nearest-neighbor lattice systems, second-quantized plane-wave electronic structure, kkk-local Hamiltonians, rapidly decaying power-law interactions, and clustered Hamiltonians, nearly matching or even outperforming the best previous results in quantum simulation. We accompany our analysis with numerical calculation, which suggests that the bounds also have nearly tight constant prefactors. We identify applications of quantum simulation to designing other quantum algorithms and improving quantum Monte Carlo methods. We develop an algorithmic framework ``quantum singular value transformation'' using techniques from quantum simulation and apply it to implement principal component regression. We also apply our new analysis of product formulas and obtain improved quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets.
In this work we build the foundations of a quantum Monte Carlo as a stochastic numerical method to solve lattice many-body quantum systems with nearest-neighbor interactions at most. As motivation, we briefly describe the bilinear-biquadratic Heisenberg model with an external field, for spin-1 particles, as an effective Hamiltonian of the Bose-Hubbard model with an external quadratic Zeeman field in the Mott insulator phase at unit filling. Then, we discuss how to implement the world line Monte Carlo with local updates to circumvent the difficulties that arise on these type of systems by mapping the quantum partition function into the one of an effective classical model, in one additional dimension, given by the imaginary time evolution of the system. Such a mapping is performed by means of the Suzuki-Trotter decomposition, which transforms the original partition function into a summation of weights given by the classical configurations. Later, we present a set of observables that can be measured through this method and show how to use a Metropolis update scheme to accomplish the measurements. At last, we present the maximization of the configuration weights for three parameter sets as the first and relevant step to perform future measurements.
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.
We present a quantum Monte Carlo method capable of sampling the full density matrix of a many-particle system at finite temperature. This allows arbitrary reduced density matrix elements and expectation values of complicated nonlocal observables to be evaluated easily. The method resembles full configuration interaction quantum Monte Carlo but works in the space of many-particle operators instead of the space of many-particle wave functions. One simulation provides the density matrix at all temperatures simultaneously, from $T=\ensuremath{\infty}$ to T=0T=0T=0, allowing the temperature dependence of expectation values to be studied. The direct sampling of the density matrix also allows the calculation of some previously inaccessible entanglement measures. We explain the theory underlying the method, describe the algorithm, and introduce an importance-sampling procedure to improve the stochastic efficiency. To demonstrate the potential of our approach, the energy and staggered magnetization of the isotropic antiferromagnetic Heisenberg model on small lattices, the concurrence of one-dimensional spin rings, and the Renyi S2{S}_{2}S2​ entanglement entropy of various sublattices of the $6\ifmmode\times\else\texttimes\fi{}6$ Heisenberg model are calculated. The nature of the sign problem in the method is also investigated.