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:2411.15667

NN-AE-VQE: Neural network parameter prediction on autoencoded variational quantum eigensolvers

Koen J. Mesman, Yinglu Tang, Matthias Möller, Boyang Chen, Sebastian Feld

Published Nov 23, 2024• 5 citations
arXivHTMLPDF

Abstract

A longstanding computational challenge is the accurate simulation of many-body particle systems. Especially for deriving key characteristics of high-impact but complex systems such as battery materials and high entropy alloys (HEA). While simple models allow for simulations of the required scale, these methods often fail to capture the complex dynamics that determine the characteristics. A long-theorized approach is to use quantum computers for this purpose, which allows for a more efficient encoding of quantum mechanical systems. In recent years, the field of quantum computing has become significantly more mature. Furthermore, the rise in integration of machine learning with quantum computing further pushes to a near-term advantage. In this work we aim to improve the well-established quantum computing method for calculating the inter-atomic potential, the variational quantum eigensolver, by presenting an auto-encoded VQE with neural-network predictions: NN-AE-VQE. We apply a quantum autoencoder for a compressed quantum state representation of the atomic system, to which a naive circuit ansatz is applied. This reduces the number of circuit parameters to optimize, while still minimal reduction in accuracy. Additionally, we train a classical neural network to predict the circuit parameters to avoid computationally expensive parameter optimization. We demonstrate these methods on a H2 molecule, achieving chemical accuracy. We believe this method shows promise of efficiently capturing highly accurate systems while omitting current bottlenecks of variational quantum algorithms. Finally, we explore options for exploiting the algorithm structure and further algorithm improvements.

DOI
10.48550/arxiv.2411.15667

Related papers

Neural-network-encoded variational quantum algorithms

Jiaqi Miao, Chang‐Yu Hsieh, Shi‐Xin Zhang

We introduce a general framework called neural-network- (NN) encoded variational quantum algorithms (VQAs), or NNVQA for short, to address the challenges of implementing VQAs on noisy intermediate-scale quantum (NISQ) computers. Specifically, NNVQA feeds input (such as parameters of a Hamiltonian) from a given problem to a neural network and uses its outputs to parameterize an ansatz circuit for the standard VQA. Combining the strengths of NN and parameterized quantum circuits, NNVQA can accelerate the training process of VQAs and handle a broad family of related problems with varying input parameters with the pretrained NN. To concretely illustrate the merits of NNVQA, we present results on a NN variational quantum eigensolver (VQE) for solving the ground state of parameterized $XXZ$ spin models in one and two dimensions. Our results demonstrate that NNVQE is able to estimate the ground-state energies of parameterized Hamiltonians with high precision without fine tuning, and significantly reduce the overall training cost to estimate ground-state properties across the phases of the given Hamiltonian. We also employ an active learning strategy to further increase the training efficiency while maintaining prediction accuracy. These encouraging results demonstrate that NNVQAs offer an alternative hybrid quantum-classical paradigm to utilize NISQ resources for solving more realistic and challenging computational problems.

arXiv:2308.01068•Physical Review Applied•Jan 26, 2024•30 citations

Exploring Accurate Potential Energy Surfaces via Integrating Variational Quantum Eigensolver with Machine Learning

Yanxian Tao, Xiongzhi Zeng, Yi Fan +3 more

The potential energy surface (PES) is crucial for interpreting a variety of chemical reaction processes. However, predicting accurate PESs with high-level electronic structure methods is a challenging task due to the high computational cost. As an appealing application of quantum computing, we show in this work that variational quantum algorithms can be integrated with machine learning (ML) techniques as a promising scheme for exploring accurate PESs. Different from using a ML model to represent the potential energy, we encode the molecular geometry information into a deep neural network (DNN) to represent parameters of the variational quantum eigensolver (VQE), leaving the PES to the wave function ansatz. Once the DNN model is trained, the variational optimization procedure that hinders the application of the VQE to complex systems is avoided, and thus the evaluation of PESs is significantly accelerated. Numerical results demonstrate that a simple DNN model is able to reproduce accurate PESs for small molecules.

arXiv:2206.03637•The Journal of Physical Chemistry Letters•Jul 11, 2022•19 citations

Variational denoising for variational quantum eigensolver

