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:2303.05688 · The Journal of Chemical Physics

A parallel, distributed memory implementation of the adaptive sampling configuration interaction method

David B. Williams‐Young, Norm M. Tubman, Carlos Mejuto-Zaera, Wibe Albert de Jong

Published Jun 1, 2023• 15 citations
arXivHTMLPDF

Abstract

The many-body simulation of quantum systems is an active field of research that involves several different methods targeting various computing platforms. Many methods commonly employed, particularly coupled cluster methods, have been adapted to leverage the latest advances in modern high-performance computing. Selected configuration interaction (sCI) methods have seen extensive usage and development in recent years. However, the development of sCI methods targeting massively parallel resources has been explored only in a few research works. Here, we present a parallel, distributed memory implementation of the adaptive sampling configuration interaction approach (ASCI) for sCI. In particular, we will address the key concerns pertaining to the parallelization of the determinant search and selection, Hamiltonian formation, and the variational eigenvalue calculation for the ASCI method. Load balancing in the search step is achieved through the application of memory-efficient determinant constraints originally developed for the ASCI-PT2 method. The presented benchmarks demonstrate near optimal speedup for ASCI calculations of Cr2 (24e, 30o) with 106, 107, and 3 × 108 variational determinants on up to 16 384 CPUs. To the best of the authors' knowledge, this is the largest variational ASCI calculation to date.

DOI
10.1063/5.0148650

Related papers

Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method

Norm M. Tubman, C. Daniel Freeman, Daniel S. Levine +3 more

Abstract Recent advances in selected configuration interaction methods have made them competitive with the most accurate techniques available and, hence, creating an increasingly powerful tool for solving quantum Hamiltonians. In this work, we build on recent advances from the adaptive sampling configuration interaction (ASCI) algorithm. We show that a useful paradigm for generating efficient selected CI/exact diagonalization algorithms is driven by fast sorting algorithms, much in the same way iterative diagonalization is based on the paradigm of matrix vector multiplication. We present several new algorithms for all parts of performing a selected CI, which includes new ASCI search, dynamic bit masking, fast orbital rotations, fast diagonal matrix elements, and residue arrays. The ASCI search algorithm can be used in several different modes, which includes an integral driven search and a coefficient driven search. The algorithms presented here are fast and scalable, and we find that because they are built on fast sorting algorithms they are more efficient than all other approaches we considered. After introducing these techniques, we present ASCI results applied to a large range of systems and basis sets to demonstrate the types of simulations that can be practically treated at the full-CI level with modern methods and hardware, presenting double- and triple-ζ benchmark data for the G1 data set. The largest of these calculations is Si2H6 which is a simulation of 34 electrons in 152 orbitals. We also present some preliminary results for fast deterministic perturbation theory simulations that use hash functions to maintain high efficiency for treating large basis sets.

arXiv:1807.00821•Journal of Chemical Theory and Computation•Mar 11, 2020•193 citations

An efficient deterministic perturbation theory for selected configuration interaction methods

Norm M. Tubman, Daniel S. Levine, Diptarka Hait +2 more

The interplay between advances in stochastic and deterministic algorithms has recently led to development of interesting new selected configuration interaction (SCI) methods for solving the many body Schrödinger equation. The performance of these SCI methods can be greatly improved with a second order perturbation theory (PT2) correction, which is often evaluated in a stochastic or hybrid-stochastic manner. In this work, we present a highly efficient, fully deterministic PT2 algorithm for SCI methods and demonstrate that our approach is orders of magnitude faster than recent proposals for stochastic SCI+PT2. We also show that it is important to have a compact reference SCI wave function, in order to obtain optimal SCI+PT2 energies. This indicates that it advantageous to use accurate search algorithms such as 'ASCI search' rather than more approximate approaches. Our deterministic PT2 algorithm is based on sorting techniques that have been developed for modern computing architectures and is inherently straightforward to use on parallel computing architectures. Related architectures such as GPU implementations can be also used to further increase the efficiency. Overall, we demonstrate that the algorithms presented in this work allow for efficient evaluation of trillions of PT2 contributions with modest computing resources.

arXiv:1808.02049•Aug 6, 2018•39 citations

Many-Body Adaptive Configuration Interaction Suite (MACIS) v0.1.0

David B. Williams‐Young, Wibe Albert de Jong, Carlos Mejuto-Zaera

