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

IEEE Congress on Evolutionary Computation (CEC)

An Evolutionary Strategy – Inspired Approach to Barren Plateaux Mitigation Using Local Cost Functions

Rodica Ioana Lung, Tudor Dan Mihoc

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Variational quantum algorithms face optimization difficulties due to barren plateaux, particularly as system size increases. In this work, we propose an evolutionary strategy–inspired approach that adaptively selects qubits for local cost evaluation and applies small perturbations to the selected parameters to optimize the local cost function. Numerical results on the identity gate learning problem indicate that adaptive qubit prioritization can reduce optimization stagnation and improve convergence behavior compared to standard global and local cost strategies. These findings suggest that evolutionary-guided control mechanisms may complement existing local-cost-based optimization methods in variational quantum algorithms.

DOI
10.1109/cec69861.2026.11727185

Related papers

Evolutionary Qubit Selection for Local Cost Functions in Variational Quantum Circuits

Rodica Ioana Lung, Tudor Dan Mihoc

Variational quantum circuits (VQCs) are flexible models for optimization and learning based on parameterized quantum circuits trained via cost minimization. A key challenge in their optimization is the presence of barren plateaus, where gradients vanish exponentially with the number of qubits, severely limiting trainability. Local cost functions mitigate this issue by restricting evaluation to qubit subsets, improving gradient scaling. In this work, we propose an evolutionary strategy-inspired method to automatically identify informative qubit subsets for constructing local cost functions. Operating at the level of qubit selection rather than parameter optimization, the approach enables adaptive, circuit-aware objective design. Numerical experiments using the PennyLane framework show that the method alleviates barren plateaus and improves optimization performance in the identity-gate learning problem.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 13, 2026•0 citations

Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training

Jakab Nádori, Gregory Morse, Barna Fülöp Villám +3 more

Variational quantum algorithms are viewed as promising candidates for demonstrating quantum advantage on near-term devices. These approaches typically involve the training of parameterized quantum circuits through a classical optimization loop. However, they often encounter challenges attributed to the exponentially diminishing gradient components, known as the barren plateau (BP) problem. This work introduces a novel optimization approach designed to alleviate the adverse effects of BPs during circuit training. In contrast to conventional gradient descent methods with a small learning parameter, our approach relies on making a finite hops along the search direction determined on a randomly chosen subsets of the free parameters. The optimization search direction, together with the range of the search, is determined by the distant features of the cost-function landscape. This enables the optimization path to navigate around barren plateaus without the need for external control mechanisms. We have successfully applied our optimization strategy to quantum circuits comprising 21 qubits and 15000 entangling gates, demonstrating robust resistance against BPs. Additionally, we have extended our optimization strategy by incorporating an evolutionary selection framework, enhancing its ability to avoid local minima in the landscape. The modified algorithm has been successfully utilized in quantum gate synthesis applications, showcasing a significantly improved efficiency in generating highly compressed quantum circuits compared to traditional gradient-based optimization approaches.

arXiv:2402.05227•Quantum•Aug 29, 2025•10 citations

Learning to learn with an evolutionary strategy applied to variational quantum algorithms

Lucas Friedrich, Jonas Maziero

Variational quantum algorithms (VQAs) employ parametrized quantum circuits optimized using classical methods to minimize a cost function. While VQAs have found broad applications, certain challenges persist. Notably, a significant computational burden arises during parameter optimization. The prevailing ``parameter shift rule'' mandates a double evaluation of the cost function for each parameter. In this paper, we introduce an optimization approach named ``learning to learn with an evolutionary strategy'' (LLES). LLES unifies ``learning to learn'' and ``evolutionary strategy'' methods. Learning to learn treats optimization as a learning problem, utilizing recurrent neural networks to iteratively propose VQA parameters. Conversely, evolutionary strategy employs gradient searches to estimate function gradients. Our optimization method is applied to two distinct tasks: determining the ground state of an Ising Hamiltonian and training a quantum neural network. The obtained results underscore the efficacy of this approach. Additionally, we identify a key hyperparameter that significantly influences gradient estimation using the evolutionary strategy method.

arXiv:2310.17402•Physical Review A•Feb 27, 2025•6 citations

Natural Evolutionary Gradient Descent Strategy for Variational Quantum Algorithms

Jianshe Xie, Chen Xu, Chenhao Yin +2 more

