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

The Journal of Physical Chemistry A

Spin Purification in Full-CI Quantum Monte Carlo via a First-Order Penalty Approach

Oskar Weser, Niklas Liebermann, Daniel Kats, Ali Alavi, Giovanni Li Manni

Published Mar 17, 2022• 15 citations
Publisher

Abstract

High Resolution Image Download MS PowerPoint Slide In this article, we demonstrate that a first-order spin penalty scheme can be efficiently applied to the Slater determinant based Full-CI Quantum Monte Carlo (FCIQMC) algorithm, as a practical route toward spin purification. Two crucial applications are presented to demonstrate the validity and robustness of this scheme: the 1 Δ g ← 3 Σ g vertical excitation in O 2 and key spin gaps in a [Mn 3 (IV) O 4 ] cluster. In the absence of a robust spin adaptation/purification technique, both applications would be unattainable by Slater determinant based ground state methods, with any starting wave function collapsing into the higher-spin ground state during the optimization. This strategy can be coupled to other algorithms that use the Slater determinant based FCIQMC algorithm as configuration interaction eigensolver, including the Stochastic Generalized Active Space, the similarity-transformed FCIQMC, the tailored-CC, and second-order perturbation theory approaches. Moreover, in contrast to the GUGA-FCIQMC technique, this strategy features both spin projection and total spin adaptation, making it appealing when solving anisotropic Hamiltonians. It also provides spin-resolved reduced density matrices, important for the investigation of spin-dependent properties in polynuclear transition metal clusters, such as the hyperfine-coupling constants.

DOI
10.1021/acs.jpca.2c01338

Related papers

Efficient formulation of full configuration interaction quantum Monte Carlo in a spin eigenbasis via the graphical unitary group approach

Werner Dobrautz, Simon D. Smart, Ali Alavi

We provide a spin-adapted formulation of the Full Configuration Interaction Quantum Monte Carlo (FCIQMC) algorithm, based on the Graphical Unitary Group Approach (GUGA), which enables the exploitation of SU(2) symmetry within this stochastic framework. Random excitation generation and matrix element calculation on the Shavitt graph of GUGA can be efficiently implemented via a biasing procedure on the branching diagram. The use of a spin-pure basis explicitly resolves the different spin-sectors and ensures that the stochastically sampled wavefunction is an eigenfunction of the total spin operator S^2. The method allows for the calculation of states with low or intermediate spin in systems dominated by Hund’s first rule, which are otherwise generally inaccessible. Furthermore, in systems with small spin gaps, the new methodology enables much more rapid convergence with respect to walker number and simulation time. Some illustrative applications of the GUGA-FCIQMC method are provided: computation of the 2F − 4F spin gap of the cobalt atom in large basis sets, achieving chemical accuracy to experiment, and the Σg+1, Σg+3, Σg+5, and Σg+7 spin-gaps of the stretched N2 molecule, an archetypal strongly correlated system.

arXiv:1905.01346•The Journal of Chemical Physics•Sep 6, 2019•78 citations

Investigating quantum Monte Carlo methods in Slater determinant bases

W. A. Vigor

In this thesis we investigate the recently developed Full Configuration Interaction Quantum Monte Carlo (FCIQMC) method. This method, unlike the traditional methods in Quantum Monte Carlo (QMC), doesn’t require the use of the uncontrolled fixed node approximation and so potentially it can yield far more accurate results. This means that it can be thought of as a hybrid between the methods used by quantum chemists and QMC, and thus has spawned a new field of stochastic quantum chemistry. The work described in this thesis can be split into three distinct but interrelated parts. We begin with an investigation of the underlying FCIQMC stochastic process. We show that FCIQMC is an example of Markov Chain Monte Carlo. This means we can compute a stochastic matrix from which all details about the Monte-Carlo simulation can be obtained. Unfortunately the size of the space scales unfavourably as a function of system size meaning that we have only managed to compute the matrix for the smallest interesting two determinant system. We then use these results to quantify population control bias in FCIQMC for a two determinant system supplementing these analytical results with empirical results to investigate more realistic systems. We then attempt to quantify the efficiency of the FCIQMC algorithms, defining a measure of efficiency. After this we investigate the dependence of our measure on the system size. The error bar of the most efficient FCIQMC algorithm will decay fastest as a function of computer time. We then draw conclusions about the applicability of the FCIQMC method. Finally we describe an implementation of FCIQMC on a novel data flow computer architecture. In our implementation we made a modification to the FCIQMC algorithm to fit the data flow paradigm. We investigate the efficiency of the modified FCIQMC algorithm.

