Multistate iterative qubit coupled cluster (MS-iQCC): a quantum-inspired, state-averaged approach to ground- and excited-state energies
Bibliographic record
Abstract
We introduce the multistate iterative qubit coupled cluster (MS-iQCC) method, a quantum-inspired algorithm that runs efficiently on classical hardware and is designed to predict both ground and excited electronic states of molecules. Accurate excited-state energetics are essential for interpreting spectroscopy and chemical reactivity, but standard electronic structure methods are either too computationally expensive for larger systems or lose reliability in the presence of strong electron correlation. MS-iQCC addresses this challenge by simultaneously optimizing multiple electronic states in a single, state-averaged procedure that treats ground and excited states on equal footing. This removes the energetic bias that is introduced when excited states are computed one at a time and constrained to remain orthogonal to previously optimized states. The approach supports multireference electronic structure by allowing multideterminantal initial guesses and by adaptively building a compact exponential ansatz from a pool of qubit excitation generators. We apply MS-iQCC to H$_4$, H$_2$O, N$_2$, and C$_2$, including strongly correlated geometries, and observe robust convergence of all targeted state energies to chemically meaningful accuracy across their potential energy surfaces.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".