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

Subspace Selected Variational Quantum Configuration Interaction with a Partial Walsh Series

Koray Aydoğan, Anna R. Spak, Kade Head-Marsden, Anthony W. Schlimgen

quant-phmath-phSubmitted Jan 11, 2026• Announced Jan 13, 2026• 0 citations• Revised Feb 7, 2026 (v2)
v1 · Jan 11, 2026v2 · Feb 7, 2026v3 · Jul 1, 2026
arXivHTMLPDF

Abstract

Estimating the ground-state energy of a quantum system is one of the most promising applications for quantum algorithms. Here we propose a variational quantum eigensolver (VQE) \emph{Ansatz} for finding ground state configuration interaction (CI) wavefunctions. We map CI for fermions to a quantum circuit using a subspace superposition, then apply diagonal Walsh operators to encode the wavefunction. The algorithm can be used to solve both full CI and selected CI wavefunctions, resuling in exact and near-exact solutions for electronic ground states. Both the subspace selection and wavefunction \emph{Ansatz} can be applied to any Hamiltonian that can be written in a qubit basis. The algorithm bypasses costly classical matrix diagonalizations, which is advantageous for large-scale applications. We demonstrate results for several molecules using quantum simulators and hardware.

Related papers

Quantum-selected configuration interaction: Classical diagonalization of Hamiltonians in subspaces selected by quantum computers

Keita Kanno, Masaya Kohda, Ryosuke Imai +4 more

We propose quantum-selected configuration interaction, a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an approximate ground state can be prepared on a quantum computer either by variational quantum eigensolver or by some other method. Then, by sampling the state in the computational basis, which is hard for classical computation in general, one can identify the electron configurations that are important for reproducing the ground state. The Hamiltonian in the subspace spanned by those important configurations is diagonalized on classical computers to output the ground-state energy and the corresponding eigenvector. The excited-state energies can be obtained similarly. The result is robust against statistical and physical errors because the noisy quantum devices are used only to define the subspace, and the resulting ground-state energy strictly satisfies the variational principle even in the presence of such errors. The expectation values of various other operators can also be estimated for obtained eigenstates with no additional quantum cost, since the explicit eigenvectors in the subspaces are known. We verified our proposal by numerical simulations and demonstrated it on a quantum device for an eight-qubit molecular Hamiltonian. The proposed algorithms are potentially feasible to tackle some challenging molecules by exploiting quantum devices with several tens of qubits, assisted by high-performance classical computing resources for diagonalization.

arXiv:2302.11320•Physical Review Research•May 9, 2026•25 citations

A qubit-efficient variational selected configuration-interaction method

Daniel Yoffe, Noga Entin, Amir Natan +1 more

Abstract Finding the ground-state energy of molecules is an important and challenging computational problem for which quantum computing can potentially find efficient solutions. The variational quantum eigensolver (VQE) is a quantum algorithm that tackles the molecular groundstate problem and is regarded as one of the flagships of quantum computing. Yet, to date, only very small molecules were computed via VQE, due to high noise levels in current quantum devices. Here we present an alternative variational quantum scheme that requires significantly less qubits than VQE. The reduction in the qubit number allows for shallower circuits to be sufficient, rendering the method more resistant to noise. The proposed algorithm, termed variational quantum selected-configuration-interaction (VQ-SCI), is based on: (a) representing the target groundstate as a superposition of Slater determinant configurations, encoded directly upon the quantum computational basis states; and (b) selecting a-priory only the most dominant configurations. This is demonstrated through a set of groundstate calculations of the H2, LiH, BeH2, H2O, NH3 and C2H4 molecules in the sto-3g basis set, performed on IBM quantum devices. We show that the VQ-SCI reaches the full configuration interaction energy within chemical accuracy using the lowest number of qubits reported to date. Moreover, when the SCI matrix is generated ‘on the fly’, the VQ-SCI requires exponentially less memory than classical SCI methods. This offers a potential remedy to a severe memory bottleneck problem in classical SCI calculations. Finally, the proposed scheme is general and can be straightforwardly applied for finding the groundstate of any Hermitian matrix, outside the chemical context.

arXiv:2302.06691•Quantum Science and Technology•Sep 19, 2024•5 citations

