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

Classical and Quantum Simulation of Stoquastic Hamiltonians

Maarten Stroeks

Published Jan 1, 2020• 0 citations
OpenAlex

Abstract

Quantum systems are in general not e_ciently simulatable by classical means. If one wishes to determine (some of) the eigenvalues of a Hamiltonian H that is associated with a quantum system, there are two favoured strategies: Quantum simulation and quantum Monte Carlo schemes. The former strategy uses an experimentally well-controllable quantum system that emulates the system of interest, in a digital (i.e. universal) or analog manner. The latter, albeit with a limited range of applicability, uses classical stochastic processes to e_ciently obtain (often low-lying) eigenvalues of H. Quantum Monte Carlo methods may su_er from a sign problem when simulating fermionic or frustrated bosonic systems. This yields, for a given accuracy, a simulation time that scales exponentially in the system size and the inverse temperature.

Related papers

Statistical Physics

Malvin H. Kalos, Paula A. Whitlock

This chapter contains sections titled: Classical Systems Quantum Simulations

Wiley eBooks•Dec 3, 1986•0 citations

Sign Problem in Quantum Monte Carlo Simulation

Gaopei Pan, Zi Yang Meng

Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation techniques, ranging from the world-line and stochastic series expansion Monte Carlo for boson and spin systems to the determinant and momentum-space quantum Monte Carlo for interacting fermions. We point out the basis dependency of the sign problem and summarize the progresses to cure, ease and even make use of the sign problem over the years, such as symmetry analysis of the underlying Hamiltonian, basis optimization in writting down the partition functions and many others. Moreover, we state that although traditional lore saying that in case of sign problem, the average sign in QMC simulation approaches zero exponentially fast with the space-time volume of the configurational space, there are recent breakthroughs showing this is not always the case and based on the properties of the partition function for finite size systems, one could distinguish when the average sign has the usual exponential scaling and when it is bestowed with an algebraic scaling at the low temperature limit. Fermionic QMC simulations with such algebraic sign problems have been successfully carried out for extended Hubbard-type and quantum Moiré lattice models.

arXiv:2204.08777•Apr 19, 2022•42 citations

Quantum Monte Carlo methods

David Paul Landau, Kurt Binder

In most of the discussion presented so far in this book, the quantum character of atoms and electrons has been ignored. The Ising spin models have been an exception, but since the Ising Hamiltonian is diagonal (in the absence of a transverse magnetic field), all energy eigenvalues are known and the Monte Carlo sampling can be carried out just as in the case of classical statistical mechanics. Furthermore, the physical properties are in accord with the third law of thermodynamics for Ising-type Hamiltonians (e.g. entropy S and specific heat vanish for temperature T → 0, etc.) in contrast to the other truly classical models dealt with in previous chapters (e.g. classical Heisenberg spin models, classical fluids and solids, etc.) which have many unphysical low temperature properties.

Cambridge University Press eBooks•Jul 29, 2021•0 citations

Fermion ground state methods

James E. Gubernatis, Naoki Kawashima, Philipp Werner

In this chapter, we discuss the fixed-node and constrained-path Monte Carlo methods for computing the ground state properties of systems of interacting electrons. These methods are arguably the two most powerful ones presently available for doing such calculations, but they are approximate. By sacrificing exactness, they avoid the exponential scaling of the Monte Carlo errors with system size that typically accompanies the simulation of systems of interacting electrons. This exponential scaling is called the Fermion sign problem . After a few general comments about the sign problem, we outline both methods, noting points of similarity and difference, plus points of strength and weakness. We also discuss the constrained-phase method, an extension of the constrained-path method, which controls the phase problem that develops when the ground state wave function cannot be real. Sign problem The “sign problem” refers to the exponential increase of the Monte Carlo errors with increasing system size or decreasing temperature (e.g., Loh et al., 1990, 2005; Gubernatis and Zhang, 1994) that often accompanies a Markov chain simulation whose limiting distribution is not everywhere positive. Such a case generally arises in simulations of Fermion and frustrated quantum-spin systems. It seems so inherent to Monte Carlo simulations of Fermion systems that the phrase “the sign problem” to many seems almost synonymous with the phrase “the Fermion sign problem.” Explanations for the cause of the sign problem vary and are still debated. In this chapter, we choose to summarize two explanations that seem to connect the causes in ground state Fermion simulations in the continuum and on the lattice. The sign problem, of course, is not limited to ground state calculations or even to Fermion simulations. While the cause we discuss in Sections 11.2 and 11.3 focuses on the low-lying states of diffusion-like operators, several topological pictures have been proposed (Muramatsu et al., 1992; Samson, 1993; Gubernatis and Zhang, 1994; Samson, 1995). Some of these discussions are done in the context of the zero- and finite-temperature determinant methods (Muramatsu et al., 1992; Gubernatis and Zhang, 1994). Others are done more analytically from a Feynman path-integral point of view (Samson, 1993, 1995). Some are for particles with statistics other than Fermions. The presentation of the sign problem in this chapter is appropriate for the Monte Carlo methods discussed in this chapter.