Quoc Hoan Tran, Shinji Kikuchi, Hirotaka Oshima

The variational quantum eigensolver (VQE) is a hybrid algorithm that has the potential to provide a quantum advantage in practical chemistry problems that are currently intractable on classical computers. VQE trains parameterized quantum circuits using a classical optimizer to approximate the eigenvalues and eigenstates of a given Hamiltonian. However, VQE faces challenges in task-specific design and machine-specific architecture, particularly when running on noisy quantum devices. This can have a negative impact on its trainability, accuracy, and efficiency, resulting in noisy quantum data. We propose variational denoising, an unsupervised learning method that employs a parameterized quantum neural network to improve the solution of VQE by learning from noisy VQE outputs. Our approach can significantly decrease energy estimation errors and increase fidelities with ground states compared to noisy input data for the H2 , LiH, and BeH2 molecular Hamiltonians and the transverse field Ising model. Surprisingly, it only requires noisy data for training. Variational denoising can be integrated into quantum hardware, increasing its versatility as an end-to-end quantum processing for quantum data. Published by the American Physical Society 2024

arXiv:2304.00549•Physical Review Research•May 17, 2024•10 citations

Improving Generalization and Trainability of Quantum Eigensolvers via Graph Neural Encoding

Jungyun Lee, Daniel K. Park

Determining the ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and combinatorial optimization, yet it is often classically intractable due to the exponential growth of Hilbert space with system size. Even on fault-tolerant quantum computers, quantum algorithms with convergence guarantees -- such as quantum phase estimation and quantum subspace methods -- require an initial state with sufficiently large overlap with the true ground state to be effective. Variational quantum eigensolvers (VQEs) are natural candidates for preparing such states; however, standard VQEs typically exhibit poor generalization, requiring retraining for each Hamiltonian instance, and often suffer from barren plateaus, where gradients can vanish exponentially with circuit depth and system size. To address these limitations, we propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network to generate VQE parameters that generalize across Hamiltonian instances. By encoding interaction topology and coupling structure, the proposed model produces high-overlap initial states without instance-specific optimization. Through extensive numerical experiments on families of one- and two-local Hamiltonians, we demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance. We further show that our method substantially accelerates convergence in quantum subspace-based eigensolvers, highlighting its practical impact for downstream quantum algorithms.

quant-pharXiv:2602.19752•Machine Learning Science and Technology•Feb 24, 2026•1 citation

Efficient Optimization of Variational Quantum Algorithms via Gradient-Free Parameter Prediction

Satwik Kundu, Debarshi Kundu, Swaroop Ghosh

The exponential runtime of quantum simulators on classical machines, along with long queue times and high costs associated with real quantum devices, presents significant challenges for the efficient optimization of Variational Quantum Algorithms (VQAs) such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Neural Networks (QNNs). To address these limitations, we propose a novel approach, DyPP (Dynamic Parameter Prediction), which accelerates the convergence of VQAs by leveraging regular trends in the parameter weights to update parameters efficiently. We introduce two techniques for optimal prediction performance: Naive Prediction (NaP) and Adaptive Prediction (AdaP). Through extensive experimentation and training of multiple QNN models on various datasets, we demonstrate that DyPP achieves a speedup of approximately 2.25×compared to standard training methods, while also providing improved accuracy (up to 2.3% higher) and lower loss (up to 6.1% reduction) with minimal storage and computational overhead. We further evaluate DyPP’s effectiveness in VQE for molecular ground-state energy estimation and in QAOA for graph MaxCut. Our results show that, on average, DyPP leads to a speedup of up to 3.1× for VQE and 2.91× for QAOA compared to traditional optimization, while requiring up to 3.3× fewer shots (i.e., repeated circuit executions). Even in the presence of hardware noise, DyPP outperforms existing optimization techniques, delivering up to 3.33× speedup and requiring 2.5× fewer shots, thereby enhancing the efficiency of VQAs.

arXiv:2307.12449•IEEE Access•Jan 1, 2026•2 citations

Integrating quantum neural networks with the variational quantum eigensolver to calculate nonadiabatic coupling vectors

S F Zhang, Zhen Liu, Zhenyu Li

