Variational quantum algorithms (VQAs) have recently received much attention due to their promising performance in Noisy Intermediate-Scale Quantum computers (NISQ). However, VQAs run on parameterized quantum circuits (PQC) with randomly initialized parameters are characterized by barren plateaus (BP) where the gradient vanishes exponentially in the number of qubits. In this paper, we proposed a Look Around Warm-Start (LAWS) quantum natural gradient (QNG) algorithm to mitigate the widespread existing BP issues. LAWS is a combinatorial optimization strategy taking advantage of model parameter initialization and fast convergence of QNG. LAWS repeatedly reinitializes parameter search space for the next iteration parameter update. The reinitialized parameter search space is carefully chosen by sampling the gradient close to the current optimal. Moreover, we present a unified framework (WS-SGD) for integrating parameter initialization techniques into the optimizer. We provide the convergence proof of the proposed framework for both convex and non-convex objective functions based on Polyak-Lojasiewicz (PL) condition. Our experiment results show that the proposed algorithm could mitigate the BP and have better generalization ability in quantum classification problems.
Variational quantum algorithms (VQAs) have recently received much attention due to their promising performance in Noisy Intermediate-Scale Quantum computers (NISQ). However, VQAs run on parameterized quantum circuits (PQC) with randomly initialized parameters are characterized by barren plateaus (BP) where the gradient vanishes exponentially in the number of qubits. In this paper, we proposed a Look Around Warm-Start (LAWS) quantum natural gradient (QNG) algorithm to mitigate the widespread existing BP issues. LAWS is a combinatorial optimization strategy taking advantage of model parameter initialization and fast convergence of QNG. LAWS repeatedly reinitializes parameter search space for the next iteration parameter update. The reinitialized parameter search space is carefully chosen by sampling the gradient close to the current optimal. Moreover, we present a unified framework (WS-SGD) for integrating parameter initialization techniques into the optimizer. We provide the convergence proof of the proposed framework for both convex and non-convex objective functions based on Polyak-Lojasiewicz (PL) condition. Our experiment results show that the proposed algorithm could mitigate the BP and have better generalization ability in quantum classification problems.
Parameterized quantum circuits (PQCs) have emerged as a foundational element in the development and applications of quantum algorithms. However, when initialized with random parameter values, PQCs often exhibit barren plateaus (BP). These plateaus, characterized by vanishing gradients with an increasing number of qubits, hinder optimization in quantum algorithms. In this paper, we analyze the impact of state-of-the-art parameter initialization strategies from classical machine learning in random PQCs from the aspect of BP phenomenon. Our investigation encompasses a spectrum of initialization techniques, including random, Xavier (both normal and uniform variants), He, LeCun, and Orthogonal methods. Empirical assessment reveals a pronounced reduction in variance decay of gradients across all these methodologies compared to the randomly initialized PQCs. Specifically, the Xavier initialization technique outperforms the rest, showing a 62% improvement in variance decay compared to the random initialization. The He, Lecun, and orthogonal methods also display improvements, with respective enhancements of 32 %, 28 %, and 26 %. This compellingly suggests that the adoption of these existing initialization techniques holds the potential to significantly amplify the training efficacy of Quantum Neural Networks (QNNs), a subclass of PQCs. Demonstrating this effect, we employ the identified techniques to train QNNs for learning the identity function, effectively mitigating the adverse effects of BPs. The training performance, ranked from the best to the worst, aligns with the variance decay enhancement as outlined above. This paper underscores the role of tailored parameter initialization in mitigating the BP problem and eventually enhancing the training dynamics of QNNs.
Variational quantum algorithms (VQAs) are among the most promising algorithms in the era of noisy intermediate scale quantum devices. Such algorithms are constructed using a parametrization $U(\ensuremath{\theta}$) with a classical optimizer that updates the parameters $\ensuremath{\theta}$ in order to minimize a cost function C. For this task, in general the gradient descent method, or one of its variants, is used. This is a method where the circuit parameters are updated iteratively using the cost function gradient. However, several works in the literature have shown that this method suffers from a phenomenon known as the barren plateaus (BPs). In this paper, we propose a method to mitigate BPs. In general, the parameters $\ensuremath{\theta}$ used in the parametrization U are randomly generated. In our method they are obtained from a classical neural network (CNN). We show that this method, besides to being able to mitigate BPs during startup, is also able to mitigate the effect of BPs during the VQA training. In addition, we also show how this method behaves for different CNN architectures.
Abstract Variational Quantum Algorithms (VQAs) are widely regarded as the most promising route to practical quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) hardware, but their trainability is threatened by the barren plateau phenomenon, in which cost-function gradients vanish exponentially with system size and circuit depth. Standard first-order optimizers, which treat the parameter space of a parameterized quantum circuit (PQC) as flat Euclidean space, are especially vulnerable to this effect and to the additional gradient suppression introduced by hardware noise. This extended treatment presents (i) a from-first-principles derivation of Quantum Natural Gradient (QNG) descent, tracing its lineage from Amari's classical information geometry [1] through the Fubini-Study metric to the Quantum Fisher Information Matrix (QFIM); (ii) a complete taxonomy of barren-plateau mechanisms (expressibility-induced, entanglement-induced, cost-function-locality-induced, and noise-induced); (iii) a comparative survey of the broader NISQ optimizer landscape (SPSA, Adam, COBYLA, Rotosolve, Quantum Natural SPSA, and reduced-cost QFIM estimators); and (iv) a controlled simulation study comparing QNG against vanilla gradient descent on a 4-qubit weighted MaxCut problem under three physically motivated NISQ noise models. Across 50 independent trials, QNG raised the convergence success rate from 30% to 95%, reduced the mean iteration count to convergence by a factor of roughly 6, and achieved a 16% net wall-clock speedup despite the added per-iteration cost of QFIM estimation. We give the full theoretical basis for these gains, an exhaustive discussion of their limitations, an A-to-Z glossary of the field's terminology, and a staged roadmap toward physical hardware validation. Figure placements throughout the document are annotated with detailed image-generation prompts so that the accompanying visual assets can be produced independently of this text.
Variational Quantum Algorithms (VQAs) have gained prominence as a viable framework for exploiting near-term quantum devices in applications ranging from optimization and chemistry simulation to machine learning. However, the effectiveness of VQAs is often constrained by the so-called barren plateau problem, wherein gradients diminish exponentially as system size or circuit depth increases, thereby hindering training. In this work, we propose a reinforcement learning (RL)-based initialization strategy to alleviate the barren plateau issue by reshaping the initial parameter landscape to avoid regions prone to vanishing gradients. In particular, we explore several RL algorithms (Deterministic Policy Gradient, Soft ActorCritic, and Proximal Policy Optimization, etc.) to generate the circuit parameters (treated as “actions”) that minimize the VQAs cost function before standard gradient-based optimization. By pre-training with RL in this manner, subsequent optimization using methods such as gradient descent or Adam proceeds from a more favorable initial state. Extensive numerical experiments under various noise conditions and tasks consistently demonstrate that the RL-based initialization method significantly enhances both convergence speed and final solution quality. Moreover, comparisons among different RL algorithms highlight that multiple approaches can achieve comparable performance gains, underscoring the flexibility and robustness of our method. These findings shed light on a promising avenue for integrating machine learning techniques into quantum algorithm design, offering insights into how RL-driven parameter initialization can accelerate the scalability and practical deployment of VQAs. Opening up a promising path for the research community in machine learning for quantum, especially barren plateau problems in VQAs.
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.
Barren Plateaus are a formidable challenge for hybrid quantum-classical algorithms that lead to flat plateaus in the loss function landscape making it difficult to take advantage of the expressive power of parameterized quantum circuits with gradient-based methods. Like in classical neural network models, parameterized quantum circuits suffer the same vanishing gradient issue due to large parameter spaces with non-convex landscapes. In this review, we present an overview of the different genesis for barren plateaus, mathematical formalisms of common themes around barren plateaus, and dives into gradients. The central objective is to provide a conceptual perspective between classical and quantum interpretations of vanishing gradients as well as dive into techniques involving cost functions, entanglement, and initialization strategies to mitigate barren plateaus. Addressing barren plateaus paves the way towards feasibility of many classically intractable applications for quantum simulation, optimization, chemistry, and quantum machine learning.