Cambridge University Press eBooks•Jan 31, 2016•0 citations

Elective-momentum ultrasize quantum Monte Carlo method

Zi Hong Liu, Xiao Yan Xu, Yang Qi +2 more

One bottleneck of quantum Monte Carlo (QMC) simulation of strongly correlated electron systems lies at the scaling relation of computational complexity with respect to the system sizes. For generic lattice models of interacting fermions, the best methodology at hand still scales with $\ensuremath{\beta}{N}^{3}$ where $\ensuremath{\beta}$ is the inverse temperature and $N$ is the system size. Such scaling behavior has greatly hampered the accessibility of the universal infrared (IR) physics of many interesting correlated electron models at (2+1)D, let alone (3+1)D. To reduce the computational complexity, we develop a new QMC method with inhomogeneous momentum-space mesh, dubbed elective-momentum ultrasize quantum Monte Carlo (EQMC) method. Instead of treating all fermionic excitations on an equal footing as in conventional QMC methods, by converting the fermion determinant into the momentum space, our method focuses on fermion modes that are directly associated with low-energy (IR) physics in the vicinity of the so-called hot spots, while other fermion modes irrelevant for universal properties are ignored. As shown in the paper, for any cutoff-independent quantities, e.g., scaling exponents, this method can achieve the same level of accuracy with orders of magnitude increase in computational efficiency. We demonstrate this method with a model of antiferromagnetic itinerant quantum critical point, realized via coupling itinerant fermions with a frustrated transverse-field Ising model on a triangle lattice. The system size of $48\ifmmode\times\else\texttimes\fi{}48\ifmmode\times\else\texttimes\fi{}32$ ($L\ifmmode\times\else\texttimes\fi{}L\ifmmode\times\else\texttimes\fi{}\ensuremath{\beta}$, almost 3 times of previous investigations) are comfortably accessed with EQMC. With much larger system sizes, the scaling exponents are unveiled with unprecedentedly high accuracy, and this result sheds new light on the open debate about the nature and the universality class of itinerant quantum critical points.

arXiv:1801.00127•Physical review. B./Physical review. B•Feb 11, 2019•26 citations

Each System is Hamiltonian, and it is Quantizable. Quantum Systems Are Classical Systems

Domenico Oricchio

Each dynamical system is Hamiltonian. Each dynamical system is quantizable. Each quantum system is a classical system.