The Many-Body Adaptive Configuration Interaction Suite (MACIS) is a modern C++ software infrastructure for the development of selected-configuration interaction (sCI) methods for the fermionic many-body problem in quantum chemistry and materials science. MACIS provides a high-performance, parallel implementation of the Adaptive Sampling Configuration Interaction (ASCI) method as related solvers such as self-consistent orbital optimization and the evaluation of excited states and spectral functions. Unlike existing sCI software, MACIS is developed as a modular software infrastructure which allows it to exist both as a standalone sCI solver and as a library to integrate into existing many-body codes. This modularity allows MACIS to be quickly extensible, including its integration with other sCI methods and high-performance solvers.

•Jan 1, 2023•0 citations

Dynamical mean field theory simulations with the adaptive sampling configuration interaction method

Carlos Mejuto-Zaera, Norm M. Tubman, K. Birgitta Whaley

In the pursuit of accurate descriptions of strongly correlated quantum many-body systems, dynamical mean field theory (DMFT) has been an invaluable tool for elucidating the spectral properties and quantum phases of both phenomenological models and ab initio descriptions of real materials. Key to the DMFT process is the self-consistent map of the original system into an Anderson impurity model, the ground state of which is computed using an impurity solver. The power of the method is thus limited by the complexity of the impurity model the solver can handle. Simulating realistic systems generally requires many correlated sites. By adapting the recently proposed adaptive sampling configuration interaction (ASCI) method as an impurity solver, we enable much more efficient zero-temperature DMFT simulations. The key feature of the ASCI method is that it selects only the most relevant Hilbert space degrees of freedom to describe the ground state. This reduces the numerical complexity of the calculation, which will allow us to pursue future DMFT simulations with more correlated impurity sites than in previous works. Here, we present the ASCI-DMFT method and example calculations on the one- and two-dimensional Hubbard models that exemplify its efficient convergence and timing properties. We show that the ASCI approach is several orders of magnitude faster than the current best published ground-state DMFT simulations, which allows us to study the bath discretization error in simulations with small clusters, as well as to address cluster sizes beyond the current state of the art. Our approach can also be adapted for other embedding methods such as density matrix embedding theory and self-energy embedding theory.

arXiv:1711.04771•Physical review. B./Physical review. B•Sep 30, 2019•31 citations

Next Generation Dynamical Mean-Field Theory Simulations with the Adaptive Sampling Configuration Interaction Method

Carlos Mejuto-Zaera, Norm M. Tubman, K. Birgitta Whaley

In the pursuit of accurate descriptions of strongly correlated quantum many-body systems, dynamical mean field theory (DMFT) has been an invaluable tool for elucidating the spectral properties and quantum phases of both phenomenological models and ab initio descriptions of real materials. Key to the DMFT process is the self-consistent map of the original system into an Anderson impurity model, the ground state of which is computed using an impurity solver. The power of the method is thus limited by the complexity of the impurity model the solver can handle. Simulating realistic systems generally requires many correlated sites. By adapting the recently proposed adaptive sampling configuration interaction (ASCI) method as an impurity solver, we enable much more efficient zero temperature DMFT simulations. The key feature of the ASCI method is that it selects only the most relevant Hilbert space degrees of freedom to describe the ground state. This reduces the numerical complexity of the calculation, which will allow us to pursue future DMFT simulations with more correlated impurity sites than in previous works. In this Letter, we present the ASCI-DMFT method and use the one- and two-dimensional Hubbard models to exemplify its efficient convergence and timing properties. We show that the ASCI approach is several orders of magnitude faster than the current best published ground state DMFT simulations. Our approach can also be adapted for other embedding methods such as density matrix embedding theory and self-energy embedding theory.

•Nov 13, 2017•1 citation

Quantum Package 2.0: An Open-Source Determinant-Driven Suite of Programs

Yann Garniron, Thomas Applencourt, Kevin E. Gasperich +16 more

