Variational quantum algorithms (VQAs) hold much promise but face the challenge of exponentially small gradients. Unmitigated, this barren plateau (BP) phenomenon leads to an exponential training overhead for VQAs. Perhaps the most pernicious are noise-induced barren plateaus (NIBPs), a type of unavoidable BP arising from open system effects, which have so far been shown to exist for unital noise maps. Here, we generalize the study of NIBPs to more general completely positive, trace-preserving maps, investigating the existence of NIBPs in the unital case and a class of non-unital maps we call Hilbert-Schmidt (HS)-contractive. The latter includes amplitude damping. We identify the associated phenomenon of noise-induced limit sets (NILS) of the VQA cost function and prove its existence for both unital and HS-contractive non-unital noise maps. Along the way, we extend the parameter shift rule of VQAs to the noisy setting. We provide rigorous bounds in terms of the relevant variables that give rise to NIBPs and NILSs, along with numerical simulations of the depolarizing and amplitude-damping maps that illustrate our analytical results.
Variational quantum algorithms (VQAs) hold much promise but face the challenge of exponentially small gradients. Unmitigated, this barren plateau (BP) phenomenon leads to an exponential training overhead for VQAs. Perhaps the most pernicious are noise-induced barren plateaus (NIBPs), a type of unavoidable BP arising from open system effects, which have so far been shown to exist for unital noise maps. Here, we generalize the study of NIBPs to more general completely positive, trace-preserving maps, investigating the existence of NIBPs in the unital case and a class of non-unital maps we call Hilbert-Schmidt (HS)-contractive. The latter includes amplitude damping. We identify the associated phenomenon of noise-induced limit sets (NILS) of the VQA cost function and prove its existence for both unital and HS-contractive non-unital noise maps. Along the way, we extend the parameter shift rule of VQAs to the noisy setting. We provide rigorous bounds in terms of the relevant variables that give rise to NIBPs and NILSs, along with numerical simulations of the depolarizing and amplitude-damping maps that illustrate our analytical results.
Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.
Variational quantum algorithms are promising candidates for near-term quantum computing but can be hindered by barren plateaus, where gradients vanish exponentially and optimization becomes intractable. Noise-Induced Barren Plateaus (NIBP) are particularly concerning because they are predicted to arise generically from noise accumulation, independent of system size, circuit structure, and observable locality. We experimentally investigate NIBP on IBM quantum hardware. Using Information Content Landscape Analysis (ICLA), we efficiently estimate gradient norms for variational circuits ranging from 8 to 102 qubits, up to hundreds of parameters and circuit runtimes of hundreds of microseconds. Contrary to NIBP expectations, we observe that gradient magnitudes saturate beyond a characteristic runtime rather than decaying exponentially. Classical simulations of the 8-qubit case under noiseless, depolarizing, amplitude-damping, and dephasing noise models support this behavior. Consistent with recent theory, our results show that T1-dominated non-unital noise inhibits the emergence of NIBP. Our analysis suggest that average calibration metrics may be insufficient to predict variational algorithm performance.
Abstract In variational quantum algorithms the parameters of a parameterized quantum circuit are optimized in order to minimize a cost function that encodes the solution of the problem. The barren plateau phenomenon manifests as an exponentially vanishing dependence of the cost function with respect to the variational parameters, and thus hampers the optimization process. We discuss how, and in which sense, the phenomenon of noise-induced barren plateaus emerges in parameterized quantum circuits with a layered noise model. Previous results have shown the existence of noise-induced barren plateaus in the presence of local Pauli noise (Wang et al 2021 Nat. Commun. 12 6961). We extend these results analytically to arbitrary completely-positive trace preserving maps in two cases: (1) when a parameter-shift rule holds, (2) when the parameterized quantum circuit at each layer forms a unitary 2-design. The second example shows how highly expressive unitaries give rise not only to standard barren plateaus (McClean et al 2018 Nat. Commun. 9 4812), but also to noise-induced ones. In the second part of the paper, we study numerically the emergence of noise-induced barren plateaus in QAOA circuits focusing on the case of MaxCut problems on d -regular graphs and amplitude damping noise.
Variational quantum algorithms (VQAs) offer a promising route toward simulating many-body quantum systems on noisy intermediate-scale quantum (NISQ) hardware. However, their scalability is severely limited by noise-induced barren plateaus (NIBPs), where hardware noise causes the gradients of the cost function to vanish exponentially with circuit depth, rendering optimization impossible. In this work, we demonstrate that introducing nonunitary elements into the variational ansatz can mitigate NIBPs in open-quantum systems. Using an analytically tractable infinite-range dissipative Ising model, we show that a nonunitary ansatz restores finite gradients in the presence of depolarizing noise, enabling convergence to the correct symmetry-broken steady state. We also develop a Floquet-type variational ansatz in which each layer repeats the same parameters, reducing the deep variational circuit to an effective quantum channel whose fixed points can be analyzed directly. We then extend these ideas to a realistic quantum-chemistry system by simulating electron transport through Oligophenylethynylene-sulfurmethyl (OPE-SMe) using Hamiltonians and jump operators of the model derived from first-principles polarizable QM/MM calculations. Our results show that nonunitary variational ansätze provide a scalable and physically grounded route for simulating open-system steady states on NISQ hardware, offering a pathway to overcoming one of the limitations of current quantum hardware.
Abstract Variational quantum algorithms (VQAs) are widely applied in the noisy intermediate-scale quantum era and are expected to demonstrate quantum advantage. However, training VQAs faces difficulties, one of which is the so-called barren plateaus (BPs) phenomenon, where gradients of cost functions vanish exponentially with the number of qubits. In this paper, inspired by transfer learning, where knowledge of pre-solved tasks could be further used in a different but related work with training efficiency improved, we report a parameter initialization method to mitigate BP. In the method, a small-sized task is solved with a VQA. Then the ansatz and its optimum parameters are transferred to tasks with larger sizes. Numerical simulations show that this method could mitigate BP and improve training efficiency. A brief discussion on how this method can work well is also provided. This work provides a reference for mitigating BP, and therefore, VQAs could be applied to more practical problems.
Variational quantum algorithms (VQAs) are a leading framework for realizing quantum advantages in the Noisy Intermediate-Scale Quantum (NISQ) era, with applications spanning discrete combinatorial problems and continuous optimization. While the topologies of parameterized quantum circuits (ansatzes) fundamentally govern both expressibility and trainability in continuous landscapes, existing reviews predominantly focus on static algorithmic classifications or discrete settings, leaving the structural evolution and practical limitations of ansatz architectures insufficiently explored. To address this gap, this review presents a systematic analysis of variational ansatz architectures, tracing their progression from static, pre-defined topologies to adaptive growth mechanisms. Beyond traditional gradient-driven and architecture-search paradigms, we evaluate supplementary strategies such as layerwise training and noise-adaptive construction, revealing inherent vulnerabilities such as local minima entrapment and the compilation overhead induced by calibration drift. The mathematical foundations of VQAs are outlined, and representative fixed ansatz architectures, including hardware-efficient, physics-inspired, and problem-specific designs, are characterized within continuous-domain mappings. Intrinsic limitations arising from barren plateaus (BPs) and noise-induced barren plateaus (NIBPs) are analyzed, revealing the fundamental coupling between circuit depth, parameter scaling, and trainability degradation. Furthermore, adaptive construction strategies and recent advances in automated variational quantum architecture search (VQAS) are examined. Through the synthesis of intrinsic limitations (BPs, NIBPs, and hardware-algorithm coupling) and the evaluation of standardized benchmarking protocols, this review rigorously assesses the resource trade-offs of current VQA frameworks. Ultimately, next-generation ansatz design will adopt hardware–software co-design principles grounded in physical constraints, enabling scalable and noise-resilient quantum optimization.