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 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 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 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.
Parameterized quantum circuits used as variational ansatzes are emerging as promising tools to tackle complex problems ranging from quantum chemistry to combinatorial optimization.These variational quantum circuits can suffer from the well-known curse of barren plateaus, which is characterized by an exponential vanishing of the cost-function gradient with the system size, making training unfeasible for practical applications.Since a generic quantum circuit cannot be simulated efficiently, the determination of its trainability is an important problem.Here we find an efficient method to compute the gradient of the cost function and its variance for a wide class of variational quantum circuits.Our scheme relies on our proof of an exact mapping from randomly initialized circuits to a set of Clifford circuits that can be efficiently simulated on a classical computer by virtue of the celebrated Gottesman-Knill theorem.This method is scalable and can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren-plateau problem.As illustrative examples, we show results with up to 100 qubits.
Abstract In recent years, variational quantum circuits (VQCs) have been widely explored to advance quantum circuits against classic models on various domains, such as quantum chemistry and quantum machine learning. Similar to classic machine-learning models, VQCs can be trained through various optimization approaches, such as gradient-based or gradient-free methods. However, when employing gradient-based methods, the gradient variance of VQCs may dramatically vanish as the number of qubits or layers increases. This issue, a.k.a. barren plateaus (BPs), seriously hinders the scaling of VQCs on large datasets. To mitigate the barren plateaus, extensive efforts have been devoted to tackling this issue through diverse strategies. In this survey, we conduct a systematic literature review of recent works from both investigation and mitigation perspectives. Furthermore, we propose a new taxonomy to categorize most existing mitigation strategies into five groups and introduce them in detail. Also, we compare the concurrent survey papers about BPs. Finally, we provide insightful discussion on future directions for BPs.
The barren plateau phenomenon; where cost function gradients vanish exponentially with system size; remains a fundamental obstacle to training variational quantum circuits (VQCs) at scale. We demonstrate, both theoretically and numerically, that embedding partial differential equation (PDE) constraints into the VQC loss function provides a natural and effective mitigation mechanism against barren plateaus. We derive analytical gradient variance lower bounds showing that physics-constrained loss functions composed of local PDE residuals evaluated at spatial collocation points inherit the favorable polynomial scaling of local cost functions, while additionally benefiting from constraint-induced landscape narrowing that concentrates gradient information. Systematic numerical experiments on the one-dimensional heat equation, Burgers' equation, and the Saint-Venant shallow water equations quantify the gradient variance across 4-8 qubits and 1-5 layer depths, comparing global cost, local cost, PDE-constrained, and PDE-constrained with structured ansatz configurations. We find that PDE-constrained circuits exhibit favorable gradient variance scaling with system size, with the physics constraints creating a stabilizing effect that resists exponential gradient vanishing. Entanglement entropy analysis reveals that structured ansatze operate in a sub-maximal entanglement regime consistent with trainability. Convergence experiments confirm that physics-constrained VQCs achieve lower loss values in fewer epochs. These results establish PDE constraints as a principled, physically motivated strategy for designing trainable variational quantum circuits, with direct implications for quantum physics-informed neural networks and variational quantum simulation.