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:2307.06503 · Physical Review Research

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

Lev Barash, Arman Babakhani, Itay Hen

Published Mar 14, 2024• 5 citations
arXivHTMLPDF

Abstract

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

DOI
10.1103/physrevresearch.6.013281

Related papers

Quantum Monte Carlo algorithm for Bose-Hubbard models on arbitrary graphs

E. Akaturk, Itay Hen

We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based on the recently introduced permutation matrix representation quantum Monte Carlo [Gupta, Albash, and Hen, J. Stat. Mech. (2020) 073105], the problem of adapting the simulation to a given geometry amounts to generating a cycle basis for the graph on which the model is defined, a procedure that can be carried out efficiently and in an automated manner. To showcase the versatility of our approach, we provide simulation results for Bose-Hubbard models defined on two-dimensional lattices as well as on a number of random graphs.

arXiv:2309.05166•Physical review. B./Physical review. B•Apr 25, 2024•6 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

A universal black-box quantum Monte Carlo approach to quantum phase transitions

Nic Ezzell, Lev Barash, Itay Hen

Abstract We derive exact, universal, closed-form quantum Monte Carlo estimators for finite-temperature energy susceptibility and fidelity susceptibility, applicable to essentially arbitrary Hamiltonians. Combined with recent advancements in Monte Carlo, our approach enables a black-box framework for studying quantum phase transitions —without requiring prior knowledge of an order parameter or the manual design of model-specific ergodic quantum Monte Carlo update rules. We demonstrate the utility of our method by applying a single implementation to the transverse-field Ising model, the XXZ model, and an ensemble of models related by random unitaries.

arXiv:2408.03924•npj Computational Materials•Dec 6, 2025•4 citations

Sign-Problem-Free Fermionic Quantum Monte Carlo: Developments and Applications

Zi-Xiang Li, Hong Yao

Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further our understanding of essential features in such systems. Quantum Monte Carlo (QMC) is a unique numerically exact and intrinsically unbiased method to simulate interacting quantum many-body systems. More importantly, when QMC simulations are free from the notorious fermion sign problem, they can reliably simulate interacting quantum models with large system size and low temperature to reveal low-energy physics such as spontaneously broken symmetries and universal quantum critical behaviors. Here, we concisely review recent progress made in developing new sign-problem-free QMC algorithms, including those employing Majorana representation and those utilizing hot-spot physics. We also discuss applications of these novel sign-problem-free QMC algorithms in simulations of various interesting quantum many-body models. Finally, we discuss possible future directions of designing sign-problem-free QMC methods.

arXiv:1805.08219•Annual Review of Condensed Matter Physics•Dec 19, 2018•126 citations

Stochastic series expansion quantum Monte Carlo for Rydberg arrays

Ejaaz Merali, Isaac J. S. De Vlugt, Roger G. Melko

Arrays of Rydberg atoms are a powerful platform to realize strongly-interacting quantum many-body systems. A common Rydberg Hamiltonian is free of the sign problem, meaning that its equilibrium properties are amenable to efficient simulation by quantum Monte Carlo (QMC). In this paper, we develop a Stochastic Series Expansion QMC algorithm for Rydberg atoms interacting on arbitrary lattices. We describe a cluster update that allows for the efficient sampling and calculation of physical observables for typical experimental parameters, and show that the algorithm can reproduce experimental results on large Rydberg arrays in one and two dimensions.

arXiv:2107.00766•SciPost Physics Core•Apr 5, 2024•9 citations

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

Luke Causer, Konstantinos Sfairopoulos, Jamie F. Mair +1 more

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

arXiv:2305.08935•Physical review. B./Physical review. B•Jan 16, 2024•2 citations
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
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based on the recently introduced permutation matrix representation quantum Monte Carlo [Gupta, Albash, and Hen, J. Stat. Mech. (2020) 073105], the problem of adapting the simulation to a given geometry amounts to generating a cycle basis for the graph on which the model is defined, a procedure that can be carried out efficiently and in an automated manner. To showcase the versatility of our approach, we provide simulation results for Bose-Hubbard models defined on two-dimensional lattices as well as on a number of random graphs.
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
Abstract We derive exact, universal, closed-form quantum Monte Carlo estimators for finite-temperature energy susceptibility and fidelity susceptibility, applicable to essentially arbitrary Hamiltonians. Combined with recent advancements in Monte Carlo, our approach enables a black-box framework for studying quantum phase transitions —without requiring prior knowledge of an order parameter or the manual design of model-specific ergodic quantum Monte Carlo update rules. We demonstrate the utility of our method by applying a single implementation to the transverse-field Ising model, the XXZ model, and an ensemble of models related by random unitaries.
Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further our understanding of essential features in such systems. Quantum Monte Carlo (QMC) is a unique numerically exact and intrinsically unbiased method to simulate interacting quantum many-body systems. More importantly, when QMC simulations are free from the notorious fermion sign problem, they can reliably simulate interacting quantum models with large system size and low temperature to reveal low-energy physics such as spontaneously broken symmetries and universal quantum critical behaviors. Here, we concisely review recent progress made in developing new sign-problem-free QMC algorithms, including those employing Majorana representation and those utilizing hot-spot physics. We also discuss applications of these novel sign-problem-free QMC algorithms in simulations of various interesting quantum many-body models. Finally, we discuss possible future directions of designing sign-problem-free QMC methods.
Arrays of Rydberg atoms are a powerful platform to realize strongly-interacting quantum many-body systems. A common Rydberg Hamiltonian is free of the sign problem, meaning that its equilibrium properties are amenable to efficient simulation by quantum Monte Carlo (QMC). In this paper, we develop a Stochastic Series Expansion QMC algorithm for Rydberg atoms interacting on arbitrary lattices. We describe a cluster update that allows for the efficient sampling and calculation of physical observables for typical experimental parameters, and show that the algorithm can reproduce experimental results on large Rydberg arrays in one and two dimensions.
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