Auto-regressive Neural Quantum State Sampling for Selected Configuration Interaction

• URL: http://arxiv.org/abs/2603.24728v1
• Date: Wed, 25 Mar 2026 18:53:00 GMT
• Title: Auto-regressive Neural Quantum State Sampling for Selected Configuration Interaction
• Abstract summary: We introduce an algorithm that uses auto-regressive neural networks (ARNNs) to guide subspace expansion for ground-state search.<n>Our algorithm efficiently constructs compact variational subspaces from learned ground-state statistics.<n> Benchmarks on molecular systems demonstrate that ARNN-guided subspace expansion combines the strengths of neural-network representations and classical subspace methods.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurate ground-state energy calculations remain a central challenge in quantum chemistry due to the exponential scaling of the many-body Hilbert space. Variational Monte Carlo and variational quantum eigensolvers offer promising ansatz optimization approaches but face limitations in convergence as well as hardware constraints. We introduce a particular Selected Configuration Interaction (SCI) algorithm that uses auto-regressive neural networks (ARNNs) to guide subspace expansion for ground-state search. Leveraging the unique properties of ARNNs, our algorithm efficiently constructs compact variational subspaces from learned ground-state statistics, which in turn accelerates convergence to the ground-state energy. Benchmarks on molecular systems demonstrate that ARNN-guided subspace expansion combines the strengths of neural-network representations and classical subspace methods, providing a scalable framework for classical and hybrid quantum-classical algorithms.

Related papers

• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• 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)
• Crystal structure prediction using graph neural combinatorial optimization [2.656984940355681]
  Crystalline materials are widely used in technological applications, yet their discovery remains a significant challenge.<n>As their properties are driven by structure, crystal structure prediction (CSP) methods play a central role in computational approaches aiming to accelerate this process.<n>We introduce a neural optimization approach to the atom allocation challenge and, subsequently, CSP, based on graph neural networks (GNNs)<n>We demonstrate that our method outperforms classical approaches and is competitive with a commercial optimization solver across a range of chemical compositions.
  arXiv  Detail & Related papers  (2026-04-27T00:34:03Z)
• A Spatio-Temporal Hybrid Quantum-Classical Graph Convolutional Neural Network Approach for Urban Taxi Destination Prediction [0.5735035463793009]
  We propose a hybrid Spatio-Temporal Quantum Graph Convolutional Network (H-STQGCN) algorithm to predict the taxi destination within urban road networks.<n>Our algorithm consists of two branches: spatial processing and time evolution.<n>Our experimental results demonstrate that the proposed algorithm outperforms the current methods in terms of prediction accuracy and stability.
  arXiv  Detail & Related papers  (2025-12-15T02:31:17Z)
• Classically Prepared, Quantumly Evolved: Hybrid Algorithm for Molecular Spectra [41.99844472131922]
  We introduce a hybrid classical-quantum algorithm to compute dynamical correlation functions and excitation spectra in many-body quantum systems.<n>The method combines classical preparation of a perturbed ground state with short-time quantum evolution of product states sampled from it.
  arXiv  Detail & Related papers  (2025-10-28T19:27:12Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Exploring quantum localization with machine learning [39.58317527488534]
  We introduce an efficient neural network (NN) architecture for classifying wave functions in terms of their localization. Our approach integrates a versatile quantum phase space parametrization leading to a custom 'quantum' NN, with the pattern recognition capabilities of a modified convolutional model.
  arXiv  Detail & Related papers  (2024-06-01T08:50:26Z)
• 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)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Scalable neural quantum states architecture for quantum chemistry [5.603379389073144]
  Variational optimization of neural-network representations of quantum states has been successfully applied to solve interacting fermionic problems. We introduce scalable parallelization strategies to improve neural-network-based variational quantum Monte Carlo calculations for ab-initio quantum chemistry applications.
  arXiv  Detail & Related papers  (2022-08-11T04:40:02Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)
• Entanglement Classification via Neural Network Quantum States [58.720142291102135]
  In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
  arXiv  Detail & Related papers  (2019-12-31T07:40:23Z)

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.