Machine learning for sample-based quantum diagonalization: generative configuration recovery and the classical-simulability frontier

• URL: http://arxiv.org/abs/2608.05314v1
• Date: Wed, 05 Aug 2026 18:15:19 GMT
• Title: Machine learning for sample-based quantum diagonalization: generative configuration recovery and the classical-simulability frontier
• Abstract summary: We review the ecosystem of generative and learned selectors and expose one conspicuous gap: a reward-proportional generative-flow-network proposer built for tail discovery.<n>We report a carefully scoped negative: across published same-active-space comparisons, strong classical selected CI matches or beats the quantum-sampled subspace, and the flagship single-layer circuits now admit-time classical energy estimation.<n>We flag learning from quantum experiments, whose classical sample-complexity lower bound is an unconditional determinant, as the one adjacent frontier where a quantum advantage is provable but not yet bridged to chemistry
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sample-based quantum diagonalization (SQD), equivalently quantum-selected configuration interaction (QSCI), has in two years become a pragmatic centre of gravity of pre-fault-tolerant quantum chemistry: a quantum processor samples electronic configurations, and the many-electron Hamiltonian is diagonalized classically in the resulting determinant subspace. Its accuracy is set entirely by which configurations enter that subspace, a selection problem for machine learning made acute by a coupon-collector bottleneck. We critically review the ecosystem of generative and learned selectors, organizing it by the object each method generates and the importance signal it exploits, and expose one conspicuous gap: a reward-proportional generative-flow-network proposer built for tail discovery. We then confront the field's central question -- whether the quantum sampler beats classical selected configuration interaction -- and report a carefully scoped negative: across published same-active-space comparisons, strong classical selected CI matches or beats the quantum-sampled subspace, and the flagship single-layer circuits now admit polynomial-time classical energy estimation. We distil a benchmarking standard and turn the negative into a regime map, then test it with FCI-exact experiments that confirm one prediction and refute another: the cheap prior's rank correlation with the exact weights declines with multireference character (a usable coordinate), but a controlled single-molecule noise sweep shows the one generative advantage we find, robustness to valid-shot starvation, to be generic rather than the multireference-specific effect a confounded contrast first suggested. Finally, we flag learning from quantum experiments, whose classical sample-complexity lower bound is an unconditional theorem, as the one adjacent frontier where a quantum advantage is provable but not yet bridged to chemistry.

Related papers

• Classical Active-Space Hybrid Quantum Subspace Expansion (CASH-QSE): Quantum Corrections without Remeasuring the Classically Calculable Energy [0.0]
  Representing energy as a combination of a classical reference and separately prepared quantum states allows energy sampling.<n>CASH-QSE reaches chemical accuracy while limiting the largest complete measurement circuits.
  arXiv  Detail & Related papers  (2026-09-08T02:59:48Z)
• Improved quantum sampling methods for molecular simulations [0.0]
  We show that sample-based quantum diagonalization (SQD) performance can be strongly influenced by uncontrolled growth of the classical diagonalization subspace.<n>We then address the problem of efficiently discovering physically relevant, energy-lowering configurations by introducing a measurement protocol based on non-orthogonal configuration interaction (NOCI)<n>These improvements persist even under fixed classical resource budgets, demonstrating that the resulting configurations are of higher quality rather than being more numerous.
  arXiv  Detail & Related papers  (2026-08-12T02:27:06Z)
• Learning with Active Quantum Subspaces: Scalable Hybrid Advantage without Full Quantum Data-Encoding [5.496928375514333]
  We study whether quantum learning advantage can persist without fully embedding a large classical input into a quantum state.<n>We introduce active quantum subspace data-encoding, in which only an information-bearing subset of the input is lifted to a quantum representation.<n>Our results generalize QRAM-free hybrid learning and provide a scalable route toward NISQ-compatible quantum advantage.
  arXiv  Detail & Related papers  (2026-05-30T23:40:28Z)
• Classical simulation of free-fermionic dynamics and quantum chemistry with magic input [0.15554979526414522]
  We show that for a class of paired non-Gaussian fermionic states, quantum simulation primitives can be efficiently approximated to additive error under free-fermionic dynamics.
  arXiv  Detail & Related papers  (2026-04-29T15:42:59Z)
• Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer [4.158044333915682]
  We show that a hybrid quantum-classical algorithm can outperform purely classical, off-the-shelf selected configuration interaction methods.<n>A sample-based quantum diagonalization algorithm, run on an IBM Heron R3 processor, succeeds at the same task.
  arXiv  Detail & Related papers  (2026-03-03T20:11:28Z)
• Towards Quantum Enhanced Adversarial Robustness with Rydberg Reservoir Learning [45.92935470813908]
  Quantum computing reservoir (QRC) leverages the high-dimensional, nonlinear dynamics inherent in quantum many-body systems.<n>Recent studies indicate that perturbation quantums based on variational circuits remain susceptible to adversarials.<n>We investigate the first systematic evaluation of adversarial robustness in a QR based learning model.
  arXiv  Detail & Related papers  (2025-10-15T12:17:23Z)
• Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction [0.0]
  We present an algorithm that leverages Hamiltonian time evolution in Quantum-Selected Configuration Interaction (QSCI)<n>We assess the resulting wavefunctions for compactness, a point on which QSCI has previously been criticised.<n>This result is achieved with a configuration sampling scheme that uses the experimental orbital occupancies of a time-evolved quantum state to predict likely single and double excitations.
  arXiv  Detail & Related papers  (2025-09-02T17:27:12Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows [0.0]
  We introduce a method we call CoVaR, an alternative means to exploit the power of variational circuits. CoVaR is directly analogous to gradient-based optimisations of paramount importance to classical machine learning. We observe numerical simulations a very significant improvement by many orders of magnitude in convergence speed.
  arXiv  Detail & Related papers  (2022-04-18T18:01:58Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Probing the Universality of Topological Defect Formation in a Quantum Annealer: Kibble-Zurek Mechanism and Beyond [46.39654665163597]
  We report on experimental tests of topological defect formation via the one-dimensional transverse-field Ising model. We find that the quantum simulator results can indeed be explained by the KZM for open-system quantum dynamics with phase-flip errors. This implies that the theoretical predictions of the generalized KZM theory, which assumes isolation from the environment, applies beyond its original scope to an open system.
  arXiv  Detail & Related papers  (2020-01-31T02:55:35Z)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.