TRANSMISSION // 2611.13755v1
An AI learns from a quantum chip to propose shorter chemistry circuits
Source published
A preprint reports training a circuit-generating AI with quantum hardware at up to 70 qubits. Selected circuits helped recover energies near classical reference calculations for model tin compounds—but required substantial sampling and classical computation.
Can a noisy quantum computer help teach an AI how to use it? Researchers report doing exactly that for molecular-energy calculations, training a circuit generator with feedback from an IBM processor. The resulting workflow found useful, shallow circuits for small models of tin-based photoresist materials, while exposing how much the answer depends on classical selection and recovery.
Learning which experiments to run
The study, available as an arXiv preprint and not established here as peer-reviewed, tackles a practical problem in quantum chemistry: preparing a useful electronic state before hardware noise overwhelms it.
Its circuit designer is a classical transformer, not a quantum neural network. Given descriptors of a molecule, it generates a sequence of operations for a quantum processor. Measurements from those circuits feed a hybrid calculation called sample-based quantum diagonalization, or SQD.
In SQD, the quantum computer does not produce the final molecular energy directly. It samples electronic configurations—possible arrangements of electrons among the selected orbitals. A classical computer uses those samples to construct a restricted space of configurations and solves the molecular energy problem within it.
That distinction matters. The final answer belongs to the combined quantum-and-classical workflow, not simply to the state prepared on the chip.
From simulation to hardware feedback
The researchers first trained their generators on a noiseless simulator using molecules represented by at most 32 qubits. They then continued training with IBM’s Heron-generation processor, ibm_kobe, providing measurement feedback for transition-metal complexes at 46 and 70 qubits.
Four main training runs combined two molecular-conditioning approaches with two circuit lengths. One conditioning approach used numerical molecular descriptors; the other added structural features from a frozen, pretrained model.
Together, these hardware-training runs used 120 million measurement shots and 648 minutes of billed quantum-processing time. Classical computation and device queues added substantially more elapsed time.
Training also required approximate classical reference energies. Those references controlled whether a batch could update the model and whether two auxiliary penalties applied. The authors did not test a reference-free training protocol, although evaluation on the target molecules required no reference energy to select circuits.
One essential penalty discouraged a tempting shortcut: generating circuits whose valid measurements merely reproduced the starting Hartree–Fock configuration, a simplified electronic reference.
Trying different chemistry
The trained policies were then applied without further training to methyltin trihydroxide and its one- and two-water adducts. These are minimal models relevant to organotin photoresists for extreme-ultraviolet lithography, not simulations of a complete photoresist or its response to light.
The targets covered eleven selected electronic spaces, spanning 32–70 qubits. For each policy–target combination, the generator proposed ten circuits, each measured 100,000 times. A relatively inexpensive classical calculation ranked the candidates; more extensive configuration recovery then reused the stored measurements without further quantum-processor calls.
For the main training recipe, 43 of 44 combinations produced a reported recovered best-circuit result. Their median deviation from density-matrix renormalization group, or DMRG, reference energies was 2.8 millihartree. A millihartree is one-thousandth of the hartree energy unit. Forty-two results were within 15 millihartree—useful agreement, but not equivalent to uniformly reaching the approximately 1.6-millihartree threshold commonly called chemical accuracy.
One combination was excluded after producing only one circuit with valid measurements; a second sampling attempt still gave a large recovered error. In all eight comparisons with an untrained generator, the trained policy was more accurate. Those controls covered only three target systems.
Short circuits, substantial supporting work
At 56–70 qubits, selected circuits used 64–160 two-qubit gates, between 34 and 72 times fewer than the study’s transpiled local unitary cluster Jastrow, or LUCJ, comparator.
But selection is doing important work. Many other generated circuits were deep, and the typical candidate was not necessarily cheaper than LUCJ. Sampling ten candidates consumed about eleven times the quantum-processing time per job of sampling the single LUCJ circuit. Final classical recovery dominated evaluation wall time.
The physical interpretation is also unusual. On three smaller targets examined exactly, selected ideal circuits remained close to the Hartree–Fock starting state. Hardware measurements contained substantially more excited configurations; the authors conclude that device noise supplies excitation content exploited by recovery. That observation does not establish noise as generally beneficial.
What the experiment establishes
The evidence supports hardware-in-the-loop circuit-generator training at 70 qubits, not a demonstrated computational advantage over classical chemistry.
Each training lineage used one seed, most circuits were sampled only once, and the main policy narrowed to a very limited repertoire during training. Small-target accuracy was helped by recovery spaces large enough to accommodate every possible spin-sector string. Moreover, although the tin targets were absent from policy training, an earlier tin-target result informed one reward weight, limiting claims of untouched generalization.
The achievement is therefore specific: a learned proposal-and-selection workflow can produce short, useful circuits on noisy hardware. Whether its training, sampling and classical-recovery costs pay off on harder chemistry remains unresolved.
- quantum computing
- quantum chemistry
- generative quantum eigensolver
- sample-based quantum diagonalization
- organotin photoresists
- machine learning
- 70 qubits
Reviewed cross-references
These connections were reviewed by a model, not independently fact-checked by a human. Similarity does not imply agreement; consult the original papers and the evidence below.
Quantum-assisted simulation follows a proton between two water molecules
Shared method: Kumar et al. and Khandelwal et al. both sample electronic-configuration bitstrings on quantum circuits and diagonalize the molecular Hamiltonian in the resulting determinant subspaces. Kumar et al. use hardware-trained GQE circuits for organotin models, whereas Khandelwal et al. use qDRIFT-compiled time evolution for Zundel-cation energies and dynamics; the shared subspace method does not establish comparable accuracy or circuit costs across these different preprint studies, whose supplied excerpts are selective and partly extraction-damaged.
Model review: · openai-codex/gpt-6.1-sol
Evidence and provenance
Selected excerpts, not complete papers. PDF extraction can omit figures or damage equations, tables and reading order; sources may be preprints.
2611.13755v1 — Original paper
Excerpt reference:
static/papers/2611.13755v1.md:73-127
Basis: Paper text
Source SHA-256:a68fa98bf18649634008a4cbd7988e84963502327a317812ecd4eb6405b8abbb2611.11084v1 — Original paper
Excerpt reference:
static/papers/2611.11084v1.md:325-390
Basis: Paper text
Source SHA-256:4a18c1345740ebf5782ed9168369a652657abc11baa97792b003eec3e1e408be2611.11084v1 — Original paper
Excerpt reference:
static/papers/2611.11084v1.md:1341-1446
Basis: Paper text
Source SHA-256:4a18c1345740ebf5782ed9168369a652657abc11baa97792b003eec3e1e408be
Quantum proposals improve a fixed-size molecular calculation
Shared method: Kumar et al. and Yamamoto et al. use quantum-measured electronic configurations to construct determinant spaces for classical Hamiltonian diagonalization. Kumar et al. rank GQE circuits and recover sampled configurations for organotin models; Yamamoto et al. rank quantum proposals alongside classical HCI candidates before fixed-budget CI diagonalization, with an H12 hardware demonstration. This is a shared hybrid subspace method, not identical selection procedures or a matched performance comparison; the supplied preprint excerpts are selective and partly extraction-damaged.
Model review: · openai-codex/gpt-6.1-sol
Evidence and provenance
Selected excerpts, not complete papers. PDF extraction can omit figures or damage equations, tables and reading order; sources may be preprints.
2611.13755v1 — Original paper
Excerpt reference:
static/papers/2611.13755v1.md:73-127
Basis: Paper text
Source SHA-256:a68fa98bf18649634008a4cbd7988e84963502327a317812ecd4eb6405b8abbb2611.13755v1 — Original paper
Excerpt reference:
static/papers/2611.13755v1.md:397-461
Basis: Paper text
Source SHA-256:a68fa98bf18649634008a4cbd7988e84963502327a317812ecd4eb6405b8abbb2611.12672v1 — Original paper
Excerpt reference:
static/papers/2611.12672v1.md:63-225
Basis: Paper text
Source SHA-256:c76925f5eaa45ee5e7e4da13ea293ec60f308ea854f6de4c54c2f81ee3faa6dd
Related reading
Automatically matched by shared topic keywords. These links do not imply that the sources agree or establish a consensus.
Quantum-assisted simulation follows a proton between two water molecules
Source published
Shared keywords: quantum chemistry, quantum computing
Quantum proposals improve a fixed-size molecular calculation
Source published
Shared keywords: quantum chemistry, quantum computing
Hydrogen stand-ins help transfer quantum circuit settings to larger molecules
Source published
Shared keywords: quantum chemistry
A tunable interaction could broaden neutral-atom quantum gates
Source published
Shared keywords: quantum computing
Learning when quantum error mitigation is worth the cost
Source published
Shared keywords: quantum computing