GENIE: learned quantum circuits as embedding impurity solvers, and why compactness, not correlation strength, decides when they work
Awadhoot Vijay Loharkar, Arcesio Castañeda Medina
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.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado