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

Avoiding local minima in Variational Quantum Algorithms with Neural Networks

Javier Rivera-Dean, Patrick Huembeli, Antonio Acín, Joseph Bowles

Published Apr 7, 2021• 40 citations
arXivHTMLPDF

Abstract

Variational Quantum Algorithms have emerged as a leading paradigm for near-term quantum computation. In such algorithms, a parameterized quantum circuit is controlled via a classical optimization method that seeks to minimize a problem-dependent cost function. Although such algorithms are powerful in principle, the non-convexity of the associated cost landscapes and the prevalence of local minima means that local optimization methods such as gradient descent typically fail to reach good solutions. In this work we suggest a method to improve gradient-based approaches to variational quantum circuit optimization, which involves coupling the output of the quantum circuit to a classical neural network. The effect of this neural network is to peturb the cost landscape as a function of its parameters, so that local minima can be escaped or avoided via a modification to the cost landscape itself. We present two algorithms within this framework and numerically benchmark them on small instances of the Max-Cut optimization problem. We show that the method is able to reach deeper minima and lower cost values than standard gradient descent based approaches. Moreover, our algorithms require essentially the same number of quantum circuit evaluations per optimization step as the standard approach since, unlike the gradient with respect to the circuit, the neural network updates can be estimated in parallel via the backpropagation method. More generally, our approach suggests that relaxing the cost landscape is a fruitful path to improving near-term quantum computing algorithms.

DOI
10.48550/arxiv.2104.02955

Related papers

Learning to learn with quantum neural networks via classical neural networks

Guillaume Verdon, Michael Broughton, Jarrod R. McClean +5 more

Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Specifically, we train classical recurrent neural networks to find approximately optimal parameters within a small number of queries of the cost function for the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, QAOA for Sherrington-Kirkpatrick Ising model, and for a Variational Quantum Eigensolver for the Hubbard model. By initializing other optimizers at parameter values suggested by the classical neural network, we demonstrate a significant improvement in the total number of optimization iterations required to reach a given accuracy. We further demonstrate that the optimization strategies learned by the neural network generalize well across a range of problem instance sizes. This opens up the possibility of training on small, classically simulatable problem instances, in order to initialize larger, classically intractably simulatable problem instances on quantum devices, thereby significantly reducing the number of required quantum-classical optimization iterations.

arXiv:1907.05415•Jul 11, 2019•274 citations

Exponentially Many Local Minima in Quantum Neural Networks

Xuchen You, Xiaodi Wu

Quantum Neural Networks (QNNs), or the so-called variational quantum circuits, are important quantum applications both because of their similar promises as classical neural networks and because of the feasibility of their implementation on near-term intermediate-size noisy quantum machines (NISQ). However, the training task of QNNs is challenging and much less understood. We conduct a quantitative investigation on the landscape of loss functions of QNNs and identify a class of simple yet extremely hard QNN instances for training. Specifically, we show for typical under-parameterized QNNs, there exists a dataset that induces a loss function with the number of spurious local minima depending exponentially on the number of parameters. Moreover, we show the optimality of our construction by providing an almost matching upper bound on such dependence. While local minima in classical neural networks are due to non-linear activations, in quantum neural networks local minima appear as a result of the quantum interference phenomenon. Finally, we empirically confirm that our constructions can indeed be hard instances in practice with typical gradient-based optimizers, which demonstrates the practical value of our findings.

arXiv:2110.02479•International Conference on Machine Learning•Oct 6, 2021•32 citations

Next-Generation Optimization in Quantum and Hybrid Neural Frameworks

Sara Ali, Polla Fattah, Sanar Fawzi

The problem of the neural network optimization is local minima and flat areas. According to quantum-inspired methods, quantum mechanics, superposition, entanglement and interference are inspirational in order to possibly surpass these constraints in a more efficient manner. Variational quantum algorithms use parameterized quantum circuits parameterized quantum circuits (ansatz) to optimize weights. Quantum kernel methods also take advantage of quantum embeddings in order to transform features better. Hybrid quantum-classical systems incorporate quantum-inspired processing with already known reliability of optimization. There are, however, serious weaknesses that limit implementation. There are exponentially decreasing gradients due to the barren plateau phenomenon that makes it hard to train at scale. The modern quantum machines have a 0.1-1% error and a microsecond coherence time. The overheads in state preparation, the cost of measurement, circuit depth, and poor qubit connectivity are still impediments. The quantum-inspired classical algorithms, which include the tensor networks and optimization heuristics and run-on standard computers, are the most effective in the near future. These come with small advances in certain areas without involving quantum hardware. Although both quantum kernel methods and variational approaches show theoretical potential, the advantages are still small (relative to the advantages of optimized classical methods). Recent evaluations show that quantum benefits are more constrained than originally claimed them to be. Real quantum applications benefits in neural network optimization may only happen 10-20 years ahead, notwithstanding failure resistant quantum hardware and algorithm developments.

CRC Press eBooks•May 20, 2026•0 citations