Recent research has demonstrated that parametric quantum circuits (PQCs) are affected by gradients that progressively vanish to zero as a function of the number of qubits. We show that using a combination of gradient-free natural evolutionary strategy and gradient descent can mitigate the possibility of optimizing barren plateaus in the landscape. We implemented 2 specific methods: natural evolutionary strategy stochastic gradient descent (NESSGD) and natural evolutionary strategy adapting the step size according to belief in observed gradients (NESAdaBelief) to optimize PQC parameter values. They were compared with standard stochastic gradient descent, adaptive moment estimation, and a version of adaptive moment estimation adapting the step size according to belief in observed gradients in 5 classification tasks. NESSGD and NESAdaBelief demonstrated some superiority in 4 of the tasks. NESAdaBelief showed higher accuracy than AdaBelief in all 5 tasks. In addition, we investigated the applicability of NESSGD under the parameter shift rule and demonstrated that NESSGD can adapt to this rule, which means that our proposed method could also optimize the parameters of PQCs on quantum computers.

Intelligent Computing•Jan 1, 2023•3 citations

A Noisy Optimization mechanism for variational quantum classifiers

Rodica Ioana Lung, Florin Sebastian Duma

• existence of barren plateaux is one of the challenges in the practical use of variational quantum classifiers; • a noise-based mechanism that shifts training data during optimization, helping escape barren plateaux, is proposed; • the approach is tested with a variational quantum classifier modeling BET index changes using other indices from Europe and the United States; • simulations use the Pennylane framework. The barren plateaux phenomenon has been identified as a significant challenge for variational quantum algorithms, particularly for classification tasks. In this article, we propose a novel approach to mitigating this problem for variational quantum classifiers during the optimization phase. The noisy optimization mechanism shifts the training data by adding a small amount of uniform noise, thereby inducing changes in the parameters being searched. The effectiveness of the method is evaluated using real financial data, modeling the evolution of the BET index in relation to well-known indices from neighboring Central and Eastern European countries, as well as from Western Europe and the United States. The results demonstrate that this approach significantly improves upon the corresponding baseline quantum classifier and provides results comparable to those of established classical methods.

Knowledge-Based Systems•Mar 7, 2026•0 citations

Surviving The Barren Plateau in Variational Quantum Circuits with Bayesian Learning Initialization

Rad, Ali, Alireza Seif, Norbert M. Linke

Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term. While this approach reduces the number of qubits and operations required from the quantum machine, it places a heavy load on a classical optimizer. While often under-appreciated, the latter is a computationally hard task due to the barren plateau phenomenon in parameterized quantum circuits. The absence of guiding features like gradients renders conventional optimization strategies ineffective as the number of qubits increases. Here, we introduce the fast-and-slow algorithm, which uses Bayesian Learning to identify a promising region in parameter space. This is used to initialize a fast local optimizer to find the global optimum point efficiently. We illustrate the effectiveness of this method on the Bars-and-Stripes (BAS) quantum generative model, which has been studied on several quantum hardware platforms. Our results move variational quantum algorithms closer to their envisioned applications in quantum chemistry, combinatorial optimization, and quantum simulation problems.