•Jun 1, 2015•1 citation

Robust and Efficient Spin Purification for Determinantal Configuration Interaction

B. Scott Fales, Edward G. Hohenstein, Benjamin G. Levine

The limited precision of floating point arithmetic can lead to the qualitative and even catastrophic failure of quantum chemical algorithms, especially when high accuracy solutions are sought. For example, numerical errors accumulated while solving for determinantal configuration interaction wave functions via Davidson diagonalization may lead to spin contamination in the trial subspace. This spin contamination may cause the procedure to converge to roots with undesired ⟨ Ŝ 2 ⟩, wasting computer time in the best case and leading to incorrect conclusions in the worst. In hopes of finding a suitable remedy, we investigate five purification schemes for ensuring that the eigenvectors have the desired ⟨ Ŝ 2 ⟩. These schemes are based on projection, penalty, and iterative approaches. All of these schemes rely on a direct, graphics processing unit-accelerated algorithm for calculating the S 2 c matrix-vector product. We assess the computational cost and convergence behavior of these methods by application to several benchmark systems and find that the first-order spin penalty method is the optimal choice, though first-order and Löwdin projection approaches also provide fast convergence to the desired spin state. Finally, to demonstrate the utility of these approaches, we computed the lowest several excited states of an open-shell silver cluster (Ag 19 ) using the state-averaged complete active space self-consistent field method, where spin purification was required to ensure spin stability of the CI vector coefficients. Several low-lying states with significant multiply excited character are predicted, suggesting the value of a multireference approach for modeling plasmonic nanomaterials.

Journal of Chemical Theory and Computation•Aug 3, 2017•22 citations

Excited states from quantum Monte Carlo in the basis of Slater determinants

Alexander Humeniuk, Roland Mitrić

Building on the full configuration interaction quantum Monte Carlo (FCIQMC) algorithm introduced recently by Booth et al. [J. Chem. Phys. 131, 054106 (2009)] to compute the ground state of correlated many-electron systems, an extension to the computation of excited states (exFCIQMC) is presented. The Hilbert space is divided into a large part consisting of pure Slater determinants and a much smaller orthogonal part (the size of which is controlled by a cut-off threshold), from which the lowest eigenstates can be removed efficiently. In this way, the quantum Monte Carlo algorithm is restricted to the orthogonal complement of the lower excited states and projects out the next highest excited state. Starting from the ground state, higher excited states can be found one after the other. The Schrödinger equation in imaginary time is solved by the same population dynamics as in the ground state algorithm with modified probabilities and matrix elements, for which working formulae are provided. As a proof of principle, the method is applied to lithium hydride in the 3-21G basis set and to the helium dimer in the aug-cc-pVDZ basis set. It is shown to give the correct electronic structure for all bond lengths. Much more testing will be required before the applicability of this method to electron correlation problems of interesting size can be assessed.

The Journal of Chemical Physics•Nov 17, 2014•16 citations

Semi-stochastic full configuration interaction quantum Monte Carlo: Developments and application

Nick S. Blunt, Simon D. Smart, J. A. F. Kersten +3 more

We expand upon the recent semi-stochastic adaptation to full configuration interaction quantum Monte Carlo (FCIQMC). We present an alternate method for generating the deterministic space without a priori knowledge of the wave function and present stochastic efficiencies for a variety of both molecular and lattice systems. The algorithmic details of an efficient semi-stochastic implementation are presented, with particular consideration given to the effect that the adaptation has on parallel performance in FCIQMC. We further demonstrate the benefit for calculation of reduced density matrices in FCIQMC through replica sampling, where the semi-stochastic adaptation seems to have even larger efficiency gains. We then combine these ideas to produce explicitly correlated corrected FCIQMC energies for the beryllium dimer, for which stochastic errors on the order of wavenumber accuracy are achievable.

arXiv:1502.04847•The Journal of Chemical Physics•May 14, 2015•102 citations

The HANDE-QMC Project: Open-Source Stochastic Quantum Chemistry from the Ground State Up

James S. Spencer, Nick S. Blunt, Seonghoon Choi +15 more

