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

Bulletin of the American Physical Society

Barren Plateau Issues for Variational Quantum-Classical Algorithms

Marco Cerezo, Akira Sone, Łukasz Cincio, Patrick J. Coles

Published Mar 3, 2020• 3 citations
OpenAlex

Related papers

Barren plateaus in variational quantum computing

Martín Larocca, Supanut Thanasilp, Samson Wang +7 more

arXiv:2405.00781•Nature Reviews Physics•Mar 26, 2025•585 citations

The PID Controller Strikes Back: Classical Controller Helps Mitigate Barren Plateaus in Noisy Variational Quantum Circuits

Zhehao Yi, Rahul Bhadani

Variational quantum algorithms (VQAs) combine the advantages of classical optimization and quantum computation, making them one of the most promising approaches in the Noisy Intermediate-Scale Quantum (NISQ) era. However, when optimized using gradient descent, VQAs often suffer from the vanishing gradient problem, commonly known as the barren plateau. Various methods have been proposed to mitigate this issue. In this work, we propose a hybrid approach that integrates a classical proportional-integral-derivative (PID) controller with a neural network to update the parameters of variational quantum circuits. We refer to this method as NPID, which aims to mitigate the barren plateau. The proposed algorithm is tested on randomly generated quantum input states and random quantum circuits with parametric noise to evaluate its universality, and additional simulations are conducted under different noise rates to examine its robustness. The effectiveness of the proposed method is evaluated based on its convergence speed toward the target cost value. Simulation results show that NPID achieves a convergence efficiency 2-9 times higher than NEQP and QV, with performance fluctuations averaging only 4.45% across different noise levels. These results highlight the potential of integrating classical control theory into quantum optimization, providing a new perspective for improving the trainability and stability of variational quantum algorithms.

quant-pharXiv:2511.14820•Nov 19, 2025•1 citation

Towards determining the presence of barren plateaus in some chemically inspired variational quantum algorithms

Rui Mao, Guojing Tian, Xiaoming Sun

In quantum chemistry, the variational quantum eigensolver (VQE) is a promising algorithm for molecular simulations on near-term quantum computers. However, VQEs using hardware-efficient circuits face scaling challenges due to the barren plateau problem. This raises the question of whether chemically inspired circuits from unitary coupled cluster (UCC) methods can avoid this issue. Here we provide theoretical evidence indicating they may not. By examining alternated dUCC ansätzes and relaxed Trotterized UCC ansätzes, we find that in the infinite depth limit, a separation occurs between particle-hole one- and two-body unitary operators. While one-body terms yield a polynomially concentrated energy landscape, adding two-body terms leads to exponential concentration. Numerical simulations support these findings, suggesting that popular 1-step Trotterized unitary coupled-cluster with singles and doubles (UCCSD) ansätze may not scale. Our results emphasize the link between trainability and circuit expressiveness, raising doubts about VQEs’ ability to surpass classical methods. The variational quantum eigensolver (VQE) is a promising approach for molecular simulations on quantum computers but faces scaling issues due to the barren plateau problem. The authors’ findings indicate that unitary coupled cluster circuits may not overcome these challenges, raising doubts about VQE’s ability to outperform classical methods.

arXiv:2312.08105•Communications Physics•Oct 18, 2024•19 citations

Variational quantum algorithms : a noisy landscape

Enrico Fontana

•Jan 1, 2025•0 citations

Variational quantum algorithms

Marco Cerezo, Andrew Arrasmith, Ryan Babbush +8 more

arXiv:2012.09265•Nature Reviews Physics•Aug 12, 2021•4,270 citations

Arnold's Bifurcation Principle Applied to Variational Quantum Optimization: Real-Time Hardware Prediction of Barren-Plateau Stalling

PRAKASH VAITHYANATHAN

