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

Toward Neural Network Simulation of Variational Quantum Algorithms

Oliver Knitter, JAMES M. STOKES, Shravan Veerapaneni

Published Nov 5, 2022• 1 citation
arXivHTMLPDF

Abstract

Variational quantum algorithms (VQAs) utilize a hybrid quantum-classical architecture to recast problems of high-dimensional linear algebra as ones of stochastic optimization. Despite the promise of leveraging near- to intermediate-term quantum resources to accelerate this task, the computational advantage of VQAs over wholly classical algorithms has not been firmly established. For instance, while the variational quantum eigensolver (VQE) has been developed to approximate low-lying eigenmodes of high-dimensional sparse linear operators, analogous classical optimization algorithms exist in the variational Monte Carlo (VMC) literature, utilizing neural networks in place of quantum circuits to represent quantum states. In this paper we ask if classical stochastic optimization algorithms can be constructed paralleling other VQAs, focusing on the example of the variational quantum linear solver (VQLS). We find that such a construction can be applied to the VQLS, yielding a paradigm that could theoretically extend to other VQAs of similar form.

DOI
10.48550/arxiv.2211.02929

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•25 citations

Surrogate optimization of variational quantum circuits

Erik Gustafson, Juha Tiihonen, Diana Chamaki +8 more

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

arXiv:2404.02951•Apr 3, 2024•3 citations

A Variational Quantum Algorithm Based on Quantum Convolutional Neural Networks

Yichang LI, Tingting Song

Leveraging the principles of quantum mechanics—specifically superposition and parallelism— quantum computation holds the potential to surpass the computational power limitations of classical computers. However, due to constraints such as the limited number of available qubits and the presence of decoherence noise in quantum hardware, designing efficient quantum algorithms capable of running on Noisy Intermediate-Scale Quantum (NISQ) devices has become a pivotal research focus. The Variational Quantum Algorithm (VQA) represents a hybrid quantum-classical computational paradigm that is executable on NISQ devices and can potentially demonstrate quantum advantage. In VQAs, the loss function is evaluated on a quantum computer, optimized by a classical computer, and the updated parameters are subsequently fed back to the quantum circuit for the next iteration. The Quantum Convolutional Neural Network (QCNN) is a prominent implementation within the VQA framework. It performs convolutional and pooling operations via Parameterized Quantum Circuits (PQCs) , endowing it with potentially superior feature extraction capabilities compared to its classical convolutional neural network counterparts. This paper begins with the foundational theories of quantum computing, provides a detailed exposition of the VQA workflow and QCNN architecture, and summarizes VQAs based on PQCs. It then reviews recent research progress on QCNNs from a practical application standpoint and concludes by outlining current challenges and future research directions.

Bulletin of Chinese Applied Mathematics•Mar 28, 2026•0 citations

Can Variational Quantum Algorithms Demonstrate Quantum Advantages? Time Really Matters

Huanyu Liu, Zhaoyun Chen, Tai‐Ping Sun +3 more

Applying low-depth quantum neural networks (QNNs), variational quantum algorithms (VQAs) are both promising and challenging in the noisy intermediate-scale quantum (NISQ) era: Despite its remarkable progress, criticisms on the efficiency and feasibility issues never stopped. However, whether VQAs can demonstrate quantum advantages is still undetermined till now, which will be investigated in this paper. First, we will prove that there exists a dependency between the parameter number and the gradient-evaluation cost when training QNNs. Noticing there is no such direct dependency when training classical neural networks with the backpropagation algorithm, we argue that such a dependency limits the scalability of VQAs. Second, we estimate the time for running VQAs in ideal cases, i.e., without considering realistic limitations like noise and reachability. We will show that the ideal time cost easily reaches the order of a 1-year wall time. Third, by comparing with the time cost using classical simulation of quantum circuits, we will show that VQAs can only outperform the classical simulation case when the time cost reaches the scaling of $10^0$-$10^2$ years. Finally, based on the above results, we argue that it would be difficult for VQAs to outperform classical cases in view of time scaling, and therefore, demonstrate quantum advantages, with the current workflow. Since VQAs as well as quantum computing are developing rapidly, this work does not aim to deny the potential of VQAs. The analysis in this paper provides directions for optimizing VQAs, and in the long run, seeking more natural hybrid quantum-classical algorithms would be meaningful.

