Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.08151

Machine learning quantum data to accelerate quantum Monte Carlo

Tong Jiang, Andrew Zhao, Shashwat Kumar, Jigyasa Nigam, Eliott N. Rosenberg, Ryan Babbush, Andrew Baczewski, William J. Huggins, Joonho Lee

Published Nov 5, 2026• 0 citations
arXivHTMLPDF

Abstract

Simulating strongly correlated electrons in molecules and materials remains a central goal for quantum computing. A promising strategy uses quantum processors to prepare trial wavefunctions that guide classical quantum Monte Carlo (QMC). However, the enormous computational cost of repeatedly processing quantum measurements has severely limited the practical scalability of this approach. Here, we overcome this bottleneck by compressing quantum measurement data into machine-learning models that efficiently provide the wavefunction overlaps needed by QMC. This accelerates quantum-classical QMC by orders of magnitude, enabling chemically accurate simulations on up to 40 qubits, more than doubling the scale of previous hardware demonstrations with comparable accuracy. We demonstrate our approach on hydrogen chains and strongly correlated iron-sulfur clusters using measurements from Google's Willow processor. By enabling efficient reuse of quantum-state information on the classical coprocessor, our framework addresses a fundamental bottleneck in hybrid quantum algorithms that will persist even into the fault-tolerant era.

DOI
10.48550/arxiv.2611.08151

Related papers

Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations

Shu Kanno, Hajime Nakamura, T. Kobayashi +4 more

Abstract Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.

arXiv:2303.18095•npj Quantum Information•Jun 6, 2024•24 citations

Quantum computing quantum Monte Carlo algorithm

Yukun Zhang, Yifei Huang, Jinzhao Sun +2 more

Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N$_2$ molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.

arXiv:2206.10431•Physical Review A•Jul 21, 2025•33 citations

Hybrid Quantum Classical Acceleration of Machine Learning Algorithms: A Performance Study

Mahesh V, Ramkumar Krishnamoorthy, Diwakara Vasuman M S +2 more

The recent rise in the number of data-intensive applications has revealed some inherent limitations of traditional machine learning, such as high training costs, slow convergence rates, and the uncapable of scalability of traditional machine learning in high-dimensional spaces. Bottlenecks are caused by the iterative optimization procedure, kernel evaluations, and similarity computations that are not efficiently supported by traditional hardware. Although recent advances in quantum computing, such as the Variational Quantum Algorithm, quantum kernels, and parameterized quantum circuits, hold promise for acceleration, the application of quantum speedup is presently hindered by noisy intermediate-scale quantum computing. This research provides a hybrid quantum-classical acceleration method that integrates quantum methods with selected computationally intensive components of classical machine learning systems rather than attempting to entirely replace them. Carried out a comprehensive analysis of the performance of well-known algorithms like Support Vector Machines, k-means clustering, and gradient-based neural networks in classical and quantum-assisted hybrid scenarios. The quantum resources are greatly beneficial for particular sub-tasks such as optimization, approximation of similarity, and exploration of the feature space, with the remaining learning process performed classically. Our analysis reveals that hybrid methods can offer a tangible acceleration and improved convergence behaviour in particular scenarios without sacrificing accuracy. Moreover, the analysis investigates the trade-offs associated with the utilization of quantum resources, robustness to noise, and orchestration costs.

•Mar 23, 2026•0 citations

Quantum Computing and Artificial Neural Network methods in approximating the Quantum Many-Body Fermion System for Modern Quantum Chemistry Applications

Chengze Yang

The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. 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 caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the 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.2,3 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.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.

•Nov 26, 2025•0 citations

Hybrid Quantum Classical Acceleration of Machine Learning Algorithms: A Performance Study

Mahesh V, Ramkumar Krishnamoorthy, Diwakara Vasuman M S +2 more

The recent rise in the number of data-intensive applications has revealed some inherent limitations of traditional machine learning, such as high training costs, slow convergence rates, and the uncapable of scalability of traditional machine learning in high-dimensional spaces. Bottlenecks are caused by the iterative optimization procedure, kernel evaluations, and similarity computations that are not efficiently supported by traditional hardware. Although recent advances in quantum computing, such as the Variational Quantum Algorithm, quantum kernels, and parameterized quantum circuits, hold promise for acceleration, the application of quantum speedup is presently hindered by noisy intermediate-scale quantum computing. This research provides a hybrid quantum-classical acceleration method that integrates quantum methods with selected computationally intensive components of classical machine learning systems rather than attempting to entirely replace them. Carried out a comprehensive analysis of the performance of well-known algorithms like Support Vector Machines, k-means clustering, and gradient-based neural networks in classical and quantum-assisted hybrid scenarios. The quantum resources are greatly beneficial for particular sub-tasks such as optimization, approximation of similarity, and exploration of the feature space, with the remaining learning process performed classically. Our analysis reveals that hybrid methods can offer a tangible acceleration and improved convergence behaviour in particular scenarios without sacrificing accuracy. Moreover, the analysis investigates the trade-offs associated with the utilization of quantum resources, robustness to noise, and orchestration costs.

EPJ Web of Conferences•Jan 1, 2026•0 citations

Quantum Computing and Artificial Neural Network methods in approximating the Quantum Many-Body Fermion System for Modern Quantum Chemistry Applications

