Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers
read the original abstract
We propose quantum-selected configuration interaction (QSCI), 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 8-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.
This paper has not been read by Pith yet.
Forward citations
Cited by 22 Pith papers
-
Polynomial-time exact diagonalization via sparse guided eigenwalks
Introduces the eigenwalk problem and proves a linear-diameter support-localization theorem for sparse eigenvectors, yielding poly(n)-time classical exact diagonalization for O(1)-sparse extremal eigenvectors of poly(n...
-
Generative Quantum-inspired Kolmogorov-Arnold Eigensolver
GQKAE uses quantum-inspired Kolmogorov-Arnold networks to reduce parameters by 66% in generative quantum eigensolvers while achieving chemical accuracy on H4, N2, LiH, and other molecules.
-
Divide-and-Conquer Neural Network Surrogates for Quantum Sampling: Accelerating Markov Chain Monte Carlo in Large-Scale Constrained Optimization Problems
Divide-and-conquer QAOA samples and Hamming-weight-conditioned neural network surrogates accelerate MCMC mixing for constrained Ising problems by average factors of 20.3 and 7.6 over classical pair-flip baselines.
-
Cluster-Adaptive Sample-Based Quantum Diagonalization for Strongly Correlated Systems
CSQD improves SQD energy estimates in strongly correlated systems by replacing a global reference occupancy vector with cluster-specific ones, lowering energies by up to 15.95 mHa for stretched N2 and 57.82 mHa for [2Fe-2S].
-
An Iterative Dual-Channel Neural Quantum State Algorithm for Selected Configuration Interaction
HI-NQS uses a dual-channel autoregressive Transformer NQS inside an iterative sample-diagonalize-update loop to reach chemical accuracy on small molecules and nitrogen active spaces with better determinant scaling than CIPSI.
-
Absorbing Many-Body Correlations into Core-Optimized Orbitals
COO co-optimizes orbitals with TrimCI to absorb many-body correlations into the basis, cutting determinant count by orders of magnitude for iron-sulfur clusters versus localized bases or DMRG.
-
Practical Log-Depth Quantum State Preparation and Circuit Verification via Tree Tensor Network Compilation
A tree tensor network renormalization decomposes matrix product states into log-depth quantum circuits with a fidelity-depth trade-off parameter, extended to matrix product operators for ancilla-free overlap verificat...
-
Sample-Based Quantum Diagonalization with Amplitude Amplification
SQD-AA reduces total query complexity by more than 100x on model distributions and achieves the lowest T-gate counts with 3-4 orders shallower circuits than iQPE for molecular examples.
-
Generative Circuit Design for Quantum-Selected Configuration Interaction
A Transformer policy optimizes quantum circuit ansatzes for QSCI, yielding up to 98% reduction in two-qubit gates while reaching chemical accuracy on N2 and competitive compactness with classical methods.
-
Tensor-based phase difference estimation on time series analysis
Tensor-network compression of nearest-neighbor circuits plus four-type measurements yields 0.4-4.7% error on 8-qubit Hubbard energy gaps and enables QPE-type runs on IBM devices up to 52 qubits with over 4000 two-qubit gates.
-
Excited state preparation on a quantum computer through adiabatic light-matter coupling
Adiabatic electron-photon coupling prepares high-fidelity first bright excited states on quantum hardware for the Hubbard model, methylene, and a model Hamiltonian.
-
Quantum Simulation of Ligand-like Molecules through Sample-based Quantum Diagonalization in Density Matrix Embedding Framework
DMET combined with SQD on IBM Eagle hardware achieves chemical accuracy for ground-state energies of low-symmetry ligand-like molecules.
-
Moments-based quantum computation of the electric dipole moment of molecular systems
Quantum computed moments method on IBM hardware estimates water dipole moment to 0.03 debye of FCI, outperforming VQE by factor of two in error.
-
Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
A QSCI variant using stochastic quantum time evolution selects compact configuration subspaces for SiH4 energies, achieving over 200x reduction versus conventional SCI at large separations while matching Heatbath CI c...
-
ffsim: Faster simulation of fermionic quantum circuits
ffsim is a new open-source library that accelerates fermionic quantum circuit simulation by using particle number and spin symmetries to cut memory and runtime, outperforming FQE on benchmarks up to 64 qubits.
-
A Critical Assessment of the Sample-Based Quantum Diagonalization for Heisenberg and Hubbard Models
SQD needs an exponentially increasing number of computational-basis configurations to approximate ground-state energies of Heisenberg and Hubbard models within fixed accuracy, even when configurations are chosen optim...
-
Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
-
Quantum-centric simulation of hydrogen abstraction by sample-based quantum diagonalization and entanglement forging
Demonstrates combined entanglement forging and sample-based quantum diagonalization on superconducting hardware to calculate energies for hydrogen abstraction in 2,2-diphenyldipropane across active spaces up to 39 ele...
-
Quantum-Classical Embedding via Ghost Gutzwiller Approximation for Enhanced Simulations of Correlated Electron Systems
Introduces ghost Gutzwiller quantum embedding for ground-state and spectral simulations of correlated electrons on quantum devices, tested on the infinite-dimensional Hubbard model with error mitigation.
-
Noise and Configuration Recovery Impact on Quantum Selected Configuration Interaction
Noise in LUCJ sampling for QSCI on N2 expands the configuration space beyond the ideal ansatz and, when paired with recovery, produces more accurate CI energies than noiseless sampling.
-
Practical HPCQC Integration with QDMI: A Real-Hardware Case Study with IQM Systems
A QDMI-based adapter for IQM quantum hardware enables reusable integration with Slurm and Qiskit in HPC centers, with open-source code provided.
-
Accelerating Quantum Eigensolver Algorithms With Machine Learning
XGBoost models trained on ≤16-qubit data predict eigensolver hyperparameters and reduce error by 0.12% on 28-qubit systems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.