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:1202.0525

A second-quantized red herring in full configuration-interaction Monte Carlo

Michael Kolodrubetz, Bryan K. Clark

Published Feb 2, 2012• 1 citation
arXivHTMLPDF

Abstract

This paper deals with the sign problem in full configuration-interaction quantum Monte Carlo. After putting this article on the arxiv, it was pointed out to us that our argument applies to a number of model Hamiltonians we considered numerically but not to the most generic case. Please see arxiv: 1209.3044, where we have a corrected comprehensive discussion of the necessary and sufficient conditions for when the sign problem for a given Hamiltonian (and basis) differ between first and second quantization.

DOI
10.48550/arxiv.1202.0525

Related papers

The effect of quantization on the full configuration interaction quantum Monte Carlo sign problem

Michael Kolodrubetz, James S. Spencer, Bryan K. Clark +1 more

The sign problem in full configuration interaction quantum Monte Carlo (FCIQMC) without annihilation can be understood as an instability of the psi-particle population to the ground state of the matrix obtained by making all off-diagonal elements of the Hamiltonian negative. Such a matrix, and hence the sign problem, is basis dependent. In this paper, we discuss the properties of a physically important basis choice: first versus second quantization. For a given choice of single-particle orbitals, we identify the conditions under which the fermion sign problem in the second quantized basis of antisymmetric Slater determinants is identical to the sign problem in the first quantized basis of unsymmetrized Hartree products. We also show that, when the two differ, the fermion sign problem is always less severe in the second quantized basis. This supports the idea that FCIQMC, even in the absence of annihilation, improves the sign problem relative to first quantized methods. Finally, we point out some theoretically interesting classes of Hamiltonians where first and second quantized sign problems differ, and others where they do not.

arXiv:1209.3044•The Journal of Chemical Physics•Jan 11, 2013•30 citations

Emergence of Critical Phenomena in Full Configuration Interaction Quantum Monte Carlo

James J. Shepherd, Lauretta R. Schwarz, Robert E. Thomas +3 more

There has been recent literature discussion on the origin and severity of the `sign problem' in full configuration interaction quantum Monte Carlo (FCIQMC) and its `initiator' adaptation (i-FCIQMC), methods of interest and potential because they allow for exact (FCI) ground-state solutions to be obtained often at a much reduced computational cost. In this study we aim to use a simple order parameter, describing the `sign structure' of the stochastic wavefunction representation, to empirically characterise the fundamentally different collective behaviour of the walker population in both methods.

arXiv:1209.4023•Sep 18, 2012•0 citations

Numerical investigations of the sign problem in full configuration interaction quantum Monte Carlo

James J. Shepherd, James S. Spencer, Gustavo E. Scuseria

Bulletin of the American Physical Society•Mar 4, 2015•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•7 citations

The sign problem and population dynamics in the full configuration interaction quantum Monte Carlo method

J. S. Spencer, Nick S. Blunt, W. M. C. Foulkes

The recently proposed full configuration interaction quantum Monte Carlo method allows access to essentially exact ground-state energies of systems of interacting fermions substantially larger than previously tractable without knowledge of the nodal structure of the ground-state wave function. We investigate the nature of the sign problem in this method and how its severity depends on the system studied. We explain how cancellation of the positive and negative particles sampling the wave function ensures convergence to a stochastic representation of the many-fermion ground state and accounts for the characteristic population dynamics observed in simulations.

arXiv:1110.5479•The Journal of Chemical Physics•Feb 6, 2012•108 citations

Sign problem in full configuration interaction quantum Monte Carlo: Linear and sublinear representation regimes for the exact wave function

James J. Shepherd, Gustavo E. Scuseria, James S. Spencer

