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

Machine-Learned Compact Subspace Generation for Quantum Selected Configuration Interaction within Density Matrix Embedding Framework

Ashish Kumar Patra, Anurag K. S. V., Ruchika Bhat, Sai Shankar P., Rahul Maitra, Jaiganesh G

quant-phcs.ETcs.LGphysics.chem-phq-bio.BMSubmitted Jul 22, 2026• Announced Jul 23, 2026• 4 citations• Revised Oct 31, 2026 (v2)
v1 · Jul 22, 2026v2 · Oct 31, 2026
arXivHTMLPDF

Abstract

Sample-based quantum diagonalization (SQD), an extension of quantum selected configuration interaction (QSCI), is a promising hybrid quantum-classical paradigm for molecular ground-state energies. By replacing variational optimization with quantum sampling, QSCI avoids barren plateaus and directly reconstructs correlated wavefunctions. However, existing configuration recovery mainly enforces symmetry constraints without targeting the most physically relevant configurations, often yielding oversized subspaces and costly classical diagonalization. We introduce QSCI-RBM, a compact subspace generation protocol based on Restricted Boltzmann Machines (RBMs), and integrate it within Density Matrix Embedding Theory (DMET). The RBM learns the distribution of dominant determinants from hardware samples, generating high-probability configurations. Sampling was performed on IBM Heron R1 (\texttt{ibm\_torino}) for CH$_5$NO, R2 (\texttt{ibm\_fez}) for C$_2$H$_4$, and R3 (\texttt{ibm\_boston}) for the larger H$_2$O benchmark and the protein-ligand system. After validating on these benchmarks of increasing active-space size, we simulate the inhibitor Carmofur bound to the SARS-CoV-2 main protease (M\textsuperscript{pro}), fragmented into ten DMET impurities. Both DMET-QSCI-RBM and a DMET-SQD baseline reach chemical-potential self-consistency within four $μ$-iterations. At the converged chemical potential, DMET-QSCI-RBM lies within $0.05\,\mathrm{mHa}$ of DMET-FCI while accessing on average only $0.22\%$ of the symmetry-preserving configuration space, versus $0.55\,\mathrm{mHa}$ at $33.0\%$ for DMET-SQD, leading to a $\sim$153-fold subspace reduction. RBM-assisted expansion thus yields far more compact hardware-derived determinant spaces at equal or better accuracy, reducing classical overhead for scalable quantum embedding of biological systems on real hardware.

Comments
34 pages, 16 figures

Related papers

Quantum Simulation of Ligand-like Molecules through Sample-based Quantum Diagonalization in Density Matrix Embedding Framework

Ashish Kumar Patra, Anurag K. S. V., Sai Shankar P. +4 more

The accurate treatment of electron correlation in extended molecular systems remains computationally challenging using classical electronic structure methods. Hybrid quantum-classical algorithms offer a potential route to overcome these limitations; however, their practical deployment on existing quantum computers requires strategies that both reduce problem size and mitigate hardware noise. In this work, we investigate ground-state energy calculations of ligand-like molecules using Sample-based Quantum Diagonalization (SQD) within the Density Matrix Embedding Theory (DMET) framework, focusing on low-symmetry systems with diverse bonding motifs that exhibit subsystem-dependent variations in fragment-environment entanglement. These entanglement-based variations directly influence bath orbital construction, impurity sizes, and the structure of the embedded Hamiltonians, posing nontrivial challenges for both embedding and quantum sampling. By combining DMET fragmentation with SQD-based construction of reduced configuration spaces through quantum sampling and iterative configuration recovery, we perform quantum simulations on IBM's Eagle R3 (IBM Sherbrooke) and IBM's Heron R3 (IBM Boston) superconducting quantum hardware thereby, showing that the entanglement structure across embedding subsystems plays a central role in determining the efficiency and accuracy of the simulations. Despite these complexities, we show that the DMET-SQD framework yields ground-state energies in strong agreement with DMET-FCI benchmarks, achieving chemical accuracy (1 kcal/mol) across all systems studied. These results demonstrate that SQD-based quantum simulations can be robustly extended to low-symmetry, chemically realistic, industry relevant molecules, and highlight the importance of entanglement-aware embedding strategies for scalable quantum electronic structure calculations.