, where N is proportional to the system size. Therefore, performing accurate calculations on chemically meaningful systems requires (i) approximations that can lower the computational scaling and (ii) efficient implementations that take advantage of modern massively parallel architectures. Quantum Package is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multireference second-order perturbation theory (PT2). The determinant-driven framework allows the programmer to include any arbitrary set of determinants in the reference space, hence providing greater methodological freedom. The sCI method implemented in Quantum Package is based on the CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively) algorithm which complements the variational sCI energy with a PT2 correction. Additional external plugins have been recently added to perform calculations with multireference coupled cluster theory and range-separated density-functional theory. All the programs are developed with the IRPF90 code generator, which simplifies collaborative work and the development of new features. Quantum Package strives to allow easy implementation and experimentation of new methods, while making parallel computation as simple and efficient as possible on modern supercomputer architectures. Currently, the code enables, routinely, to realize runs on roughly 2 000 CPU cores, with tens of millions of determinants in the reference space. Moreover, we have been able to push up to 12 288 cores in order to test its parallel efficiency. In the present manuscript, we also introduce some key new developments: (i) a renormalized second-order perturbative correction for efficient extrapolation to the full CI limit and (ii) a stochastic version of the CIPSI selection performed simultaneously to the PT2 calculation at no extra cost.