We investigate the sign problem for full configuration interaction quantum Monte Carlo (FCIQMC), a stochastic algorithm for finding the ground-state solution of the Schr\"odinger equation with substantially reduced computational cost compared with exact diagonalization. We find $k$-space Hubbard models for which the solution is yielded with storage that grows sublinearly in the size of the many-body Hilbert space, in spite of using a wave function that is simply a linear combination of states. The FCIQMC algorithm is able to find this sublinear scaling regime without bias and with only a choice of the Hamiltonian basis. By means of a demonstration we solve for the energy of a 70-site half-filled system (with a space of ${10}^{38}$ determinants) in 250 core hours, substantially quicker than the $\ensuremath{\sim}{10}^{36}$ core hours that would be required by exact diagonalization. This is the largest space that has been sampled in an unbiased fashion. The challenge for the recently developed FCIQMC method is made clear: Expand the sublinear scaling regime while retaining exact-on-average accuracy. We comment upon the relationship between this and the scaling law previously observed in the initiator adaptation (i-FCIQMC). We argue that our results change the landscape for the development of FCIQMC and related methods.

arXiv:1407.4800•Physical Review B•Oct 27, 2014•35 citations
This paper deals with the sign problem in full configuration-interaction quantum Monte Carlo. After putting this article on the arxiv, it was pointed out to us that our argument applies to a number of model Hamiltonians we considered numerically but not to the most generic case. Please see arxiv: 1209.3044, where we have a corrected comprehensive discussion of the necessary and sufficient conditions for when the sign problem for a given Hamiltonian (and basis) differ between first and second quantization.
The sign problem in full configuration interaction quantum Monte Carlo (FCIQMC) without annihilation can be understood as an instability of the psi-particle population to the ground state of the matrix obtained by making all off-diagonal elements of the Hamiltonian negative. Such a matrix, and hence the sign problem, is basis dependent. In this paper, we discuss the properties of a physically important basis choice: first versus second quantization. For a given choice of single-particle orbitals, we identify the conditions under which the fermion sign problem in the second quantized basis of antisymmetric Slater determinants is identical to the sign problem in the first quantized basis of unsymmetrized Hartree products. We also show that, when the two differ, the fermion sign problem is always less severe in the second quantized basis. This supports the idea that FCIQMC, even in the absence of annihilation, improves the sign problem relative to first quantized methods. Finally, we point out some theoretically interesting classes of Hamiltonians where first and second quantized sign problems differ, and others where they do not.
There has been recent literature discussion on the origin and severity of the `sign problem' in full configuration interaction quantum Monte Carlo (FCIQMC) and its `initiator' adaptation (i-FCIQMC), methods of interest and potential because they allow for exact (FCI) ground-state solutions to be obtained often at a much reduced computational cost. In this study we aim to use a simple order parameter, describing the `sign structure' of the stochastic wavefunction representation, to empirically characterise the fundamentally different collective behaviour of the walker population in both methods.
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.
The recently proposed full configuration interaction quantum Monte Carlo method allows access to essentially exact ground-state energies of systems of interacting fermions substantially larger than previously tractable without knowledge of the nodal structure of the ground-state wave function. We investigate the nature of the sign problem in this method and how its severity depends on the system studied. We explain how cancellation of the positive and negative particles sampling the wave function ensures convergence to a stochastic representation of the many-fermion ground state and accounts for the characteristic population dynamics observed in simulations.
We investigate the sign problem for full configuration interaction quantum Monte Carlo (FCIQMC), a stochastic algorithm for finding the ground-state solution of the Schr\"odinger equation with substantially reduced computational cost compared with exact diagonalization. We find kkk-space Hubbard models for which the solution is yielded with storage that grows sublinearly in the size of the many-body Hilbert space, in spite of using a wave function that is simply a linear combination of states. The FCIQMC algorithm is able to find this sublinear scaling regime without bias and with only a choice of the Hamiltonian basis. By means of a demonstration we solve for the energy of a 70-site half-filled system (with a space of 1038{10}^{38}1038 determinants) in 250 core hours, substantially quicker than the $\ensuremath{\sim}{10}^{36}$ core hours that would be required by exact diagonalization. This is the largest space that has been sampled in an unbiased fashion. The challenge for the recently developed FCIQMC method is made clear: Expand the sublinear scaling regime while retaining exact-on-average accuracy. We comment upon the relationship between this and the scaling law previously observed in the initiator adaptation (i-FCIQMC). We argue that our results change the landscape for the development of FCIQMC and related methods.