Quantum Walk-Based Optimization of Deep Neural Networks

Jincheng Zhang

This paper investigates the potential of quantum walks to optimize deep neural networks. Traditional deep learning training relies on gradient descent methods, which can be computationally expensive and prone to getting trapped in local minima. We propose a novel approach utilizing a quantum walk algorithm to explore the loss landscape of a neural network more efficiently. The core idea involves mapping the loss surface of the network to a quantum walk environment, allowing the walker to simultaneously explore multiple possible updates, thereby increasing the chances of escaping local minima and converging to a global minimum. We formally define the quantum walk model and explore its potential advantages in terms of exploration and convergence speed. This work presents a theoretical framework and outlines a potential strategy for integrating quantum walk algorithms into the deep learning training process. The effectiveness of this approach hinges on the ability to accurately represent the complex loss surface of a deep neural network within a quantum mechanical framework.

•Aug 29, 2026•0 citations

Learning to Optimize Quantum Neural Networks Without Gradients

Ankit Kulshrestha, Xiaoyuan Liu, Hayato Ushijima‐Mwesigwa +1 more

Quantum Machine Learning is an emerging sub-field in machine learning where one of the goals is to perform pattern recognition tasks by encoding data into quantum states. This extension from classical to quantum domain has been made possible due to the development of hybrid quantum-classical algorithms that allow a parameterized quantum circuit to be optimized using gradient based algorithms that run on a classical computer. The similarities in training of these hybrid algorithms and classical neural networks has further led to the development of Quantum Neural Networks (QNNs). However, in the current training regime for QNNs, the gradients w.r. t objective function have to be computed on the quantum device. This computation is highly non-scalable and is affected by hardware and sampling noise present in the current generation of quantum hardware. In this paper, we propose a training algorithm that does not rely on gradient information. Specifically, we introduce a novel meta-optimization algorithm that trains a meta-optimizer network to output parameters for the quantum circuit such that the objective function is minimized. We empirically and theoretically show that we achieve a better quality minima in fewer circuit evaluations than existing gradient based algorithms on different datasets.

arXiv:2304.07442•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•9 citations

Quantum State Preparation via Neural Network Encoding in Quantum Machine Learning

Kevin W. Aoun, Florian J. Kiwit, Carlos A. Riofrío +4 more

A central challenge in quantum machine learning is the state preparation bottleneck that describes the prohibitive computational cost of loading high-dimensional classical data into a quantum state. Although amplitude encoding can represent $2^n$-dimensional data using only $n$ qubits in principle, preparing arbitrary states remains computationally expensive, typically requiring variational optimization of a parameterized quantum circuit for each individual data instance. In this work, we propose a method that avoids iterative optimization by training a classical neural network to map input data directly to the continuous parameters of a fixed quantum circuit. We demonstrate the generation of quantum image states with high fidelity on data not seen during training. Since all optimization is performed once during training, the resulting model encodes new inputs in a single inference step, providing a scalable pathway for data loading in near-term quantum algorithms. We validate our method on the MNIST and Fashion-MNIST datasets, achieving fidelities up to 0.992 on unseen images and reducing the per-data-instance runtime by more than 5000-fold.