quant-pharXiv:2511.22158•The Journal of Chemical Physics•Nov 28, 2025•12 citations

Bridging the NISQ and Fault-Tolerant Regimes: Generative-ML-Assisted Quantum Selected CI for Molecular Simulations

Anurag K. S. V.

Calculation of binding energies for protein-ligand molecular systems requires accurate treatment of the electronic structure, a quantum chemistry problem that scales exponentially on classical hardware, while current quantum hardware remains too noisy for the required circuit depths. This report presents a hybrid quantum-classical workflow performed on the Fujitsu FX700 ideal state-vector simulator using QARP that addresses two structural inefficiencies in quantum-sampling-based diagonalization workflows. First, we integrate the Linear Scaling CNOT UCCSD (LCNot-UCCSD) ansatz into the QSCI framework, replacing the $\mathcal{O}(N^6)$ CCSD parameter initialization of the competing LUCJ ansatz approach with $\mathcal{O}(N^4)$ MP2-amplitude initialization. Second, we introduce QSCI-RBM, a variant that replaces the configuration recovery of the SQD framework with a Restricted Boltzmann Machine (RBM) acting as a compact generative subspace expansion model. Both are evaluated on eight different molecules in STO-3G across 14 controlled artificial error levels with 100 independent runs each, validated on potential energy surface scans of the N$_2$ molecule in cc-pVDZ, and embedded within DMET to treat the FDA-approved antiviral Amantadine (C$_{10}$H$_{17}$N, 11 DMET fragments) and the active region of the SARS-CoV-2 main protease complexed with its covalent inhibitor Carmofur (PDB: 7BUY, C$_{15}$H$_{28}$N$_4$O$_5$S, 10 fragments). To our knowledge, this is the first deployment of LCNot-UCCSD within QSCI on a quantum computing simulator, and the first DMET-QSCI(LCNot-UCCSD)-RBM application to an industry-relevant protein-ligand system. By utilizing a fraction of the classical computing resources required by the current state-of-the-art work by Cleveland Clinic, RIKEN, and IBM Quantum, this approach enables more efficient and economical drug discovery simulations for the industry.

quant-pharXiv:2606.30551•Jun 30, 2026•1 citation

Improved quantum sampling methods for molecular simulations

Connor van Rossum, Jeffery Cohn, Sally Shrapnel +1 more

Quantum-selected configuration interaction (QSCI) methods use a quantum computer to identify dominant electronic configurations in the molecular ground state, while a classical computer diagonalizes the Hamiltonian within the reduced subspace spanned by those configurations. Sample-based quantum diagonalization (SQD), a leading QSCI approach, uses iterative classical post-processing to correct noisy quantum measurement to ensure that the corresponding configurations remain physically sensible. In this work, we show that SQD performance can be strongly influenced by uncontrolled growth of the classical diagonalization subspace. When classical resources are not explicitly constrained, classical uniform random sampling can reproduce SQD benchmarks as noise increases the diversity of sampled configurations. We show any fair benchmarking protocol of SQD must explicitly control diagonalization size over unique samples. We then address the problem of efficiently discovering physically relevant, energy-lowering configurations by introducing a measurement protocol based on non-orthogonal configuration interaction (NOCI). By distributing measurements across orbital bases optimized with respect to the molecular Hamiltonian, we obtain improved sample efficiency relative to measurements performed solely in the Hartree--Fock basis. Importantly, these improvements persist even under fixed classical resource budgets, demonstrating that the resulting configurations are of higher quality rather than being more numerous. Under our proposed benchmarking procedure, we establish measurement-basis engineering as a promising route to improving quantum sampling methods for electronic structure.

