Skip to content
Review

Quantum Computing and Artificial Neural Network Methods in Approximating the Quantum Many‐Body Fermion System for Modern Quantum Chemistry Applications

Aug 2026 · International Journal of Quantum Chemistry · Vol 126 · 0 citations · 84 references

TL;DR

This review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved, and details the architectural evolution from Restricted Boltzmann Machines to autoregressive models like RNNs and Transformers, which enable exact, uncorrelated sampling and bypass critical bottlenecks.

Abstract

The field of quantum chemistry has long been defined by the central computational challenge of the quantum many‐body fermionic system problem—namely, the electronic Schrödinger equation. The exponential scaling of this equation makes it computationally intractable to solve exactly. As a result, various approximation methods have been developed, ranging from the widely used Density Functional Theory (DFT) to Coupled Cluster (CC) theory. While powerful, these conventional approaches often involve controlled truncations which cause a trade‐off between accuracy and computational cost, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). Traditional ansatz are also frequently engineered specifically for particular systems, which results in a fragmentation of methodologies and fundamentally limits their transferability. Recent research demonstrates that with carefully designed architectures, ANNs can not only represent ground states of model systems with high precision but also tackle the sign problem, offering a promising path forward for strongly correlated electronic structure calculations. This review charts the paradigm shift driven by Neural Network Quantum States (NNQS), which leverage the representational power of deep learning to overcome these barriers. We detail the architectural evolution from Restricted Boltzmann Machines to autoregressive models like RNNs and Transformers, which enable exact, uncorrelated sampling and bypass critical bottlenecks. The high‐efficiency optimization via neural networks was also explored, which decouples optimization cost from model complexity. Furthermore, the frontier of the field is marked by the integration of operator learning and hybrid quantum‐classical frameworks, such as Reinforcement Learning for contractive quantum eigen‐solvers to generate quantum circuits for simulating many‐body molecular systems, and Quantum‐Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware‐efficient ansatz. By framing the problem through the lens of computational resource allocation and quantum hardware integration—specifically, trading exponential memory demands for polynomial‐complexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of these methods represents not merely progress toward powerful simulation tools, but also the creation of a hybrid computational interface. This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.

View source

Similar papers

Preprint Aug 2026

Scientific applications of quantum computing: challenges and opportunities

It is argued that near-term value is most likely to come from disciplined workflow integration rather than wholesale replacement of classical methods, and quantum computing will become scientifically valuable when it demonstrably reduces uncertainty in computed energies, rates, spectra, or materials stability after the full costs of state preparation, measurement, error handling, and coupling to classical simulation are included.

Bruno Camino, C. R. A. Catlow, J. Buckeridge et al. · 0 citations
Preprint Aug 2026

Hybrid HPC-Quantum Simulations: DFT-Quantum Embedding for Molecular Systems

This work presents a hybrid DFT-Quantum Embedding (QDFT) framework integrating classical HPC-based DFT with a quantum electronic-structure solver, demonstrating quantum embedding's potential to improve selected electronic-structure properties while retaining classical HPC's scalability.

N. Manglani, S. Maity, Shashank Sharma et al. · 0 citations
Preprint Sep 2026

Faster Quantum Monte Carlo Simulation by Random Compilation

Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.

Unknown authors · 0 citations
Review Aug 2026

Quantum Monte Carlo in the Age of Many-Body Quantum Information

Quantum Monte Carlo (QMC) methods are among the central numerical tools for studying strongly correlated quantum many-body systems, particularly in higher dimensions. As quantum information has introduced new information-theoretic perspectives and diagnostics into many-body physics, QMC methods have accordingly been extended beyond the measurement of conventional linear observables. This review summarizes recent progress in adapting QMC to many-body quantum-information, focusing on qubit or spin-$1/2$ systems as a concrete setting while keeping the discussion broadly applicable to qudit and bosonic systems. We present a unified perspective on the extraction of nonlinear diagnostics, including entanglement entropies and entanglement spectra, R\'enyi negativities for mixed-state entanglement, stabilizer entropies for quantum magic, and decoherence-driven phenomena such as the interplay between imaginary-time evolution and decoherence and strong-to-weak spontaneous symmetry breaking.

Yi-Ming Ding, Bin-Bin Mao, Zheng Yan · 0 citations
Preprint Aug 2026

Quantum Computing for Industrial Electromagnetics: Applicability and Case Studies in Solving Maxwell's Equations

Computational electromagnetics plays a central role in many industrial applications but often requires substantial computational resources, particularly when fine spatial discretizations are needed. While classical approaches remain the standard, quantum computing offers the potential to accelerate large-scale simulations by encoding them with a limited number of qubits. Here, we investigate the performance and resource scaling of the Harrow-Hassidim-Lloyd (HHL) and Quantum Singular Value Transformation (QSVT) algorithms for solving linear systems generated by the finite-difference time-domain (FDTD) method, a widely adopted numerical scheme for discretizing Maxwell's equations. We benchmark their performance across representative industrial use cases, including radar propagation, lens simulations, and beamforming processes. Our results demonstrate the validity of the approaches, achieving state infidelities smaller than $2\cdot 10^{-3}$ with success probabilities greater than $10^{-3}$, compatible with practical quantum state sampling. Overall, we observe that the QSVT method consistently delivers higher accuracy. We further observe that the condition number of the linear matrix, a key factor governing the performance of quantum solvers, saturates as the number of spatial lattice points increases. This implies that the spatial grid can be scaled to realistic industrial dimensions without increasing the HHL or QSVT circuit depth due to ill-conditioned matrices.

Francesco Turro, Marco Maronese, Daniele Dragoni · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.