Chengze Yang

The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. 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 caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the 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.2,3 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.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.

•Nov 21, 2025•0 citations
Simulating strongly correlated electrons in molecules and materials remains a central goal for quantum computing. A promising strategy uses quantum processors to prepare trial wavefunctions that guide classical quantum Monte Carlo (QMC). However, the enormous computational cost of repeatedly processing quantum measurements has severely limited the practical scalability of this approach. Here, we overcome this bottleneck by compressing quantum measurement data into machine-learning models that efficiently provide the wavefunction overlaps needed by QMC. This accelerates quantum-classical QMC by orders of magnitude, enabling chemically accurate simulations on up to 40 qubits, more than doubling the scale of previous hardware demonstrations with comparable accuracy. We demonstrate our approach on hydrogen chains and strongly correlated iron-sulfur clusters using measurements from Google's Willow processor. By enabling efficient reuse of quantum-state information on the classical coprocessor, our framework addresses a fundamental bottleneck in hybrid quantum algorithms that will persist even into the fault-tolerant era.
Abstract Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N2_22​ molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.
The recent rise in the number of data-intensive applications has revealed some inherent limitations of traditional machine learning, such as high training costs, slow convergence rates, and the uncapable of scalability of traditional machine learning in high-dimensional spaces. Bottlenecks are caused by the iterative optimization procedure, kernel evaluations, and similarity computations that are not efficiently supported by traditional hardware. Although recent advances in quantum computing, such as the Variational Quantum Algorithm, quantum kernels, and parameterized quantum circuits, hold promise for acceleration, the application of quantum speedup is presently hindered by noisy intermediate-scale quantum computing. This research provides a hybrid quantum-classical acceleration method that integrates quantum methods with selected computationally intensive components of classical machine learning systems rather than attempting to entirely replace them. Carried out a comprehensive analysis of the performance of well-known algorithms like Support Vector Machines, k-means clustering, and gradient-based neural networks in classical and quantum-assisted hybrid scenarios. The quantum resources are greatly beneficial for particular sub-tasks such as optimization, approximation of similarity, and exploration of the feature space, with the remaining learning process performed classically. Our analysis reveals that hybrid methods can offer a tangible acceleration and improved convergence behaviour in particular scenarios without sacrificing accuracy. Moreover, the analysis investigates the trade-offs associated with the utilization of quantum resources, robustness to noise, and orchestration costs.
The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. 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 caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the 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.2,3 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.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.
The recent rise in the number of data-intensive applications has revealed some inherent limitations of traditional machine learning, such as high training costs, slow convergence rates, and the uncapable of scalability of traditional machine learning in high-dimensional spaces. Bottlenecks are caused by the iterative optimization procedure, kernel evaluations, and similarity computations that are not efficiently supported by traditional hardware. Although recent advances in quantum computing, such as the Variational Quantum Algorithm, quantum kernels, and parameterized quantum circuits, hold promise for acceleration, the application of quantum speedup is presently hindered by noisy intermediate-scale quantum computing. This research provides a hybrid quantum-classical acceleration method that integrates quantum methods with selected computationally intensive components of classical machine learning systems rather than attempting to entirely replace them. Carried out a comprehensive analysis of the performance of well-known algorithms like Support Vector Machines, k-means clustering, and gradient-based neural networks in classical and quantum-assisted hybrid scenarios. The quantum resources are greatly beneficial for particular sub-tasks such as optimization, approximation of similarity, and exploration of the feature space, with the remaining learning process performed classically. Our analysis reveals that hybrid methods can offer a tangible acceleration and improved convergence behaviour in particular scenarios without sacrificing accuracy. Moreover, the analysis investigates the trade-offs associated with the utilization of quantum resources, robustness to noise, and orchestration costs.
The field of quantum chemistry has long been defined by the central computational challenge of the quantum many-body fermionic system problem, main the electronic Schrödinger equation. This exponential scaling makes it computationally intractable to solve, the exact governing electronic Schrödinger equation. 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 caused a trade-off between accuracy, leaving many systems—particularly those with strong electron correlation—beyond the reach of ab initio simulation. Furthermore, the famous fermionic sign oscillation problem is particularly severe in stochastic methods like Quantum Monte Carlo (QMC). 1 Traditional Ansätze are also frequently engineered specifically for particular systems, which results in a fragmentation of results and fundamentally limits the 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.2,3 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.2,4,5Furthermore, we explore the geometric foundation of high-efficiency optimization via the neural networks, which decouples optimization cost from model complexity.6 The frontier of the field is marked by the integration of operator learning and hybrid quantum-classical frameworks, such as Reinforcement Learning for contracted quantum eigen-solvers and Quantum-Enhanced Neural Networks, which leverage quantum processors to enhance expressivity for hardware-efficient Ansätze.7,8 By framing the problem through the lens of computational resource allocation—specifically, trading exponential memory demands for polynomialcomplexity optimization and sampling—this review elucidates how recent advances at the intersection of artificial neural networks and quantum computing have evolved. The emergence of those methods not merely progress into a powerful simulation-tools, but also a hybrid computational interface.9 This convergence offers a versatile and systematically improvable framework for potentially addressing some of the most challenging problems in quantum physics and chemistry.