A non-orthogonal variational quantum eigensolver

William J. Huggins, Joonho Lee, Unpil Baek +2 more

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H 4 and the π -system of hexatriene (C 6 H 8 ).

arXiv:1909.09114•New Journal of Physics•Apr 3, 2020•148 citations

A non-orthogonal variational quantum eigensolver

Huggins, WJ, Lee, J, Baek, U +2 more

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

•Jul 1, 2020•128 citations

Auto-regressive Neural Quantum State Sampling for Selected Configuration Interaction

Shane Thompson, Daniel Gunlycke

Accurate ground-state energy calculations remain a central challenge in quantum chemistry due to the exponential scaling of the many-body Hilbert space. Variational Monte Carlo and variational quantum eigensolvers offer promising ansatz optimization approaches but face limitations in convergence as well as hardware constraints. We introduce a particular Selected Configuration Interaction (SCI) algorithm that uses auto-regressive neural networks (ARNNs) to guide subspace expansion for ground-state search. Leveraging the unique properties of ARNNs, our algorithm efficiently constructs compact variational subspaces from learned ground-state statistics, which in turn accelerates convergence to the ground-state energy. Benchmarks on molecular systems demonstrate that ARNN-guided subspace expansion combines the strengths of neural-network representations and classical subspace methods, providing a scalable framework for classical and hybrid quantum-classical algorithms.

quant-pharXiv:2603.24728•Mar 27, 2026•0 citations

Molecular Ground-State Energy Estimation Using VQE

Enoth Kumar N, Irene S, Vinod Jani +2 more

Classical simulation of molecular electronic structure is often limited by the rapid increase in computational cost associated with describing electron correlation. The Variational Quantum Eigensolver (VQE) is one hybrid quantum-classical approach ideally adapted to the Noisy Intermediate-Scale Quantum (NISQ) regime. This work applies the VQE algorithm to compute ground state energies of a set of molecules:$\mathrm{H}_{2}, \mathrm{H}_{3}^{+}, \text{LiH}, \text{HF}, \text{OH}^{-}, \mathrm{H}_{2} \mathrm{O}, \text{BH}_{3}, \text{CH}_{4}$, and$\text{NH}_{3}$. The approach utilizes the Unitary Coupled Cluster for Single and Double excitations (UCCSD) ansatz along with the Bravyi-Kitaev transformation for fermionic-to-qubit encoding. Quantum simulation outputs are systematically benchmarked against Full Configuration Interaction (FCI), a numerically exact traditional approach, and Unrestricted Hartree-Fock (UHF). The results establish a robust consistency of the VQE-obtained molecular ground state energies against standard FCI and UHF benchmarks. This research provides a critical benchmark, confirming that VQE has the capability for high-precision molecular simulations and playing the role of a pivotal stepping stone toward revolutionizing applications in drug discovery and materials science.