Variational quantum algorithms, such as the Variational Quantum Eigensolver (VQE), rely on classical optimization loops to iteratively update parameterized gate rotation angles. These algorithms frequently fail due to ``barren plateaus''---regions in the parameter space where the gradient field vanishes and optimization convergence permanently stalls. We show that a barren plateau is a classical fold or saddle-node bifurcation of the optimization parameter trajectory. We propose a proactive, full-stack mitigation framework consisting of an algorithmic compiler wrapper that continuously extracts the time-varying parameter vectors, converting them into a standardized, digitized bitstream. Henceforth, to achieve runtime stability, this digitized parameter manifold stream must be fed directly into a dedicated, co-located physical hardware controller implementing Arnold's Bifurcation Principle. The domain-blind hardware controller computes the parameter-flow Jacobian matrix in-register and tracks its leading eigenvalue. By measuring the phase-space velocity of the eigenvalue toward zero, the hardwired controller predicts the approaching barren plateau several clock cycles before it manifests, dropping an asynchronous interrupt line that commands the software wrapper to dynamically shunt the parameter updates onto a structurally stable alternative manifold branch.

•Sep 1, 2026•0 citations
Variational quantum algorithms (VQAs) combine the advantages of classical optimization and quantum computation, making them one of the most promising approaches in the Noisy Intermediate-Scale Quantum (NISQ) era. However, when optimized using gradient descent, VQAs often suffer from the vanishing gradient problem, commonly known as the barren plateau. Various methods have been proposed to mitigate this issue. In this work, we propose a hybrid approach that integrates a classical proportional-integral-derivative (PID) controller with a neural network to update the parameters of variational quantum circuits. We refer to this method as NPID, which aims to mitigate the barren plateau. The proposed algorithm is tested on randomly generated quantum input states and random quantum circuits with parametric noise to evaluate its universality, and additional simulations are conducted under different noise rates to examine its robustness. The effectiveness of the proposed method is evaluated based on its convergence speed toward the target cost value. Simulation results show that NPID achieves a convergence efficiency 2-9 times higher than NEQP and QV, with performance fluctuations averaging only 4.45% across different noise levels. These results highlight the potential of integrating classical control theory into quantum optimization, providing a new perspective for improving the trainability and stability of variational quantum algorithms.
In quantum chemistry, the variational quantum eigensolver (VQE) is a promising algorithm for molecular simulations on near-term quantum computers. However, VQEs using hardware-efficient circuits face scaling challenges due to the barren plateau problem. This raises the question of whether chemically inspired circuits from unitary coupled cluster (UCC) methods can avoid this issue. Here we provide theoretical evidence indicating they may not. By examining alternated dUCC ansätzes and relaxed Trotterized UCC ansätzes, we find that in the infinite depth limit, a separation occurs between particle-hole one- and two-body unitary operators. While one-body terms yield a polynomially concentrated energy landscape, adding two-body terms leads to exponential concentration. Numerical simulations support these findings, suggesting that popular 1-step Trotterized unitary coupled-cluster with singles and doubles (UCCSD) ansätze may not scale. Our results emphasize the link between trainability and circuit expressiveness, raising doubts about VQEs’ ability to surpass classical methods. The variational quantum eigensolver (VQE) is a promising approach for molecular simulations on quantum computers but faces scaling issues due to the barren plateau problem. The authors’ findings indicate that unitary coupled cluster circuits may not overcome these challenges, raising doubts about VQE’s ability to outperform classical methods.
Variational quantum algorithms, such as the Variational Quantum Eigensolver (VQE), rely on classical optimization loops to iteratively update parameterized gate rotation angles. These algorithms frequently fail due to ``barren plateaus''---regions in the parameter space where the gradient field vanishes and optimization convergence permanently stalls. We show that a barren plateau is a classical fold or saddle-node bifurcation of the optimization parameter trajectory. We propose a proactive, full-stack mitigation framework consisting of an algorithmic compiler wrapper that continuously extracts the time-varying parameter vectors, converting them into a standardized, digitized bitstream. Henceforth, to achieve runtime stability, this digitized parameter manifold stream must be fed directly into a dedicated, co-located physical hardware controller implementing Arnold's Bifurcation Principle. The domain-blind hardware controller computes the parameter-flow Jacobian matrix in-register and tracks its leading eigenvalue. By measuring the phase-space velocity of the eigenvalue toward zero, the hardwired controller predicts the approaching barren plateau several clock cycles before it manifests, dropping an asynchronous interrupt line that commands the software wrapper to dynamically shunt the parameter updates onto a structurally stable alternative manifold branch.