quant-pharXiv:2608.11569•Aug 13, 2026•3 citations

Machine learning for sample-based quantum diagonalization: a review of generative configuration recovery and the classical-simulability frontier

Nicolás Bonilla Vargas

Sample-based quantum diagonalization (SQD), equivalently quantum-selected configuration interaction (QSCI), has become a centre of gravity of pre-fault-tolerant quantum chemistry: a processor samples electronic configurations and the Hamiltonian is diagonalized classically in the resulting subspace. Accuracy is governed entirely by which configurations enter it -- a machine-learning selection problem, made acute by a coupon-collector bottleneck. We review the generative and learned selectors by what each generates and the signal it exploits, and identify one gap: no reward-proportional generative-flow-network proposer has been built for tail discovery. On the field's central question -- whether the quantum sampler beats classical selected CI -- the negative verdict is not ours to claim: priority belongs to Reinholdt et al. [JCTC 21, 6811 (2025)], and polynomial-time classical estimation of the flagship circuits has reinforced it. We state that verdict at the precision a falsifiable claim requires -- it concerns reproducible, same-active-space comparisons on molecular electronic structure -- and weigh the claims outside those qualifiers. We show that alpha-string weights are not invariant under rotations inside degenerate orbital shells, so determinant counts are undefined until the orbital gauge is declared. We distil a ten-element benchmarking standard and apply it to our own deposit, which returned defects that changed numbers printed here and retracted one from v1. FCI-exact experiments confirm one prediction and refute another: the single generative advantage we find keeps no consistent sign along the dissociation coordinate at device-calibrated noise and reverses under a symmetric readout model. It does beat a noise-matched classical recovery loop on N2 by a margin five seeds cannot resolve, and loses by over a factor of two to a classical selector that needs no sampler.

quant-pharXiv:2608.05314•Aug 7, 2026•3 citations

Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization

Vincent Graves, Manqoba Q. Hlatshwayo, Theodoros Kapourniotis +1 more

Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have been formulated within second-quantization in Fock space, which leads to inefficient usage of qubit resources. We introduce the first QSCI algorithm developed in the CI-matrix (CIM) framework, which is known to have optimal qubit scaling of exactly $\lceil \log_2 (N) \rceil$ where $N$ is the size of the CIM. In addition, we introduce a novel single-bit flip error mitigation which comes at the overhead of a single qubit and we combine this with a stochastic approximate Trotterization evolution adapted from qDRIFT. Simulating benchmark N$_2$ and naphthalene molecules on quantum hardware, our results achieved similar accuracy as SQD methods but with significantly less quantum resources. However, our CIM-QSCI algorithm and SQD methods could not match the performance of classical heat-bath CI (HCI) for the same task. Hence, we introduce an augmented version of QSCI called quantum selected heat-bath CI (QSHCI). This variant replaces classical heat-bath sampling with quantum sampling from QSCI to achieve performance comparable to HCI. We note that a current drawback of our approach is the preprocessing cost of $\mathcal{O}(N^2\log N)$ for constructing the CIM and performing the Pauli decomposition. This can be further improved by considering efficient CIM access models for the stochastic Trotter evolution.

quant-pharXiv:2603.13160•Journal of Chemical Theory and Computation•Mar 16, 2026•2 citations

Optimisation-Free Input Preparation in Quantum-Selected Configuration Interaction: Reframing the Quantum-Classical Divide Toward Pure Sampling

Syed Muntasir Mamun