Building on the success of Quantum Monte Carlo techniques such as diffusion Monte Carlo, alternative stochastic approaches to solve electronic structure problems have emerged over the past decade. The full configuration interaction quantum Monte Carlo (FCIQMC) method allows one to systematically approach the exact solution of such problems, for cases where very high accuracy is desired. The introduction of FCIQMC has subsequently led to the development of coupled cluster Monte Carlo (CCMC) and density matrix quantum Monte Carlo (DMQMC), allowing stochastic sampling of the coupled cluster wave function and the exact thermal density matrix, respectively. In this Article, we describe the HANDE-QMC code, an open-source implementation of FCIQMC, CCMC and DMQMC, including initiator and semistochastic adaptations. We describe our code and demonstrate its use on three example systems; a molecule (nitric oxide), a model solid (the uniform electron gas), and a real solid (diamond). An illustrative tutorial is also included.

arXiv:1811.11679•Journal of Chemical Theory and Computation•Jan 25, 2019•46 citations
High Resolution Image Download MS PowerPoint Slide In this article, we demonstrate that a first-order spin penalty scheme can be efficiently applied to the Slater determinant based Full-CI Quantum Monte Carlo (FCIQMC) algorithm, as a practical route toward spin purification. Two crucial applications are presented to demonstrate the validity and robustness of this scheme: the 1 Δ g ← 3 Σ g vertical excitation in O 2 and key spin gaps in a [Mn 3 (IV) O 4 ] cluster. In the absence of a robust spin adaptation/purification technique, both applications would be unattainable by Slater determinant based ground state methods, with any starting wave function collapsing into the higher-spin ground state during the optimization. This strategy can be coupled to other algorithms that use the Slater determinant based FCIQMC algorithm as configuration interaction eigensolver, including the Stochastic Generalized Active Space, the similarity-transformed FCIQMC, the tailored-CC, and second-order perturbation theory approaches. Moreover, in contrast to the GUGA-FCIQMC technique, this strategy features both spin projection and total spin adaptation, making it appealing when solving anisotropic Hamiltonians. It also provides spin-resolved reduced density matrices, important for the investigation of spin-dependent properties in polynuclear transition metal clusters, such as the hyperfine-coupling constants.
We provide a spin-adapted formulation of the Full Configuration Interaction Quantum Monte Carlo (FCIQMC) algorithm, based on the Graphical Unitary Group Approach (GUGA), which enables the exploitation of SU(2) symmetry within this stochastic framework. Random excitation generation and matrix element calculation on the Shavitt graph of GUGA can be efficiently implemented via a biasing procedure on the branching diagram. The use of a spin-pure basis explicitly resolves the different spin-sectors and ensures that the stochastically sampled wavefunction is an eigenfunction of the total spin operator S^2. The method allows for the calculation of states with low or intermediate spin in systems dominated by Hund’s first rule, which are otherwise generally inaccessible. Furthermore, in systems with small spin gaps, the new methodology enables much more rapid convergence with respect to walker number and simulation time. Some illustrative applications of the GUGA-FCIQMC method are provided: computation of the 2F − 4F spin gap of the cobalt atom in large basis sets, achieving chemical accuracy to experiment, and the Σg+1, Σg+3, Σg+5, and Σg+7 spin-gaps of the stretched N2 molecule, an archetypal strongly correlated system.
In this thesis we investigate the recently developed Full Configuration Interaction Quantum Monte Carlo (FCIQMC) method. This method, unlike the traditional methods in Quantum Monte Carlo (QMC), doesn’t require the use of the uncontrolled fixed node approximation and so potentially it can yield far more accurate results. This means that it can be thought of as a hybrid between the methods used by quantum chemists and QMC, and thus has spawned a new field of stochastic quantum chemistry. The work described in this thesis can be split into three distinct but interrelated parts. We begin with an investigation of the underlying FCIQMC stochastic process. We show that FCIQMC is an example of Markov Chain Monte Carlo. This means we can compute a stochastic matrix from which all details about the Monte-Carlo simulation can be obtained. Unfortunately the size of the space scales unfavourably as a function of system size meaning that we have only managed to compute the matrix for the smallest interesting two determinant system. We then use these results to quantify population control bias in FCIQMC for a two determinant system supplementing these analytical results with empirical results to investigate more realistic systems. We then attempt to quantify the efficiency of the FCIQMC algorithms, defining a measure of efficiency. After this we investigate the dependence of our measure on the system size. The error bar of the most efficient FCIQMC algorithm will decay fastest as a function of computer time. We then draw conclusions about the applicability of the FCIQMC method. Finally we describe an implementation of FCIQMC on a novel data flow computer architecture. In our implementation we made a modification to the FCIQMC algorithm to fit the data flow paradigm. We investigate the efficiency of the modified FCIQMC algorithm.
The limited precision of floating point arithmetic can lead to the qualitative and even catastrophic failure of quantum chemical algorithms, especially when high accuracy solutions are sought. For example, numerical errors accumulated while solving for determinantal configuration interaction wave functions via Davidson diagonalization may lead to spin contamination in the trial subspace. This spin contamination may cause the procedure to converge to roots with undesired ⟨ Ŝ 2 ⟩, wasting computer time in the best case and leading to incorrect conclusions in the worst. In hopes of finding a suitable remedy, we investigate five purification schemes for ensuring that the eigenvectors have the desired ⟨ Ŝ 2 ⟩. These schemes are based on projection, penalty, and iterative approaches. All of these schemes rely on a direct, graphics processing unit-accelerated algorithm for calculating the S 2 c matrix-vector product. We assess the computational cost and convergence behavior of these methods by application to several benchmark systems and find that the first-order spin penalty method is the optimal choice, though first-order and Löwdin projection approaches also provide fast convergence to the desired spin state. Finally, to demonstrate the utility of these approaches, we computed the lowest several excited states of an open-shell silver cluster (Ag 19 ) using the state-averaged complete active space self-consistent field method, where spin purification was required to ensure spin stability of the CI vector coefficients. Several low-lying states with significant multiply excited character are predicted, suggesting the value of a multireference approach for modeling plasmonic nanomaterials.
Building on the full configuration interaction quantum Monte Carlo (FCIQMC) algorithm introduced recently by Booth et al. [J. Chem. Phys. 131, 054106 (2009)] to compute the ground state of correlated many-electron systems, an extension to the computation of excited states (exFCIQMC) is presented. The Hilbert space is divided into a large part consisting of pure Slater determinants and a much smaller orthogonal part (the size of which is controlled by a cut-off threshold), from which the lowest eigenstates can be removed efficiently. In this way, the quantum Monte Carlo algorithm is restricted to the orthogonal complement of the lower excited states and projects out the next highest excited state. Starting from the ground state, higher excited states can be found one after the other. The Schrödinger equation in imaginary time is solved by the same population dynamics as in the ground state algorithm with modified probabilities and matrix elements, for which working formulae are provided. As a proof of principle, the method is applied to lithium hydride in the 3-21G basis set and to the helium dimer in the aug-cc-pVDZ basis set. It is shown to give the correct electronic structure for all bond lengths. Much more testing will be required before the applicability of this method to electron correlation problems of interesting size can be assessed.
We expand upon the recent semi-stochastic adaptation to full configuration interaction quantum Monte Carlo (FCIQMC). We present an alternate method for generating the deterministic space without a priori knowledge of the wave function and present stochastic efficiencies for a variety of both molecular and lattice systems. The algorithmic details of an efficient semi-stochastic implementation are presented, with particular consideration given to the effect that the adaptation has on parallel performance in FCIQMC. We further demonstrate the benefit for calculation of reduced density matrices in FCIQMC through replica sampling, where the semi-stochastic adaptation seems to have even larger efficiency gains. We then combine these ideas to produce explicitly correlated corrected FCIQMC energies for the beryllium dimer, for which stochastic errors on the order of wavenumber accuracy are achievable.
Building on the success of Quantum Monte Carlo techniques such as diffusion Monte Carlo, alternative stochastic approaches to solve electronic structure problems have emerged over the past decade. The full configuration interaction quantum Monte Carlo (FCIQMC) method allows one to systematically approach the exact solution of such problems, for cases where very high accuracy is desired. The introduction of FCIQMC has subsequently led to the development of coupled cluster Monte Carlo (CCMC) and density matrix quantum Monte Carlo (DMQMC), allowing stochastic sampling of the coupled cluster wave function and the exact thermal density matrix, respectively. In this Article, we describe the HANDE-QMC code, an open-source implementation of FCIQMC, CCMC and DMQMC, including initiator and semistochastic adaptations. We describe our code and demonstrate its use on three example systems; a molecule (nitric oxide), a model solid (the uniform electron gas), and a real solid (diamond). An illustrative tutorial is also included.