•Mar 1, 2016•0 citations
Quantum systems are in general not e_ciently simulatable by classical means. If one wishes to determine (some of) the eigenvalues of a Hamiltonian H that is associated with a quantum system, there are two favoured strategies: Quantum simulation and quantum Monte Carlo schemes. The former strategy uses an experimentally well-controllable quantum system that emulates the system of interest, in a digital (i.e. universal) or analog manner. The latter, albeit with a limited range of applicability, uses classical stochastic processes to e_ciently obtain (often low-lying) eigenvalues of H. Quantum Monte Carlo methods may su_er from a sign problem when simulating fermionic or frustrated bosonic systems. This yields, for a given accuracy, a simulation time that scales exponentially in the system size and the inverse temperature.
Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation techniques, ranging from the world-line and stochastic series expansion Monte Carlo for boson and spin systems to the determinant and momentum-space quantum Monte Carlo for interacting fermions. We point out the basis dependency of the sign problem and summarize the progresses to cure, ease and even make use of the sign problem over the years, such as symmetry analysis of the underlying Hamiltonian, basis optimization in writting down the partition functions and many others. Moreover, we state that although traditional lore saying that in case of sign problem, the average sign in QMC simulation approaches zero exponentially fast with the space-time volume of the configurational space, there are recent breakthroughs showing this is not always the case and based on the properties of the partition function for finite size systems, one could distinguish when the average sign has the usual exponential scaling and when it is bestowed with an algebraic scaling at the low temperature limit. Fermionic QMC simulations with such algebraic sign problems have been successfully carried out for extended Hubbard-type and quantum Moiré lattice models.
In most of the discussion presented so far in this book, the quantum character of atoms and electrons has been ignored. The Ising spin models have been an exception, but since the Ising Hamiltonian is diagonal (in the absence of a transverse magnetic field), all energy eigenvalues are known and the Monte Carlo sampling can be carried out just as in the case of classical statistical mechanics. Furthermore, the physical properties are in accord with the third law of thermodynamics for Ising-type Hamiltonians (e.g. entropy S and specific heat vanish for temperature T → 0, etc.) in contrast to the other truly classical models dealt with in previous chapters (e.g. classical Heisenberg spin models, classical fluids and solids, etc.) which have many unphysical low temperature properties.
In this chapter, we discuss the fixed-node and constrained-path Monte Carlo methods for computing the ground state properties of systems of interacting electrons. These methods are arguably the two most powerful ones presently available for doing such calculations, but they are approximate. By sacrificing exactness, they avoid the exponential scaling of the Monte Carlo errors with system size that typically accompanies the simulation of systems of interacting electrons. This exponential scaling is called the Fermion sign problem . After a few general comments about the sign problem, we outline both methods, noting points of similarity and difference, plus points of strength and weakness. We also discuss the constrained-phase method, an extension of the constrained-path method, which controls the phase problem that develops when the ground state wave function cannot be real. Sign problem The “sign problem” refers to the exponential increase of the Monte Carlo errors with increasing system size or decreasing temperature (e.g., Loh et al., 1990, 2005; Gubernatis and Zhang, 1994) that often accompanies a Markov chain simulation whose limiting distribution is not everywhere positive. Such a case generally arises in simulations of Fermion and frustrated quantum-spin systems. It seems so inherent to Monte Carlo simulations of Fermion systems that the phrase “the sign problem” to many seems almost synonymous with the phrase “the Fermion sign problem.” Explanations for the cause of the sign problem vary and are still debated. In this chapter, we choose to summarize two explanations that seem to connect the causes in ground state Fermion simulations in the continuum and on the lattice. The sign problem, of course, is not limited to ground state calculations or even to Fermion simulations. While the cause we discuss in Sections 11.2 and 11.3 focuses on the low-lying states of diffusion-like operators, several topological pictures have been proposed (Muramatsu et al., 1992; Samson, 1993; Gubernatis and Zhang, 1994; Samson, 1995). Some of these discussions are done in the context of the zero- and finite-temperature determinant methods (Muramatsu et al., 1992; Gubernatis and Zhang, 1994). Others are done more analytically from a Feynman path-integral point of view (Samson, 1993, 1995). Some are for particles with statistics other than Fermions. The presentation of the sign problem in this chapter is appropriate for the Monte Carlo methods discussed in this chapter.
One bottleneck of quantum Monte Carlo (QMC) simulation of strongly correlated electron systems lies at the scaling relation of computational complexity with respect to the system sizes. For generic lattice models of interacting fermions, the best methodology at hand still scales with $\ensuremath{\beta}{N}^{3}$ where $\ensuremath{\beta}$ is the inverse temperature and NNN is the system size. Such scaling behavior has greatly hampered the accessibility of the universal infrared (IR) physics of many interesting correlated electron models at (2+1)D, let alone (3+1)D. To reduce the computational complexity, we develop a new QMC method with inhomogeneous momentum-space mesh, dubbed elective-momentum ultrasize quantum Monte Carlo (EQMC) method. Instead of treating all fermionic excitations on an equal footing as in conventional QMC methods, by converting the fermion determinant into the momentum space, our method focuses on fermion modes that are directly associated with low-energy (IR) physics in the vicinity of the so-called hot spots, while other fermion modes irrelevant for universal properties are ignored. As shown in the paper, for any cutoff-independent quantities, e.g., scaling exponents, this method can achieve the same level of accuracy with orders of magnitude increase in computational efficiency. We demonstrate this method with a model of antiferromagnetic itinerant quantum critical point, realized via coupling itinerant fermions with a frustrated transverse-field Ising model on a triangle lattice. The system size of $48\ifmmode\times\else\texttimes\fi{}48\ifmmode\times\else\texttimes\fi{}32$ ($L\ifmmode\times\else\texttimes\fi{}L\ifmmode\times\else\texttimes\fi{}\ensuremath{\beta}$, almost 3 times of previous investigations) are comfortably accessed with EQMC. With much larger system sizes, the scaling exponents are unveiled with unprecedentedly high accuracy, and this result sheds new light on the open debate about the nature and the universality class of itinerant quantum critical points.