arXiv:1902.08154•Journal of Chemical Theory and Computation•May 13, 2019•171 citations
The many-body simulation of quantum systems is an active field of research that involves several different methods targeting various computing platforms. Many methods commonly employed, particularly coupled cluster methods, have been adapted to leverage the latest advances in modern high-performance computing. Selected configuration interaction (sCI) methods have seen extensive usage and development in recent years. However, the development of sCI methods targeting massively parallel resources has been explored only in a few research works. Here, we present a parallel, distributed memory implementation of the adaptive sampling configuration interaction approach (ASCI) for sCI. In particular, we will address the key concerns pertaining to the parallelization of the determinant search and selection, Hamiltonian formation, and the variational eigenvalue calculation for the ASCI method. Load balancing in the search step is achieved through the application of memory-efficient determinant constraints originally developed for the ASCI-PT2 method. The presented benchmarks demonstrate near optimal speedup for ASCI calculations of Cr2 (24e, 30o) with 106, 107, and 3 × 108 variational determinants on up to 16 384 CPUs. To the best of the authors' knowledge, this is the largest variational ASCI calculation to date.
Abstract Recent advances in selected configuration interaction methods have made them competitive with the most accurate techniques available and, hence, creating an increasingly powerful tool for solving quantum Hamiltonians. In this work, we build on recent advances from the adaptive sampling configuration interaction (ASCI) algorithm. We show that a useful paradigm for generating efficient selected CI/exact diagonalization algorithms is driven by fast sorting algorithms, much in the same way iterative diagonalization is based on the paradigm of matrix vector multiplication. We present several new algorithms for all parts of performing a selected CI, which includes new ASCI search, dynamic bit masking, fast orbital rotations, fast diagonal matrix elements, and residue arrays. The ASCI search algorithm can be used in several different modes, which includes an integral driven search and a coefficient driven search. The algorithms presented here are fast and scalable, and we find that because they are built on fast sorting algorithms they are more efficient than all other approaches we considered. After introducing these techniques, we present ASCI results applied to a large range of systems and basis sets to demonstrate the types of simulations that can be practically treated at the full-CI level with modern methods and hardware, presenting double- and triple-ζ benchmark data for the G1 data set. The largest of these calculations is Si2H6 which is a simulation of 34 electrons in 152 orbitals. We also present some preliminary results for fast deterministic perturbation theory simulations that use hash functions to maintain high efficiency for treating large basis sets.
The interplay between advances in stochastic and deterministic algorithms has recently led to development of interesting new selected configuration interaction (SCI) methods for solving the many body Schrödinger equation. The performance of these SCI methods can be greatly improved with a second order perturbation theory (PT2) correction, which is often evaluated in a stochastic or hybrid-stochastic manner. In this work, we present a highly efficient, fully deterministic PT2 algorithm for SCI methods and demonstrate that our approach is orders of magnitude faster than recent proposals for stochastic SCI+PT2. We also show that it is important to have a compact reference SCI wave function, in order to obtain optimal SCI+PT2 energies. This indicates that it advantageous to use accurate search algorithms such as 'ASCI search' rather than more approximate approaches. Our deterministic PT2 algorithm is based on sorting techniques that have been developed for modern computing architectures and is inherently straightforward to use on parallel computing architectures. Related architectures such as GPU implementations can be also used to further increase the efficiency. Overall, we demonstrate that the algorithms presented in this work allow for efficient evaluation of trillions of PT2 contributions with modest computing resources.
The Many-Body Adaptive Configuration Interaction Suite (MACIS) is a modern C++ software infrastructure for the development of selected-configuration interaction (sCI) methods for the fermionic many-body problem in quantum chemistry and materials science. MACIS provides a high-performance, parallel implementation of the Adaptive Sampling Configuration Interaction (ASCI) method as related solvers such as self-consistent orbital optimization and the evaluation of excited states and spectral functions. Unlike existing sCI software, MACIS is developed as a modular software infrastructure which allows it to exist both as a standalone sCI solver and as a library to integrate into existing many-body codes. This modularity allows MACIS to be quickly extensible, including its integration with other sCI methods and high-performance solvers.
In the pursuit of accurate descriptions of strongly correlated quantum many-body systems, dynamical mean field theory (DMFT) has been an invaluable tool for elucidating the spectral properties and quantum phases of both phenomenological models and ab initio descriptions of real materials. Key to the DMFT process is the self-consistent map of the original system into an Anderson impurity model, the ground state of which is computed using an impurity solver. The power of the method is thus limited by the complexity of the impurity model the solver can handle. Simulating realistic systems generally requires many correlated sites. By adapting the recently proposed adaptive sampling configuration interaction (ASCI) method as an impurity solver, we enable much more efficient zero-temperature DMFT simulations. The key feature of the ASCI method is that it selects only the most relevant Hilbert space degrees of freedom to describe the ground state. This reduces the numerical complexity of the calculation, which will allow us to pursue future DMFT simulations with more correlated impurity sites than in previous works. Here, we present the ASCI-DMFT method and example calculations on the one- and two-dimensional Hubbard models that exemplify its efficient convergence and timing properties. We show that the ASCI approach is several orders of magnitude faster than the current best published ground-state DMFT simulations, which allows us to study the bath discretization error in simulations with small clusters, as well as to address cluster sizes beyond the current state of the art. Our approach can also be adapted for other embedding methods such as density matrix embedding theory and self-energy embedding theory.
In the pursuit of accurate descriptions of strongly correlated quantum many-body systems, dynamical mean field theory (DMFT) has been an invaluable tool for elucidating the spectral properties and quantum phases of both phenomenological models and ab initio descriptions of real materials. Key to the DMFT process is the self-consistent map of the original system into an Anderson impurity model, the ground state of which is computed using an impurity solver. The power of the method is thus limited by the complexity of the impurity model the solver can handle. Simulating realistic systems generally requires many correlated sites. By adapting the recently proposed adaptive sampling configuration interaction (ASCI) method as an impurity solver, we enable much more efficient zero temperature DMFT simulations. The key feature of the ASCI method is that it selects only the most relevant Hilbert space degrees of freedom to describe the ground state. This reduces the numerical complexity of the calculation, which will allow us to pursue future DMFT simulations with more correlated impurity sites than in previous works. In this Letter, we present the ASCI-DMFT method and use the one- and two-dimensional Hubbard models to exemplify its efficient convergence and timing properties. We show that the ASCI approach is several orders of magnitude faster than the current best published ground state DMFT simulations. Our approach can also be adapted for other embedding methods such as density matrix embedding theory and self-energy embedding theory.
, where N is proportional to the system size. Therefore, performing accurate calculations on chemically meaningful systems requires (i) approximations that can lower the computational scaling and (ii) efficient implementations that take advantage of modern massively parallel architectures. Quantum Package is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multireference second-order perturbation theory (PT2). The determinant-driven framework allows the programmer to include any arbitrary set of determinants in the reference space, hence providing greater methodological freedom. The sCI method implemented in Quantum Package is based on the CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively) algorithm which complements the variational sCI energy with a PT2 correction. Additional external plugins have been recently added to perform calculations with multireference coupled cluster theory and range-separated density-functional theory. All the programs are developed with the IRPF90 code generator, which simplifies collaborative work and the development of new features. Quantum Package strives to allow easy implementation and experimentation of new methods, while making parallel computation as simple and efficient as possible on modern supercomputer architectures. Currently, the code enables, routinely, to realize runs on roughly 2 000 CPU cores, with tens of millions of determinants in the reference space. Moreover, we have been able to push up to 12 288 cores in order to test its parallel efficiency. In the present manuscript, we also introduce some key new developments: (i) a renormalized second-order perturbative correction for efficient extrapolation to the full CI limit and (ii) a stochastic version of the CIPSI selection performed simultaneously to the PT2 calculation at no extra cost.