arXiv:1907.05415

Learning to learn with quantum neural networks via classical neural networks

Guillaume Verdon, Michael Broughton, Jarrod R. McClean, Kevin J. Sung, Ryan Babbush, Jiang Zhang, Hartmut Neven, Masoud Mohseni

Published Jul 11, 2019• 134 citations

arXiv HTML PDF

Abstract

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.

DOI: 10.48550/arxiv.1907.05415

Related papers

Learning to Learn With Quantum Optimization Via Quantum Neural Networks

Kuan‐Cheng Chen, Hiromichi Matsuyama, Wei‐Hao Huang

Quantum Approximate Optimization Algorithms (QAOA) promise efficient solutions to classically intractable combinatorial optimization problems by harnessing shallowdepth quantum circuits. Yet, their performance and scalability often hinge on effective parameter optimization, which remains nontrivial due to rugged energy landscapes and hardware noise. In this work, we introduce a quantum meta-learning framework that combines quantum neural networks, specifically Quantum Long Short-Term Memory (QLSTM) architectures, with QAOA. By training the QLSTM optimizer on smaller graph instances, our approach rapidly generalizes to larger, more complex problems, substantially reducing the number of iterations required for convergence. Through comprehensive benchmarks on Max-Cut and Sherrington-Kirkpatrick model instances, we demonstrate that QLSTM-based optimizers converge faster and achieve higher approximation ratios compared to classical baselines, thereby offering a robust pathway toward scalable quantum optimization in the NISQ era.

IEEE International Conference on Quantum Computing and Engineering (QCE)Aug 30, 20252 citations

Meta-Learning for Quantum Optimization via Quantum Sequence Model

Yu-Cheng Lin, Yu-Chao Hsu, Samuel Yen-Chi Chen

The Quantum Approximate Optimization Algorithm (QAOA) is a leading approach for solving combinatorial optimization problems on near-term quantum processors. However, finding good variational parameters remains a significant challenge due to the non-convex energy landscape, often resulting in slow convergence and poor solution quality. In this work, we propose a quantum meta-learning framework that trains advanced quantum sequence models to generate effective parameter initialization policies. We investigate four classical or quantum sequence models, including the Quantum Kernel-based Long Short-Term Memory (QK-LSTM), as learned optimizers in a "learning to learn" paradigm. Our numerical experiments on the Max-Cut problem demonstrate that the QK-LSTM optimizer achieves superior performance, obtaining the highest approximation ratios and exhibiting the fastest convergence rate across all tested problem sizes (n=10 to 13). Crucially, the QK-LSTM model achieves perfect parameter transferability by synthesizing a single, fixed set of near-optimal parameters, leading to a remarkable sustained acceleration of convergence even when generalizing to larger problems. This capability, enabled by the compact and expressive power of the quantum kernel architecture, underscores its effectiveness. The QK-LSTM, with only 43 trainable parameters, substantially outperforms the classical LSTM (56 parameters) and other quantum sequence models, establishing a robust pathway toward highly efficient parameter initialization for variational quantum algorithms in the NISQ era.

quant-pharXiv:2512.05058International Conference on Quantum Communications, Networking, and Computing (QCNC)Dec 5, 20250 citations

Meta-learning digitized-counterdiabatic quantum optimization

Pranav Chandarana, Pablo Suárez Vieites, Narendra N. Hegade +3 more

Abstract The use of variational quantum algorithms for optimization tasks has emerged as a crucial application for the current noisy intermediate-scale quantum computers. However, these algorithms face significant difficulties in finding suitable ansatz and appropriate initial parameters. In this paper, we employ meta-learning using recurrent neural networks to address these issues for the recently proposed digitized-counterdiabatic quantum approximate optimization algorithm (QAOA). By combining meta-learning and counterdiabaticity, we find suitable variational parameters and reduce the number of optimization iterations required. We demonstrate the effectiveness of our approach by applying it to the MaxCut problem and the Sherrington–Kirkpatrick model. Our method offers a short-depth circuit ansatz with optimal initial parameters, thus improving the performance of the state-of-the-art QAOA.

arXiv:2206.09966Quantum Science and TechnologyJul 7, 202328 citations

Avoiding local minima in Variational Quantum Algorithms with Neural Networks

Javier Rivera-Dean, Patrick Huembeli, Antonio Acín +1 more

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.

arXiv:2104.02955Apr 7, 202116 citations

Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms

Junyong Lee, Jeihee Cho, Shiho Kim

In the Noisy Intermediate-Scale Quantum (NISQ) era, using variational quantum algorithms (VQAs) to solve optimization problems has become a key application. However, these algorithms face significant challenges, such as choosing an effective initial set of parameters and the limited quantum processing time that restricts the number of optimization iterations. In this study, we introduce a new framework for optimizing parameterized quantum circuits (PQCs) that employs a classical optimizer, inspired by Model-Agnostic Meta-Learning (MAML) technique. This approach aim to achieve better parameter initialization that ensures fast convergence. Our framework features a classical neural network, called Learner, which interacts with a PQC using the output of Learner as an initial parameter. During the pre-training phase, Learner is trained with the meta objective function. In the adaptation phase, the framework requires only a few PQC updates to converge to a more accurate value, while the learner remains unchanged. This method is highly adaptable and is effectively extended to various Hamiltonian optimization problems. We validate our approach through experiments, including distribution function mapping and optimization of the Heisenberg XYZ Hamiltonian. The result implies that the Learner successfully estimates initial parameters that generalize across the problem space, enabling fast adaptation.

arXiv:2501.05906Proceedings of the AAAI Conference on Artificial IntelligenceApr 11, 20257 citations

Quantum machine learning with hybrid quantum-classical computation

Albert Cardenete Massip

This thesis explores variational quantum algorithms in order to solve optimization combinatorial problems using a meta-learning approach. This variational algorithm sare promising due to its capability to be used in the near future in the so-called NoisyIntermediate-Scale Quantum (NISQ) era, in which algorithms with high tolerance to noise could perform better than its classical counterparts. In this approach, a Recurrent Neural Network (RNN) optimizer tries to obtain the best set of parameters ofa quantum circuit for a given problem using the Qauntum Approximation Optimiza-tion Algorithm (QAOA), with the minimal amount of queries possible to a quantumcomputer. Thanks to the advances of parameter shift methods to compute the gradi-ents of parametrized quantum circuits, these algorithms could be even trained in realquantum computers without the need of highly demanding simulations. The resultspresented show that this approach is able to generalize to other problem instanceswhich the model has not seen before during training.

Oct 1, 20200 citations