Selected configuration interaction (SCI) methods are effective for treating strongly correlated electronic systems, yet their scalability has long been limited by implementations that replicate the configuration interaction (CI) vector across processes, leading to severe memory bottlenecks. Here, we present a fully distributed diagonalization framework tailored for extremely large selected determinant spaces, directly addressing this major scalability bottleneck of modern SCI methods. The method is grounded in a tensor-product bitstring (TPB) representation, in which determinants are organized through a TPB structure constructed from selected α- and β-bitstrings, and is referred to as tensor-product bitstring SCI (TBSCI). An efficient TBSCI eigensolver is developed based on a novel bitstring-based Hamiltonian evaluation algorithm together with a suite of MPI communication strategies designed to improve parallel efficiency. Large-scale full configuration interaction (FCI) benchmarks, employed as communication-intensive stress tests, demonstrate that the implemented TBSCI eigensolver continues to reduce the wall time for distributed diagonalization of 2.6 × 1012 determinants, reaching 54 000 nodes (more than 2.5 × 106 cores) on supercomputer Fugaku. Beyond scalability, we investigate the structural compactness of the TPB representation and show that selecting α- and β-bitstrings according to their collective weights in a reference SCI wavefunction yields TPB-based wavefunctions approaching the FCI limit while using only a small fraction of determinants. These results establish TBSCI as a scalable SCI methodology and provide evidence for the intrinsic compactness of the TPB representation.
Selected configuration interaction (SCI) methods are effective for treating strongly correlated electronic systems, yet their scalability has long been limited by implementations that replicate the configuration interaction (CI) vector across processes, leading to severe memory bottlenecks. Here, we present a fully distributed diagonalization framework tailored for extremely large selected determinant spaces, directly addressing this major scalability bottleneck of modern SCI methods. The method is grounded in a tensor-product bitstring (TPB) representation, in which determinants are organized through a TPB structure constructed from selected α- and β-bitstrings, and is referred to as tensor-product bitstring SCI (TBSCI). An efficient TBSCI eigensolver is developed based on a novel bitstring-based Hamiltonian evaluation algorithm together with a suite of MPI communication strategies designed to improve parallel efficiency. Large-scale full configuration interaction (FCI) benchmarks, employed as communication-intensive stress tests, demonstrate that the implemented TBSCI eigensolver continues to reduce the wall time for distributed diagonalization of 2.6 × 1012 determinants, reaching 54 000 nodes (more than 2.5 × 106 cores) on supercomputer Fugaku. Beyond scalability, we investigate the structural compactness of the TPB representation and show that selecting α- and β-bitstrings according to their collective weights in a reference SCI wavefunction yields TPB-based wavefunctions approaching the FCI limit while using only a small fraction of determinants. These results establish TBSCI as a scalable SCI methodology and provide evidence for the intrinsic compactness of the TPB representation.
Selected configuration interaction (SCI) methods are currently enjoying a resurgence due to several recent developments which improve either the overall computational efficiency or the compactness of the resulting SCI vector. These recent advances have made it possible to get full CI (FCI) quality results for much larger orbital active spaces compared to conventional approaches. However, due to the starting assumption that the FCI vector has only a small number of significant Slater determinants, SCI becomes intractable for systems with strong correlation. This paper introduces a method for developing SCI algorithms in a way which exploits local molecular structure to significantly reduce the number of SCI variables. The proposed method is defined by first grouping the orbitals into clusters over which we can define many-particle cluster states. We then directly perform the SCI algorithm in a basis of tensor products of cluster states instead of Slater determinants. While the approach is general for arbitrarily defined cluster states, we find significantly improved performance by defining cluster states through a Tucker decomposition of the global (and sparse) SCI vector. To demonstrate the potential of this method, called tensor product selected configuration interaction (TPSCI), we present numerical results for a diverse set of examples: (1) modified Hubbard model with different inter- and intracluster hopping terms, (2) less obviously clusterable cases of bond breaking in N 2 and F 2, and (3) ground state energies of large planar π-conjugated systems with active spaces of up to 42 electrons in 42 orbitals. These numerical results show that TPSCI can be used to significantly reduce the number of SCI variables in the variational space, thus paving a path for extending these deterministic and variational SCI approaches to a wider range of physical systems.
The task of computing wavefunctions that are accurate, yet simple enough mathematical objects to use for reasoning, has long been a challenge in quantum chemistry. The difficulty in drawing physical conclusions from a wavefunction is often related to the generally large number of configurations with similar weights. In Tensor Product Selected Configuration Interaction (TPSCI), we use a locally correlated tensor product state basis, which has the effect of concentrating the weight of a state onto a smaller number of physically interpretable degrees of freedom. In this paper, we apply TPSCI to a series of three molecular systems ranging in separability, one of which is the first application of TPSCI to an open-shell bimetallic system. For each of these systems, we obtain accurate solutions to large active spaces, and analyze the resulting wavefunctions through a series of different approaches including (i) direct inspection of the TPS basis coefficients, (ii) construction of Bloch effective Hamiltonians, and (iii) computation of cluster correlation functions.
Full configuration interaction (FCI) provides exact electronic structure within a given atomic basis, but its computational cost grows exponentially with the number of spin orbitals. Selected configuration interaction (SCI) methods alleviate this limitation by retaining only the most important Slater determinants. However, the repeated identification of important determinants remains a major computational bottleneck. We present a quantum assisted selected configuration interaction (QASCI) method that combines SCI with graph based block diagonalization (GBBD) of FCI Hamiltonian. The GBBD method partitions FCI Hamiltonian into independent blocks, within which determinant selection problem is formulated as a quadratic unconstrained binary optimization (QUBO) problem. The QUBO problems for selecting determinants to construct SCI space are iteratively solved using a fast annealing approach. We benchmark method on H8-H18 hydrogen chains and Li2S in STO3G basis. For Hn chains, chemical accuracy is achieved while retaining only a small fraction of Slater determinants, and this fraction decreases with increasing n, despite the exponential growth of the FCI Hilbert space. For Li2S, QASCI results remain within chemical accuracy while retaining substantially fewer determinants than the full FCI space. We apply QASCI to N2 using the 631G basis, considering both active orbital and full orbital treatments. The full orbital QASCI calculation, using 50000 determinants, yields a lower ground state energy than an FCI calculation within an active space comprising 12 spin orbitals and 12 electrons. These results demonstrate that the combination of QASCI and the GBBD approach can substantially reduce computational cost of determinant selection while maintaining the accuracy of FCI based electronic structure calculations, thereby enabling accurate calculations in larger orbital spaces.
Recently, a new distributed implementation of the full configuration interaction (FCI) method has been reported [Gao et al. J. Chem Theory Comput. 2024, 20, 1185]. Thanks to a hybrid parallelization scheme, the authors were able to compute the exact energy of propane (\ce{C3H8}) in the minimal basis STO-3G. This formidable task involves handling an active space of 26 electrons in 23 orbitals or a Hilbert space of \SI{1.3d12} determinants. This is, by far, the largest FCI calculation reported to date. Here, we illustrate how, from a general point of view, selected configuration interaction (SCI) can achieve microhartree accuracy at a fraction of the computational and memory cost, via a sparse exploration of the FCI space. The present SCI calculations are performed with the \textit{Configuration Interaction using a Perturbative Selection made Iteratively} (CIPSI) algorithm, as implemented in a determinant-driven way in the \textsc{quantum package} software. The present study reinforces the common wisdom that among the exponentially large number of determinants in the FCI space, only a tiny fraction of them significantly contribute to the energy. More importantly, it demonstrates the feasibility of achieving comparable accuracy using more reasonable and sustainable computational resources, hence reducing the ever-growing carbon footprint of computational chemistry.
Accurate solutions to the electronic Schrödinger equation remain a central challenge in quantum chemistry due to the exponential growth of the many-electron Hilbert space. Selected configuration interaction (SCI) methods mitigate this challenge by restricting the wavefunction expansion to a subset of important determinants, but their efficiency is limited by the quality/cost of determinant selection and Hamiltonian diagonalization. In this work, we propose QUBO-SCI, a novel approach that reformulates the selection step in SCI as a quadratic unconstrained binary optimization (QUBO) problem. This formulation enables the sampling of low-energy electronic configurations as bitstrings using both quantum-inspired approaches and quantum annealing hardware. The sampled configurations are then incorporated into an iterative SCI framework using a perturbative importance criterion. We demonstrate the method on small benchmark systems, including H 2 , C 2 , H 2 O, and N 2 , showing that QUBO-SCI achieves near-FCI accuracy with a significantly reduced number of determinants. The results highlight the potential of annealing-based sampling as an efficient alternative to both conventional determinant selection strategies and circuit-based quantum SCI approaches in electronic structure calculations.
Selected configuration interaction (SCI) obtains accurate many-body solutions by variationally diagonalising the Hamiltonian in a sparse, iteratively selected set of configurations, but can lose compactness when the target state has broad configurational support. We introduce selected stabilizer interaction (SSI), a fully classical, SCI-inspired method that instead iteratively constructs a nonorthogonal subspace spanned by a systematically enlargeable set of selected stabilizer states. A single stabilizer, generated by Clifford operations, can encode a structured superposition of (possibly exponentially) many configurations, shifting the relevant compression from configurational to stabilizer sparsity. We benchmark ground-state energies, fidelities, superposition degrees and required expansion lengths against exact diagonalization and equivalent SCI schemes for the transverse-field Ising, XXZ Heisenberg, and Hubbard models, finding particularly strong compression from the stabilizer representation in the spin models, and increasing advantage with system size for these systems. The results establish a proof of principle for heuristic selected stabilizer diagonalization, while also identifying particular challenges in symmetry handling and effective exploration of the stabilizer space.