Machine learning nonadiabatic coupling vectors (NACVs) is challenging due to the localized value problem and the sign problem. In this study, we integrate quantum neural networks (QNNs) with the variational quantum eigensolver (VQE) to predict NACVs at different molecular geometries. Parameterized quantum circuits provide a compact and expressive representation of wavefunctions, and VQE offers an efficient way of optimizing such circuit-based Ansätze. Instead of optimizing them at all geometries, QNNs are used to learn parameters of the VQE wavefunctions. Then, NACVs are directly computed from the wavefunctions. In order to meet the high fidelity requirement of wavefunctions for accurate NACV calculations, we introduce a bootstrap optimization procedure in pre-training of the model that supplies robust initial parameters obtained by sequentially scanning the potential energy surface (PES). We demonstrate that this QNN-VQE framework effectively circumvents the localized value and sign problems, providing a unified and efficient protocol for the simultaneous determination of PESs and NACVs.

The Journal of Chemical Physics•May 4, 2026•0 citations
A longstanding computational challenge is the accurate simulation of many-body particle systems. Especially for deriving key characteristics of high-impact but complex systems such as battery materials and high entropy alloys (HEA). While simple models allow for simulations of the required scale, these methods often fail to capture the complex dynamics that determine the characteristics. A long-theorized approach is to use quantum computers for this purpose, which allows for a more efficient encoding of quantum mechanical systems. In recent years, the field of quantum computing has become significantly more mature. Furthermore, the rise in integration of machine learning with quantum computing further pushes to a near-term advantage. In this work we aim to improve the well-established quantum computing method for calculating the inter-atomic potential, the variational quantum eigensolver, by presenting an auto-encoded VQE with neural-network predictions: NN-AE-VQE. We apply a quantum autoencoder for a compressed quantum state representation of the atomic system, to which a naive circuit ansatz is applied. This reduces the number of circuit parameters to optimize, while still minimal reduction in accuracy. Additionally, we train a classical neural network to predict the circuit parameters to avoid computationally expensive parameter optimization. We demonstrate these methods on a H2 molecule, achieving chemical accuracy. We believe this method shows promise of efficiently capturing highly accurate systems while omitting current bottlenecks of variational quantum algorithms. Finally, we explore options for exploiting the algorithm structure and further algorithm improvements.
We introduce a general framework called neural-network- (NN) encoded variational quantum algorithms (VQAs), or NNVQA for short, to address the challenges of implementing VQAs on noisy intermediate-scale quantum (NISQ) computers. Specifically, NNVQA feeds input (such as parameters of a Hamiltonian) from a given problem to a neural network and uses its outputs to parameterize an ansatz circuit for the standard VQA. Combining the strengths of NN and parameterized quantum circuits, NNVQA can accelerate the training process of VQAs and handle a broad family of related problems with varying input parameters with the pretrained NN. To concretely illustrate the merits of NNVQA, we present results on a NN variational quantum eigensolver (VQE) for solving the ground state of parameterized XXZXXZXXZ spin models in one and two dimensions. Our results demonstrate that NNVQE is able to estimate the ground-state energies of parameterized Hamiltonians with high precision without fine tuning, and significantly reduce the overall training cost to estimate ground-state properties across the phases of the given Hamiltonian. We also employ an active learning strategy to further increase the training efficiency while maintaining prediction accuracy. These encouraging results demonstrate that NNVQAs offer an alternative hybrid quantum-classical paradigm to utilize NISQ resources for solving more realistic and challenging computational problems.
The potential energy surface (PES) is crucial for interpreting a variety of chemical reaction processes. However, predicting accurate PESs with high-level electronic structure methods is a challenging task due to the high computational cost. As an appealing application of quantum computing, we show in this work that variational quantum algorithms can be integrated with machine learning (ML) techniques as a promising scheme for exploring accurate PESs. Different from using a ML model to represent the potential energy, we encode the molecular geometry information into a deep neural network (DNN) to represent parameters of the variational quantum eigensolver (VQE), leaving the PES to the wave function ansatz. Once the DNN model is trained, the variational optimization procedure that hinders the application of the VQE to complex systems is avoided, and thus the evaluation of PESs is significantly accelerated. Numerical results demonstrate that a simple DNN model is able to reproduce accurate PESs for small molecules.
The variational quantum eigensolver (VQE) is a hybrid algorithm that has the potential to provide a quantum advantage in practical chemistry problems that are currently intractable on classical computers. VQE trains parameterized quantum circuits using a classical optimizer to approximate the eigenvalues and eigenstates of a given Hamiltonian. However, VQE faces challenges in task-specific design and machine-specific architecture, particularly when running on noisy quantum devices. This can have a negative impact on its trainability, accuracy, and efficiency, resulting in noisy quantum data. We propose variational denoising, an unsupervised learning method that employs a parameterized quantum neural network to improve the solution of VQE by learning from noisy VQE outputs. Our approach can significantly decrease energy estimation errors and increase fidelities with ground states compared to noisy input data for the H2 , LiH, and BeH2 molecular Hamiltonians and the transverse field Ising model. Surprisingly, it only requires noisy data for training. Variational denoising can be integrated into quantum hardware, increasing its versatility as an end-to-end quantum processing for quantum data. Published by the American Physical Society 2024
Determining the ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and combinatorial optimization, yet it is often classically intractable due to the exponential growth of Hilbert space with system size. Even on fault-tolerant quantum computers, quantum algorithms with convergence guarantees -- such as quantum phase estimation and quantum subspace methods -- require an initial state with sufficiently large overlap with the true ground state to be effective. Variational quantum eigensolvers (VQEs) are natural candidates for preparing such states; however, standard VQEs typically exhibit poor generalization, requiring retraining for each Hamiltonian instance, and often suffer from barren plateaus, where gradients can vanish exponentially with circuit depth and system size. To address these limitations, we propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network to generate VQE parameters that generalize across Hamiltonian instances. By encoding interaction topology and coupling structure, the proposed model produces high-overlap initial states without instance-specific optimization. Through extensive numerical experiments on families of one- and two-local Hamiltonians, we demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance. We further show that our method substantially accelerates convergence in quantum subspace-based eigensolvers, highlighting its practical impact for downstream quantum algorithms.
The exponential runtime of quantum simulators on classical machines, along with long queue times and high costs associated with real quantum devices, presents significant challenges for the efficient optimization of Variational Quantum Algorithms (VQAs) such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Neural Networks (QNNs). To address these limitations, we propose a novel approach, DyPP (Dynamic Parameter Prediction), which accelerates the convergence of VQAs by leveraging regular trends in the parameter weights to update parameters efficiently. We introduce two techniques for optimal prediction performance: Naive Prediction (NaP) and Adaptive Prediction (AdaP). Through extensive experimentation and training of multiple QNN models on various datasets, we demonstrate that DyPP achieves a speedup of approximately 2.25×compared to standard training methods, while also providing improved accuracy (up to 2.3% higher) and lower loss (up to 6.1% reduction) with minimal storage and computational overhead. We further evaluate DyPP’s effectiveness in VQE for molecular ground-state energy estimation and in QAOA for graph MaxCut. Our results show that, on average, DyPP leads to a speedup of up to 3.1× for VQE and 2.91× for QAOA compared to traditional optimization, while requiring up to 3.3× fewer shots (i.e., repeated circuit executions). Even in the presence of hardware noise, DyPP outperforms existing optimization techniques, delivering up to 3.33× speedup and requiring 2.5× fewer shots, thereby enhancing the efficiency of VQAs.
Machine learning nonadiabatic coupling vectors (NACVs) is challenging due to the localized value problem and the sign problem. In this study, we integrate quantum neural networks (QNNs) with the variational quantum eigensolver (VQE) to predict NACVs at different molecular geometries. Parameterized quantum circuits provide a compact and expressive representation of wavefunctions, and VQE offers an efficient way of optimizing such circuit-based Ansätze. Instead of optimizing them at all geometries, QNNs are used to learn parameters of the VQE wavefunctions. Then, NACVs are directly computed from the wavefunctions. In order to meet the high fidelity requirement of wavefunctions for accurate NACV calculations, we introduce a bootstrap optimization procedure in pre-training of the model that supplies robust initial parameters obtained by sequentially scanning the potential energy surface (PES). We demonstrate that this QNN-VQE framework effectively circumvents the localized value and sign problems, providing a unified and efficient protocol for the simultaneous determination of PESs and NACVs.