IEEE Pune Section International Conference (PuneCon)•Dec 12, 2025•0 citations
Estimating the ground-state energy of a quantum system is one of the most promising applications for quantum algorithms. Here we propose a variational quantum eigensolver (VQE) \emph{Ansatz} for finding ground state configuration interaction (CI) wavefunctions. We map CI for fermions to a quantum circuit using a subspace superposition, then apply diagonal Walsh operators to encode the wavefunction. The algorithm can be used to solve both full CI and selected CI wavefunctions, resuling in exact and near-exact solutions for electronic ground states. Both the subspace selection and wavefunction \emph{Ansatz} can be applied to any Hamiltonian that can be written in a qubit basis. The algorithm bypasses costly classical matrix diagonalizations, which is advantageous for large-scale applications. We demonstrate results for several molecules using quantum simulators and hardware.
We propose quantum-selected configuration interaction, a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an approximate ground state can be prepared on a quantum computer either by variational quantum eigensolver or by some other method. Then, by sampling the state in the computational basis, which is hard for classical computation in general, one can identify the electron configurations that are important for reproducing the ground state. The Hamiltonian in the subspace spanned by those important configurations is diagonalized on classical computers to output the ground-state energy and the corresponding eigenvector. The excited-state energies can be obtained similarly. The result is robust against statistical and physical errors because the noisy quantum devices are used only to define the subspace, and the resulting ground-state energy strictly satisfies the variational principle even in the presence of such errors. The expectation values of various other operators can also be estimated for obtained eigenstates with no additional quantum cost, since the explicit eigenvectors in the subspaces are known. We verified our proposal by numerical simulations and demonstrated it on a quantum device for an eight-qubit molecular Hamiltonian. The proposed algorithms are potentially feasible to tackle some challenging molecules by exploiting quantum devices with several tens of qubits, assisted by high-performance classical computing resources for diagonalization.
Abstract Finding the ground-state energy of molecules is an important and challenging computational problem for which quantum computing can potentially find efficient solutions. The variational quantum eigensolver (VQE) is a quantum algorithm that tackles the molecular groundstate problem and is regarded as one of the flagships of quantum computing. Yet, to date, only very small molecules were computed via VQE, due to high noise levels in current quantum devices. Here we present an alternative variational quantum scheme that requires significantly less qubits than VQE. The reduction in the qubit number allows for shallower circuits to be sufficient, rendering the method more resistant to noise. The proposed algorithm, termed variational quantum selected-configuration-interaction (VQ-SCI), is based on: (a) representing the target groundstate as a superposition of Slater determinant configurations, encoded directly upon the quantum computational basis states; and (b) selecting a-priory only the most dominant configurations. This is demonstrated through a set of groundstate calculations of the H2, LiH, BeH2, H2O, NH3 and C2H4 molecules in the sto-3g basis set, performed on IBM quantum devices. We show that the VQ-SCI reaches the full configuration interaction energy within chemical accuracy using the lowest number of qubits reported to date. Moreover, when the SCI matrix is generated ‘on the fly’, the VQ-SCI requires exponentially less memory than classical SCI methods. This offers a potential remedy to a severe memory bottleneck problem in classical SCI calculations. Finally, the proposed scheme is general and can be straightforwardly applied for finding the groundstate of any Hermitian matrix, outside the chemical context.
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H 4 and the π -system of hexatriene (C 6 H 8 ).
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).
Accurate ground-state energy calculations remain a central challenge in quantum chemistry due to the exponential scaling of the many-body Hilbert space. Variational Monte Carlo and variational quantum eigensolvers offer promising ansatz optimization approaches but face limitations in convergence as well as hardware constraints. We introduce a particular Selected Configuration Interaction (SCI) algorithm that uses auto-regressive neural networks (ARNNs) to guide subspace expansion for ground-state search. Leveraging the unique properties of ARNNs, our algorithm efficiently constructs compact variational subspaces from learned ground-state statistics, which in turn accelerates convergence to the ground-state energy. Benchmarks on molecular systems demonstrate that ARNN-guided subspace expansion combines the strengths of neural-network representations and classical subspace methods, providing a scalable framework for classical and hybrid quantum-classical algorithms.
Classical simulation of molecular electronic structure is often limited by the rapid increase in computational cost associated with describing electron correlation. The Variational Quantum Eigensolver (VQE) is one hybrid quantum-classical approach ideally adapted to the Noisy Intermediate-Scale Quantum (NISQ) regime. This work applies the VQE algorithm to compute ground state energies of a set of molecules:H2,H3+,LiH,HF,OH−,H2O,BH3,CH4\mathrm{H}_{2}, \mathrm{H}_{3}^{+}, \text{LiH}, \text{HF}, \text{OH}^{-}, \mathrm{H}_{2} \mathrm{O}, \text{BH}_{3}, \text{CH}_{4}H2​,H3+​,LiH,HF,OH−,H2​O,BH3​,CH4​, andNH3\text{NH}_{3}NH3​. The approach utilizes the Unitary Coupled Cluster for Single and Double excitations (UCCSD) ansatz along with the Bravyi-Kitaev transformation for fermionic-to-qubit encoding. Quantum simulation outputs are systematically benchmarked against Full Configuration Interaction (FCI), a numerically exact traditional approach, and Unrestricted Hartree-Fock (UHF). The results establish a robust consistency of the VQE-obtained molecular ground state energies against standard FCI and UHF benchmarks. This research provides a critical benchmark, confirming that VQE has the capability for high-precision molecular simulations and playing the role of a pivotal stepping stone toward revolutionizing applications in drug discovery and materials science.