arXiv:2203.02464•Mar 4, 2022•39 citations
Variational quantum algorithms face optimization difficulties due to barren plateaux, particularly as system size increases. In this work, we propose an evolutionary strategy–inspired approach that adaptively selects qubits for local cost evaluation and applies small perturbations to the selected parameters to optimize the local cost function. Numerical results on the identity gate learning problem indicate that adaptive qubit prioritization can reduce optimization stagnation and improve convergence behavior compared to standard global and local cost strategies. These findings suggest that evolutionary-guided control mechanisms may complement existing local-cost-based optimization methods in variational quantum algorithms.
Variational quantum circuits (VQCs) are flexible models for optimization and learning based on parameterized quantum circuits trained via cost minimization. A key challenge in their optimization is the presence of barren plateaus, where gradients vanish exponentially with the number of qubits, severely limiting trainability. Local cost functions mitigate this issue by restricting evaluation to qubit subsets, improving gradient scaling. In this work, we propose an evolutionary strategy-inspired method to automatically identify informative qubit subsets for constructing local cost functions. Operating at the level of qubit selection rather than parameter optimization, the approach enables adaptive, circuit-aware objective design. Numerical experiments using the PennyLane framework show that the method alleviates barren plateaus and improves optimization performance in the identity-gate learning problem.
Variational quantum algorithms are viewed as promising candidates for demonstrating quantum advantage on near-term devices. These approaches typically involve the training of parameterized quantum circuits through a classical optimization loop. However, they often encounter challenges attributed to the exponentially diminishing gradient components, known as the barren plateau (BP) problem. This work introduces a novel optimization approach designed to alleviate the adverse effects of BPs during circuit training. In contrast to conventional gradient descent methods with a small learning parameter, our approach relies on making a finite hops along the search direction determined on a randomly chosen subsets of the free parameters. The optimization search direction, together with the range of the search, is determined by the distant features of the cost-function landscape. This enables the optimization path to navigate around barren plateaus without the need for external control mechanisms. We have successfully applied our optimization strategy to quantum circuits comprising 21 qubits and 15000 entangling gates, demonstrating robust resistance against BPs. Additionally, we have extended our optimization strategy by incorporating an evolutionary selection framework, enhancing its ability to avoid local minima in the landscape. The modified algorithm has been successfully utilized in quantum gate synthesis applications, showcasing a significantly improved efficiency in generating highly compressed quantum circuits compared to traditional gradient-based optimization approaches.
Variational quantum algorithms (VQAs) employ parametrized quantum circuits optimized using classical methods to minimize a cost function. While VQAs have found broad applications, certain challenges persist. Notably, a significant computational burden arises during parameter optimization. The prevailing ``parameter shift rule'' mandates a double evaluation of the cost function for each parameter. In this paper, we introduce an optimization approach named ``learning to learn with an evolutionary strategy'' (LLES). LLES unifies ``learning to learn'' and ``evolutionary strategy'' methods. Learning to learn treats optimization as a learning problem, utilizing recurrent neural networks to iteratively propose VQA parameters. Conversely, evolutionary strategy employs gradient searches to estimate function gradients. Our optimization method is applied to two distinct tasks: determining the ground state of an Ising Hamiltonian and training a quantum neural network. The obtained results underscore the efficacy of this approach. Additionally, we identify a key hyperparameter that significantly influences gradient estimation using the evolutionary strategy method.
Recent research has demonstrated that parametric quantum circuits (PQCs) are affected by gradients that progressively vanish to zero as a function of the number of qubits. We show that using a combination of gradient-free natural evolutionary strategy and gradient descent can mitigate the possibility of optimizing barren plateaus in the landscape. We implemented 2 specific methods: natural evolutionary strategy stochastic gradient descent (NESSGD) and natural evolutionary strategy adapting the step size according to belief in observed gradients (NESAdaBelief) to optimize PQC parameter values. They were compared with standard stochastic gradient descent, adaptive moment estimation, and a version of adaptive moment estimation adapting the step size according to belief in observed gradients in 5 classification tasks. NESSGD and NESAdaBelief demonstrated some superiority in 4 of the tasks. NESAdaBelief showed higher accuracy than AdaBelief in all 5 tasks. In addition, we investigated the applicability of NESSGD under the parameter shift rule and demonstrated that NESSGD can adapt to this rule, which means that our proposed method could also optimize the parameters of PQCs on quantum computers.
• existence of barren plateaux is one of the challenges in the practical use of variational quantum classifiers; • a noise-based mechanism that shifts training data during optimization, helping escape barren plateaux, is proposed; • the approach is tested with a variational quantum classifier modeling BET index changes using other indices from Europe and the United States; • simulations use the Pennylane framework. The barren plateaux phenomenon has been identified as a significant challenge for variational quantum algorithms, particularly for classification tasks. In this article, we propose a novel approach to mitigating this problem for variational quantum classifiers during the optimization phase. The noisy optimization mechanism shifts the training data by adding a small amount of uniform noise, thereby inducing changes in the parameters being searched. The effectiveness of the method is evaluated using real financial data, modeling the evolution of the BET index in relation to well-known indices from neighboring Central and Eastern European countries, as well as from Western Europe and the United States. The results demonstrate that this approach significantly improves upon the corresponding baseline quantum classifier and provides results comparable to those of established classical methods.
Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term. While this approach reduces the number of qubits and operations required from the quantum machine, it places a heavy load on a classical optimizer. While often under-appreciated, the latter is a computationally hard task due to the barren plateau phenomenon in parameterized quantum circuits. The absence of guiding features like gradients renders conventional optimization strategies ineffective as the number of qubits increases. Here, we introduce the fast-and-slow algorithm, which uses Bayesian Learning to identify a promising region in parameter space. This is used to initialize a fast local optimizer to find the global optimum point efficiently. We illustrate the effectiveness of this method on the Bars-and-Stripes (BAS) quantum generative model, which has been studied on several quantum hardware platforms. Our results move variational quantum algorithms closer to their envisioned applications in quantum chemistry, combinatorial optimization, and quantum simulation problems.