arXiv:2307.04089•Jul 9, 2023•0 citations

Variational Quantum-Neural Hybrid Eigensolver

Shi‐Xin Zhang, Zhou‐Quan Wan, Chee‐Kong Lee +3 more

The variational quantum eigensolver (VQE) is one of the most representative quantum algorithms in the noisy intermediate-scale quantum (NISQ) era, and is generally speculated to deliver one of the first quantum advantages for the ground-state simulations of some nontrivial Hamiltonians. However, short quantum coherence time and limited availability of quantum hardware resources in the NISQ hardware strongly restrain the capacity and expressiveness of VQEs. In this Letter, we introduce the variational quantum-neural hybrid eigensolver (VQNHE) in which the shallow-circuit quantum Ansatz can be further enhanced by classical post-processing with neural networks. We show that the VQNHE consistently and significantly outperforms the VQE in simulating ground-state energies of quantum spins and molecules given the same amount of quantum resources. More importantly, we demonstrate that, for arbitrary postprocessing neural functions, the VQNHE only incurs a polynomial overhead of processing time and represents the first scalable method to exponentially accelerate the VQE with nonunitary postprocessing that can be efficiently implemented in the NISQ era.

arXiv:2106.05105•Physical Review Letters•Mar 24, 2022•56 citations

Faster variational quantum algorithms with quantum kernel-based surrogate models

Alistair W. R. Smith, A. J. Paige, M S Kim

Abstract We present a new optimization strategy for small-to-intermediate scale variational quantum algorithms (VQAs) on noisy near-term quantum processors which uses a Gaussian process surrogate model equipped with a classically-evaluated quantum kernel. VQAs are typically optimized using gradient-based approaches however these are difficult to implement on current noisy devices, requiring large numbers of objective function evaluations. Our approach shifts this computational burden onto the classical optimizer component of these hybrid algorithms, greatly reducing the number of quantum circuit evaluations required from the quantum processor. We focus on the variational quantum eigensolver (VQE) algorithm and demonstrate numerically that these surrogate models are particularly well suited to the algorithm’s objective function. Next, we apply these models to both noiseless and noisy VQE simulations and show that they exhibit better performance than widely-used classical kernels in terms of final accuracy and convergence speed. Compared to the typically-used stochastic gradient-descent approach to VQAs, our quantum kernel-based approach is found to consistently achieve significantly higher accuracy while requiring less than an order of magnitude fewer quantum circuit executions. We analyze the performance of the quantum kernel-based models in terms of the kernels’ induced feature spaces and explicitly construct their feature maps. Finally, we describe a scheme for approximating the best-performing quantum kernel using a classically-efficient tensor network representation of its input state and so provide a pathway for scaling this strategy to larger systems.

