GENIE: learned quantum circuits as embedding impurity solvers, and why compactness, not correlation strength, decides when they work
quant-ph
Submitted: 2026-10-30
Updated: 2026-10-30
Comments: 18 pages, 11 figures. Code: doi:10.5281/zenodo.23736693; data: doi:10.5281/zenodo.23737678
Code: https://github.com/AwadhootVijayLoharkar/Quenais-Project
License: http://creativecommons.org/licenses/by/4.0/
The gist: Sample-based quantum diagonalization has been used as an impurity solver in density matrix embedding theory (DMET)…
Terminology
Abstract
Sample-based quantum diagonalization has been used as an impurity solver in density matrix embedding theory (DMET), but always with fixed-form circuits and without comparison to classical selection at the same subspace size. We introduce GENIE, a DMET impurity solver in which a generative transformer learns the sampling circuit, trained on the quantum-selected configuration interaction energy. On N2, hydrogen chains, water and a hydrogen ring, we compare GENIE at equal determinant budget with classical selected configuration interaction (CIPSI, ASCI, heat-bath CI) and with DMET combined with sample-based quantum diagonalization (SQD). GENIE selects: for N2 at 200 determinants it is within a factor of 1.7 of CIPSI and 25 to 1000 times more accurate than the determinants a fixed circuit actually samples, while standard SQD reaches good energies mainly by filling the subspace. GENIE does not beat the best classical selection, and its circuits require fault-tolerant hardware. Its failures are governed by the compactness of the wavefunction relative to the budget, not by correlation strength. A cheap estimate from coupled-cluster amplitudes predicts this compactness. A router built on it never recommended GENIE where it then failed, apart from seed-to-seed variance, and it transferred unchanged to a blind test on new systems. We also identify two benchmarking pitfalls that can create apparent quantum advantages of one to two orders of magnitude.
Sources
- Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers
- Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
- Quantum-Centric Algorithm for Sample-Based Krylov Diagonalization
- Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization
- A practical guide to density matrix embedding theory in quantum chemistry
- Quantum Simulation of Ligand-like Molecules through Sample-based Quantum Diagonalization in Density Matrix Embedding Framework
- Exactly-embedded multiconfigurational self-consistent field theory using density matrix embedding: the localized active space self-consistent field method
- The Variational Localized Active Space Self-Consistent Field Method
- Sample-based quantum diagonalization as parallel fragment solver for the localized active space self-consistent field method
- Quantum computing for accurate large-scale electronic-structure calculations: DFT-embedded, post-processed quantum-selected configuration interaction
- Machine-Learned Compact Subspace Generation for Quantum Selected Configuration Interaction within Density Matrix Embedding Framework
- A deterministic alternative to the full configuration interaction quantum Monte Carlo method
- Heat-bath Configuration Interaction: An efficient selected CI algorithm inspired by heat-bath sampling
- Machine learning for sample-based quantum diagonalization: a review of generative configuration recovery and the classical-simulability frontier
- An auto-initializing algorithm to determine electronic ground states from random Slater determinants
- Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer
- The generative quantum eigensolver (GQE) and its application for ground state search
- Generative Circuit Design for Quantum-Selected Configuration Interaction
- Scaling a CUDA-Q GQE + QSCI pipeline to 40 qubits for EUV photoresist chemistry
- Quantum computing with Qiskit
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements