A Hardware-Trained Generative Quantum Eigensolver for Sample-Based Quantum Diagonalization of Organotin Hydroxides up to 70 Qubits
quant-ph, cs.AI, physics.chem-ph
Submitted: 2026-11-10
Updated: 2026-11-11
Comments: 77 pages (26 pages main text, 51 pages appendices), 24 figures, 38 tables
Code: https://github.com/kunalroy332/sqd-gqe
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Quantum hardware can provide feedback for training circuit generators beyond the reach of exact classical simulation.
Terminology
Abstract
Quantum hardware can provide feedback for training circuit generators beyond the reach of exact classical simulation. We train generative quantum eigensolver (GQE) policies, transformers conditioned on molecular descriptors, to generate the state-preparation circuits for sample-based quantum diagonalization (SQD). Training runs first on a noiseless simulator and then with the IBM Heron processor ibm kobe inside the loop, at 46 and 70 qubits (1.2 times 10 8 shots for the four main training runs). A classical CCSD(T) reference energy of the training molecules enters only an admission gate and two auxiliary reward terms. During hardware training, a reward penalty prevents collapse to circuits that sample only the Hartree-Fock determinant. Policies trained on transition-metal complexes are applied without retraining to Sn(OH) 3-Me and its hydrates, minimal models of organotin photoresists for extreme-ultraviolet lithography, from 32 to 70 qubits. After one round of hardware sampling, followed by classical ranking and recovery of the cached counts with the molecular Hamiltonian and no further QPU calls, 27 of 28 runs at 46-70 qubits are within 15 mHa of the density-matrix renormalization group (DMRG) reference (median 4.5 mHa), and in all eight runs with an untrained control the trained policy is more accurate. At 56-70 qubits the selected circuits use 34-72 times fewer two-qubit gates than the local unitary cluster Jastrow (LUCJ) circuit transpiled for the same device. These results demonstrate that circuit generators can be trained with quantum hardware at 70 qubits.
Sources
- Tapering off qubits to simulate fermionic Hamiltonians
- 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
- Vibrational Sample-Based Quantum Diagonalization with Unitary-Cluster-Jastrow Ans"atze on IBM QPUs
- Broken-Symmetry Reference States for Sample-Based Quantum Diagonalization with Near-DMRG Accuracy
- 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
- Curriculum reinforcement learning for quantum architecture search under hardware errors
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- Proximal Policy Optimization Algorithms
- Quantum computing with Qiskit
- ffsim: Faster simulation of fermionic quantum circuits
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