quant-pharXiv:2605.31006•Jun 1, 2026•0 citations
Variational Quantum Algorithms have emerged as a leading paradigm for near-term quantum computation. In such algorithms, a parameterized quantum circuit is controlled via a classical optimization method that seeks to minimize a problem-dependent cost function. Although such algorithms are powerful in principle, the non-convexity of the associated cost landscapes and the prevalence of local minima means that local optimization methods such as gradient descent typically fail to reach good solutions. In this work we suggest a method to improve gradient-based approaches to variational quantum circuit optimization, which involves coupling the output of the quantum circuit to a classical neural network. The effect of this neural network is to peturb the cost landscape as a function of its parameters, so that local minima can be escaped or avoided via a modification to the cost landscape itself. We present two algorithms within this framework and numerically benchmark them on small instances of the Max-Cut optimization problem. We show that the method is able to reach deeper minima and lower cost values than standard gradient descent based approaches. Moreover, our algorithms require essentially the same number of quantum circuit evaluations per optimization step as the standard approach since, unlike the gradient with respect to the circuit, the neural network updates can be estimated in parallel via the backpropagation method. More generally, our approach suggests that relaxing the cost landscape is a fruitful path to improving near-term quantum computing algorithms.
Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Specifically, we train classical recurrent neural networks to find approximately optimal parameters within a small number of queries of the cost function for the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, QAOA for Sherrington-Kirkpatrick Ising model, and for a Variational Quantum Eigensolver for the Hubbard model. By initializing other optimizers at parameter values suggested by the classical neural network, we demonstrate a significant improvement in the total number of optimization iterations required to reach a given accuracy. We further demonstrate that the optimization strategies learned by the neural network generalize well across a range of problem instance sizes. This opens up the possibility of training on small, classically simulatable problem instances, in order to initialize larger, classically intractably simulatable problem instances on quantum devices, thereby significantly reducing the number of required quantum-classical optimization iterations.
Quantum Neural Networks (QNNs), or the so-called variational quantum circuits, are important quantum applications both because of their similar promises as classical neural networks and because of the feasibility of their implementation on near-term intermediate-size noisy quantum machines (NISQ). However, the training task of QNNs is challenging and much less understood. We conduct a quantitative investigation on the landscape of loss functions of QNNs and identify a class of simple yet extremely hard QNN instances for training. Specifically, we show for typical under-parameterized QNNs, there exists a dataset that induces a loss function with the number of spurious local minima depending exponentially on the number of parameters. Moreover, we show the optimality of our construction by providing an almost matching upper bound on such dependence. While local minima in classical neural networks are due to non-linear activations, in quantum neural networks local minima appear as a result of the quantum interference phenomenon. Finally, we empirically confirm that our constructions can indeed be hard instances in practice with typical gradient-based optimizers, which demonstrates the practical value of our findings.
The problem of the neural network optimization is local minima and flat areas. According to quantum-inspired methods, quantum mechanics, superposition, entanglement and interference are inspirational in order to possibly surpass these constraints in a more efficient manner. Variational quantum algorithms use parameterized quantum circuits parameterized quantum circuits (ansatz) to optimize weights. Quantum kernel methods also take advantage of quantum embeddings in order to transform features better. Hybrid quantum-classical systems incorporate quantum-inspired processing with already known reliability of optimization. There are, however, serious weaknesses that limit implementation. There are exponentially decreasing gradients due to the barren plateau phenomenon that makes it hard to train at scale. The modern quantum machines have a 0.1-1% error and a microsecond coherence time. The overheads in state preparation, the cost of measurement, circuit depth, and poor qubit connectivity are still impediments. The quantum-inspired classical algorithms, which include the tensor networks and optimization heuristics and run-on standard computers, are the most effective in the near future. These come with small advances in certain areas without involving quantum hardware. Although both quantum kernel methods and variational approaches show theoretical potential, the advantages are still small (relative to the advantages of optimized classical methods). Recent evaluations show that quantum benefits are more constrained than originally claimed them to be. Real quantum applications benefits in neural network optimization may only happen 10-20 years ahead, notwithstanding failure resistant quantum hardware and algorithm developments.
This paper investigates the potential of quantum walks to optimize deep neural networks. Traditional deep learning training relies on gradient descent methods, which can be computationally expensive and prone to getting trapped in local minima. We propose a novel approach utilizing a quantum walk algorithm to explore the loss landscape of a neural network more efficiently. The core idea involves mapping the loss surface of the network to a quantum walk environment, allowing the walker to simultaneously explore multiple possible updates, thereby increasing the chances of escaping local minima and converging to a global minimum. We formally define the quantum walk model and explore its potential advantages in terms of exploration and convergence speed. This work presents a theoretical framework and outlines a potential strategy for integrating quantum walk algorithms into the deep learning training process. The effectiveness of this approach hinges on the ability to accurately represent the complex loss surface of a deep neural network within a quantum mechanical framework.
Quantum Machine Learning is an emerging sub-field in machine learning where one of the goals is to perform pattern recognition tasks by encoding data into quantum states. This extension from classical to quantum domain has been made possible due to the development of hybrid quantum-classical algorithms that allow a parameterized quantum circuit to be optimized using gradient based algorithms that run on a classical computer. The similarities in training of these hybrid algorithms and classical neural networks has further led to the development of Quantum Neural Networks (QNNs). However, in the current training regime for QNNs, the gradients w.r. t objective function have to be computed on the quantum device. This computation is highly non-scalable and is affected by hardware and sampling noise present in the current generation of quantum hardware. In this paper, we propose a training algorithm that does not rely on gradient information. Specifically, we introduce a novel meta-optimization algorithm that trains a meta-optimizer network to output parameters for the quantum circuit such that the objective function is minimized. We empirically and theoretically show that we achieve a better quality minima in fewer circuit evaluations than existing gradient based algorithms on different datasets.
A central challenge in quantum machine learning is the state preparation bottleneck that describes the prohibitive computational cost of loading high-dimensional classical data into a quantum state. Although amplitude encoding can represent 2n2^n2n-dimensional data using only nnn qubits in principle, preparing arbitrary states remains computationally expensive, typically requiring variational optimization of a parameterized quantum circuit for each individual data instance. In this work, we propose a method that avoids iterative optimization by training a classical neural network to map input data directly to the continuous parameters of a fixed quantum circuit. We demonstrate the generation of quantum image states with high fidelity on data not seen during training. Since all optimization is performed once during training, the resulting model encodes new inputs in a single inference step, providing a scalable pathway for data loading in near-term quantum algorithms. We validate our method on the MNIST and Fashion-MNIST datasets, achieving fidelities up to 0.992 on unseen images and reducing the per-data-instance runtime by more than 5000-fold.