A Transferable Machine Learning Approach to Predict Optimized Orbitals for Electronic Structure Problems

• URL: http://arxiv.org/abs/2605.04174v1
• Date: Tue, 05 May 2026 18:12:05 GMT
• Title: A Transferable Machine Learning Approach to Predict Optimized Orbitals for Electronic Structure Problems
• Abstract summary: Variational quantum eigensolver anstze hold considerable promise for ground-state energy calculations on quantum hardware.<n>We present a graph neural network framework that predicts optimized orbital coefficients directly from molecular geometry and pair-wise bonding structure.<n>Our model reaches mean absolute energy errors $mathcalO(102)$ and $mathcalO$ milli-Hartrees, respectively.
• Score: 0.49259062564301753
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational quantum eigensolver ansätze hold considerable promise for ground-state energy calculations on near-term quantum hardware, yet most promising ansatz designs currently strongly depend on how well the molecular orbital basis captures the electronic correlation of the system. Computing optimized orbital coefficients via classical routines is computationally expensive and must be performed independently for each molecular geometry -- a bottleneck that limits scalability across chemical space. We present a graph neural network framework that predicts optimized orbital coefficients directly from molecular geometry and pair-wise bonding structure. Trained on hydrogenic systems of modest size ($H_4$ and $H_6$) across tens of thousands of geometries, our model transfers to larger, unseen systems ($H_8$, $H_{10}$ and $H_{12}$) without retraining -- demonstrating strong out-of-distribution generalization with respect to system size. When evaluating on structured and random configurations, and comparing against energies obtained with full classical optimization, our model reaches mean absolute energy errors $\mathcal{O}(10^2)$ and $\mathcal{O}(10)$ milli-Hartrees, respectively. Beyond energy estimation, the predicted orbitals serve as high-quality warm-start initializations that substantially reduce optimizer iterations to ground-state energy convergence. These results establish graph neural networks as an effective and scalable strategy for accelerating orbital optimization in hybrid quantum-classical workflows, directly reducing the classical pre-processing overhead that currently limits the practical deployment of variational quantum eigensolver on near-term quantum hardware.

Related papers

• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• An Iterative Dual-Channel Neural Quantum State Algorithm for Selected Configuration Interaction [3.013377814843082]
  We introduce the Handover Iterative Neural Quantum State (HI-NQS) algorithm, which embeds a classically trained autoregressive Transformer neural quantum state within the iterative sample--diagonalize--update framework of Sample-Based Quantum Diagonalization.<n>HI-NQS achieves chemical accuracy on all systems tested, with determinant-count scaling substantially more favorable than conventional CIPSI-based SCI for all but the smallest active spaces.
  arXiv  Detail & Related papers  (2026-06-25T08:47:04Z)
• Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers [0.005390659954881999]
  We introduce an algorithm for estimating the distribution complexity of hybrid quantum-classical simulation for electronic structure Hamiltonians.<n>We show that emergent entanglement patterns are induced by the interplay between coherent Gaussian orbital rotations and disordered Coulomb interactions.<n>The framework introduced here enables novel and more efficient quantum-classical application towards utility-scale quantum computing.
  arXiv  Detail & Related papers  (2026-06-18T18:00:16Z)
• SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
  Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
  arXiv  Detail & Related papers  (2026-03-25T13:38:15Z)
• Efficient Simulation of Pre-Born-Oppenheimer Dynamics on a Quantum Computer [0.39146761527401436]
  Algorithm achieves best-in-class efficiency for block-encoding the pre-Born-Oppenheimer molecular Hamiltonian.<n>We benchmark our approach for a series of scientifically and industrially relevant chemical reactions.
  arXiv  Detail & Related papers  (2026-02-11T19:00:03Z)
• Entanglement-minimized orbitals enable faster quantum simulation of molecules [1.7042264000899534]
  We introduce an efficient classical algorithm to find entanglement-minimized orbitals (EMOs) using spin-adapted matrix product states (MPS)<n>Our algorithm improves initial state overlap by nearly an order of magnitude over prior orbital optimization approaches for an iron-sulfur cluster with four irons.<n>Our results show that initial state preparation for these challenging systems requires far fewer resources than prior estimates suggested.
  arXiv  Detail & Related papers  (2025-06-16T11:49:20Z)
• Large-scale quantum annealing simulation with tensor networks and belief propagation [0.0]
  We show that quantum annealing for 3-regular graphs can be classically simulated even at scales of 1000 qubits and 5000000qubit gates. For non-degenerate instances, the unique solution can be read out from the final reduced single-qubit states. For degenerate problems, such as MaxCut, we introduce an approximate measurement simulation algorithm for graph tensor-network states.
  arXiv  Detail & Related papers  (2024-09-18T18:00:08Z)
• Scalable Imaginary Time Evolution with Neural Network Quantum States [0.0]
  The representation of a quantum wave function as a neural network quantum state (NQS) provides a powerful variational ansatz for finding the ground states of many-body quantum systems. We introduce an approach that bypasses the computation of the metric tensor and instead relies exclusively on first-order descent with Euclidean metric. We make this method adaptive and stable by determining the optimal time step and keeping the target fixed until the energy of the NQS decreases.
  arXiv  Detail & Related papers  (2023-07-28T12:26:43Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Optimizing Electronic Structure Simulations on a Trapped-ion Quantum Computer using Problem Decomposition [41.760443413408915]
  We experimentally demonstrate an end-to-end pipeline that focuses on minimizing quantum resources while maintaining accuracy. Using density matrix embedding theory as a problem decomposition technique, and an ion-trap quantum computer, we simulate a ring of 10 hydrogen atoms without freezing any electrons. Our experimental results are an early demonstration of the potential for problem decomposition to accurately simulate large molecules on quantum hardware.
  arXiv  Detail & Related papers  (2021-02-14T01:47:52Z)
• Multi-task learning for electronic structure to predict and explore molecular potential energy surfaces [39.228041052681526]
  We refine the OrbNet model to accurately predict energy, forces, and other response properties for molecules. The model is end-to-end differentiable due to the derivation of analytic gradients for all electronic structure terms. It is shown to be transferable across chemical space due to the use of domain-specific features.
  arXiv  Detail & Related papers  (2020-11-05T06:48:46Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• OrbNet: Deep Learning for Quantum Chemistry Using Symmetry-Adapted Atomic-Orbital Features [42.96944345045462]
  textscOrbNet is shown to outperform existing methods in terms of learning efficiency and transferability. For applications to datasets of drug-like molecules, textscOrbNet predicts energies within chemical accuracy of DFT at a computational cost that is thousand-fold or more reduced.
  arXiv  Detail & Related papers  (2020-07-15T22:38:41Z)

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.