The Variational Quantum Eigensolver (VQE) and associated hybrid quantum-classical algorithms have long been constrained by the practical limitations of near-term quantum hardware, particularly the susceptibility of classical optimization loops to barren plateaus, circuit depth requirements, and measurement overheads. This research explores "optimization-free" input preparation frameworks for Quantum-Selected Configuration Interaction (QSCI)—also known as Sample-based Quantum Diagonalization (SQD). By replacing parameterized variational circuits with deterministic alternatives such as Real-Time Evolution (TE-QSCI), Classically-Boosted VQE (CB-VQE), and Variational Quantum Imaginary Time Evolution (VarQITE), the burden on quantum hardware is shifted exclusively toward probability sampling. This study demonstrates that these frameworks effectively decouple input state preparation from variational optimization, enabling the generation of compact, highly correlated wavefunctions while retaining the rigorous variational bound guaranteed by classical diagonalization. The integration of stochastic circuit compilation (qDRIFT) and Multireference Perturbation Theory (MRPT) further resolves sampling inefficiencies, offering a noise-resilient pathway for achieving chemical accuracy in large-scale molecular simulations. Also available on Academia.edu: https://www.academia.edu/attachments/133434598/download_file?s=portfolio

•Jan 1, 2026•0 citations
Sample-based quantum diagonalization (SQD), an extension of quantum selected configuration interaction (QSCI), is a promising hybrid quantum-classical paradigm for molecular ground-state energies. By replacing variational optimization with quantum sampling, QSCI avoids barren plateaus and directly reconstructs correlated wavefunctions. However, existing configuration recovery mainly enforces symmetry constraints without targeting the most physically relevant configurations, often yielding oversized subspaces and costly classical diagonalization. We introduce QSCI-RBM, a compact subspace generation protocol based on Restricted Boltzmann Machines (RBMs), and integrate it within Density Matrix Embedding Theory (DMET). The RBM learns the distribution of dominant determinants from hardware samples, generating high-probability configurations. Sampling was performed on IBM Heron R1 (\texttt{ibm_torino}) for CH5_55​NO, R2 (\texttt{ibm_fez}) for C2_22​H4_44​, and R3 (\texttt{ibm_boston}) for the larger H2_22​O benchmark and the protein-ligand system. After validating on these benchmarks of increasing active-space size, we simulate the inhibitor Carmofur bound to the SARS-CoV-2 main protease (M\textsuperscript{pro}), fragmented into ten DMET impurities. Both DMET-QSCI-RBM and a DMET-SQD baseline reach chemical-potential self-consistency within four μμμ-iterations. At the converged chemical potential, DMET-QSCI-RBM lies within 0.05 mHa0.05\,\mathrm{mHa}0.05mHa of DMET-FCI while accessing on average only 0.22%0.22\%0.22% of the symmetry-preserving configuration space, versus 0.55 mHa0.55\,\mathrm{mHa}0.55mHa at 33.0%33.0\%33.0% for DMET-SQD, leading to a ∼\sim∼153-fold subspace reduction. RBM-assisted expansion thus yields far more compact hardware-derived determinant spaces at equal or better accuracy, reducing classical overhead for scalable quantum embedding of biological systems on real hardware.
The accurate treatment of electron correlation in extended molecular systems remains computationally challenging using classical electronic structure methods. Hybrid quantum-classical algorithms offer a potential route to overcome these limitations; however, their practical deployment on existing quantum computers requires strategies that both reduce problem size and mitigate hardware noise. In this work, we investigate ground-state energy calculations of ligand-like molecules using Sample-based Quantum Diagonalization (SQD) within the Density Matrix Embedding Theory (DMET) framework, focusing on low-symmetry systems with diverse bonding motifs that exhibit subsystem-dependent variations in fragment-environment entanglement. These entanglement-based variations directly influence bath orbital construction, impurity sizes, and the structure of the embedded Hamiltonians, posing nontrivial challenges for both embedding and quantum sampling. By combining DMET fragmentation with SQD-based construction of reduced configuration spaces through quantum sampling and iterative configuration recovery, we perform quantum simulations on IBM's Eagle R3 (IBM Sherbrooke) and IBM's Heron R3 (IBM Boston) superconducting quantum hardware thereby, showing that the entanglement structure across embedding subsystems plays a central role in determining the efficiency and accuracy of the simulations. Despite these complexities, we show that the DMET-SQD framework yields ground-state energies in strong agreement with DMET-FCI benchmarks, achieving chemical accuracy (1 kcal/mol) across all systems studied. These results demonstrate that SQD-based quantum simulations can be robustly extended to low-symmetry, chemically realistic, industry relevant molecules, and highlight the importance of entanglement-aware embedding strategies for scalable quantum electronic structure calculations.
Calculation of binding energies for protein-ligand molecular systems requires accurate treatment of the electronic structure, a quantum chemistry problem that scales exponentially on classical hardware, while current quantum hardware remains too noisy for the required circuit depths. This report presents a hybrid quantum-classical workflow performed on the Fujitsu FX700 ideal state-vector simulator using QARP that addresses two structural inefficiencies in quantum-sampling-based diagonalization workflows. First, we integrate the Linear Scaling CNOT UCCSD (LCNot-UCCSD) ansatz into the QSCI framework, replacing the O(N6)\mathcal{O}(N^6)O(N6) CCSD parameter initialization of the competing LUCJ ansatz approach with O(N4)\mathcal{O}(N^4)O(N4) MP2-amplitude initialization. Second, we introduce QSCI-RBM, a variant that replaces the configuration recovery of the SQD framework with a Restricted Boltzmann Machine (RBM) acting as a compact generative subspace expansion model. Both are evaluated on eight different molecules in STO-3G across 14 controlled artificial error levels with 100 independent runs each, validated on potential energy surface scans of the N2_22​ molecule in cc-pVDZ, and embedded within DMET to treat the FDA-approved antiviral Amantadine (C10_{10}10​H17_{17}17​N, 11 DMET fragments) and the active region of the SARS-CoV-2 main protease complexed with its covalent inhibitor Carmofur (PDB: 7BUY, C15_{15}15​H28_{28}28​N4_44​O5_55​S, 10 fragments). To our knowledge, this is the first deployment of LCNot-UCCSD within QSCI on a quantum computing simulator, and the first DMET-QSCI(LCNot-UCCSD)-RBM application to an industry-relevant protein-ligand system. By utilizing a fraction of the classical computing resources required by the current state-of-the-art work by Cleveland Clinic, RIKEN, and IBM Quantum, this approach enables more efficient and economical drug discovery simulations for the industry.
Quantum-selected configuration interaction (QSCI) methods use a quantum computer to identify dominant electronic configurations in the molecular ground state, while a classical computer diagonalizes the Hamiltonian within the reduced subspace spanned by those configurations. Sample-based quantum diagonalization (SQD), a leading QSCI approach, uses iterative classical post-processing to correct noisy quantum measurement to ensure that the corresponding configurations remain physically sensible. In this work, we show that SQD performance can be strongly influenced by uncontrolled growth of the classical diagonalization subspace. When classical resources are not explicitly constrained, classical uniform random sampling can reproduce SQD benchmarks as noise increases the diversity of sampled configurations. We show any fair benchmarking protocol of SQD must explicitly control diagonalization size over unique samples. We then address the problem of efficiently discovering physically relevant, energy-lowering configurations by introducing a measurement protocol based on non-orthogonal configuration interaction (NOCI). By distributing measurements across orbital bases optimized with respect to the molecular Hamiltonian, we obtain improved sample efficiency relative to measurements performed solely in the Hartree--Fock basis. Importantly, these improvements persist even under fixed classical resource budgets, demonstrating that the resulting configurations are of higher quality rather than being more numerous. Under our proposed benchmarking procedure, we establish measurement-basis engineering as a promising route to improving quantum sampling methods for electronic structure.
Sample-based quantum diagonalization (SQD), equivalently quantum-selected configuration interaction (QSCI), has become a centre of gravity of pre-fault-tolerant quantum chemistry: a processor samples electronic configurations and the Hamiltonian is diagonalized classically in the resulting subspace. Accuracy is governed entirely by which configurations enter it -- a machine-learning selection problem, made acute by a coupon-collector bottleneck. We review the generative and learned selectors by what each generates and the signal it exploits, and identify one gap: no reward-proportional generative-flow-network proposer has been built for tail discovery. On the field's central question -- whether the quantum sampler beats classical selected CI -- the negative verdict is not ours to claim: priority belongs to Reinholdt et al. [JCTC 21, 6811 (2025)], and polynomial-time classical estimation of the flagship circuits has reinforced it. We state that verdict at the precision a falsifiable claim requires -- it concerns reproducible, same-active-space comparisons on molecular electronic structure -- and weigh the claims outside those qualifiers. We show that alpha-string weights are not invariant under rotations inside degenerate orbital shells, so determinant counts are undefined until the orbital gauge is declared. We distil a ten-element benchmarking standard and apply it to our own deposit, which returned defects that changed numbers printed here and retracted one from v1. FCI-exact experiments confirm one prediction and refute another: the single generative advantage we find keeps no consistent sign along the dissociation coordinate at device-calibrated noise and reverses under a symmetric readout model. It does beat a noise-matched classical recovery loop on N2 by a margin five seeds cannot resolve, and loses by over a factor of two to a classical selector that needs no sampler.
Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have been formulated within second-quantization in Fock space, which leads to inefficient usage of qubit resources. We introduce the first QSCI algorithm developed in the CI-matrix (CIM) framework, which is known to have optimal qubit scaling of exactly ⌈log⁡2(N)⌉\lceil \log_2 (N) \rceil⌈log2​(N)⌉ where NNN is the size of the CIM. In addition, we introduce a novel single-bit flip error mitigation which comes at the overhead of a single qubit and we combine this with a stochastic approximate Trotterization evolution adapted from qDRIFT. Simulating benchmark N2_22​ and naphthalene molecules on quantum hardware, our results achieved similar accuracy as SQD methods but with significantly less quantum resources. However, our CIM-QSCI algorithm and SQD methods could not match the performance of classical heat-bath CI (HCI) for the same task. Hence, we introduce an augmented version of QSCI called quantum selected heat-bath CI (QSHCI). This variant replaces classical heat-bath sampling with quantum sampling from QSCI to achieve performance comparable to HCI. We note that a current drawback of our approach is the preprocessing cost of O(N2log⁡N)\mathcal{O}(N^2\log N)O(N2logN) for constructing the CIM and performing the Pauli decomposition. This can be further improved by considering efficient CIM access models for the stochastic Trotter evolution.
The Variational Quantum Eigensolver (VQE) and associated hybrid quantum-classical algorithms have long been constrained by the practical limitations of near-term quantum hardware, particularly the susceptibility of classical optimization loops to barren plateaus, circuit depth requirements, and measurement overheads. This research explores "optimization-free" input preparation frameworks for Quantum-Selected Configuration Interaction (QSCI)—also known as Sample-based Quantum Diagonalization (SQD). By replacing parameterized variational circuits with deterministic alternatives such as Real-Time Evolution (TE-QSCI), Classically-Boosted VQE (CB-VQE), and Variational Quantum Imaginary Time Evolution (VarQITE), the burden on quantum hardware is shifted exclusively toward probability sampling. This study demonstrates that these frameworks effectively decouple input state preparation from variational optimization, enabling the generation of compact, highly correlated wavefunctions while retaining the rigorous variational bound guaranteed by classical diagonalization. The integration of stochastic circuit compilation (qDRIFT) and Multireference Perturbation Theory (MRPT) further resolves sampling inefficiencies, offering a noise-resilient pathway for achieving chemical accuracy in large-scale molecular simulations. Also available on Academia.edu: https://www.academia.edu/attachments/133434598/download_file?s=portfolio