arXiv:2211.01134•Quantum Science and Technology•Jul 28, 2023•10 citations
Variational quantum algorithms (VQAs) utilize a hybrid quantum-classical architecture to recast problems of high-dimensional linear algebra as ones of stochastic optimization. Despite the promise of leveraging near- to intermediate-term quantum resources to accelerate this task, the computational advantage of VQAs over wholly classical algorithms has not been firmly established. For instance, while the variational quantum eigensolver (VQE) has been developed to approximate low-lying eigenmodes of high-dimensional sparse linear operators, analogous classical optimization algorithms exist in the variational Monte Carlo (VMC) literature, utilizing neural networks in place of quantum circuits to represent quantum states. In this paper we ask if classical stochastic optimization algorithms can be constructed paralleling other VQAs, focusing on the example of the variational quantum linear solver (VQLS). We find that such a construction can be applied to the VQLS, yielding a paradigm that could theoretically extend to other VQAs of similar form.
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.
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.
Leveraging the principles of quantum mechanics—specifically superposition and parallelism— quantum computation holds the potential to surpass the computational power limitations of classical computers. However, due to constraints such as the limited number of available qubits and the presence of decoherence noise in quantum hardware, designing efficient quantum algorithms capable of running on Noisy Intermediate-Scale Quantum (NISQ) devices has become a pivotal research focus. The Variational Quantum Algorithm (VQA) represents a hybrid quantum-classical computational paradigm that is executable on NISQ devices and can potentially demonstrate quantum advantage. In VQAs, the loss function is evaluated on a quantum computer, optimized by a classical computer, and the updated parameters are subsequently fed back to the quantum circuit for the next iteration. The Quantum Convolutional Neural Network (QCNN) is a prominent implementation within the VQA framework. It performs convolutional and pooling operations via Parameterized Quantum Circuits (PQCs) , endowing it with potentially superior feature extraction capabilities compared to its classical convolutional neural network counterparts. This paper begins with the foundational theories of quantum computing, provides a detailed exposition of the VQA workflow and QCNN architecture, and summarizes VQAs based on PQCs. It then reviews recent research progress on QCNNs from a practical application standpoint and concludes by outlining current challenges and future research directions.
Applying low-depth quantum neural networks (QNNs), variational quantum algorithms (VQAs) are both promising and challenging in the noisy intermediate-scale quantum (NISQ) era: Despite its remarkable progress, criticisms on the efficiency and feasibility issues never stopped. However, whether VQAs can demonstrate quantum advantages is still undetermined till now, which will be investigated in this paper. First, we will prove that there exists a dependency between the parameter number and the gradient-evaluation cost when training QNNs. Noticing there is no such direct dependency when training classical neural networks with the backpropagation algorithm, we argue that such a dependency limits the scalability of VQAs. Second, we estimate the time for running VQAs in ideal cases, i.e., without considering realistic limitations like noise and reachability. We will show that the ideal time cost easily reaches the order of a 1-year wall time. Third, by comparing with the time cost using classical simulation of quantum circuits, we will show that VQAs can only outperform the classical simulation case when the time cost reaches the scaling of 10010^0100-10210^2102 years. Finally, based on the above results, we argue that it would be difficult for VQAs to outperform classical cases in view of time scaling, and therefore, demonstrate quantum advantages, with the current workflow. Since VQAs as well as quantum computing are developing rapidly, this work does not aim to deny the potential of VQAs. The analysis in this paper provides directions for optimizing VQAs, and in the long run, seeking more natural hybrid quantum-classical algorithms would be meaningful.
The variational quantum eigensolver (VQE) is one of the most representative quantum algorithms in the noisy intermediate-scale quantum (NISQ) era, and is generally speculated to deliver one of the first quantum advantages for the ground-state simulations of some nontrivial Hamiltonians. However, short quantum coherence time and limited availability of quantum hardware resources in the NISQ hardware strongly restrain the capacity and expressiveness of VQEs. In this Letter, we introduce the variational quantum-neural hybrid eigensolver (VQNHE) in which the shallow-circuit quantum Ansatz can be further enhanced by classical post-processing with neural networks. We show that the VQNHE consistently and significantly outperforms the VQE in simulating ground-state energies of quantum spins and molecules given the same amount of quantum resources. More importantly, we demonstrate that, for arbitrary postprocessing neural functions, the VQNHE only incurs a polynomial overhead of processing time and represents the first scalable method to exponentially accelerate the VQE with nonunitary postprocessing that can be efficiently implemented in the NISQ era.
Abstract We present a new optimization strategy for small-to-intermediate scale variational quantum algorithms (VQAs) on noisy near-term quantum processors which uses a Gaussian process surrogate model equipped with a classically-evaluated quantum kernel. VQAs are typically optimized using gradient-based approaches however these are difficult to implement on current noisy devices, requiring large numbers of objective function evaluations. Our approach shifts this computational burden onto the classical optimizer component of these hybrid algorithms, greatly reducing the number of quantum circuit evaluations required from the quantum processor. We focus on the variational quantum eigensolver (VQE) algorithm and demonstrate numerically that these surrogate models are particularly well suited to the algorithm’s objective function. Next, we apply these models to both noiseless and noisy VQE simulations and show that they exhibit better performance than widely-used classical kernels in terms of final accuracy and convergence speed. Compared to the typically-used stochastic gradient-descent approach to VQAs, our quantum kernel-based approach is found to consistently achieve significantly higher accuracy while requiring less than an order of magnitude fewer quantum circuit executions. We analyze the performance of the quantum kernel-based models in terms of the kernels’ induced feature spaces and explicitly construct their feature maps. Finally, we describe a scheme for approximating the best-performing quantum kernel using a classically-efficient tensor network representation of its input state and so provide a pathway for scaling this strategy to larger systems.