Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility
Not on the map. Why?
Abstract (arXiv)
Quantum algorithms based on parameterized quantum circuits (PQCs) have enabled a wide range of applications on near-term quantum devices. However, existing PQC architectures face several challenges, among which the ``barren plateaus" phenomenon is particularly prominent. In such cases, the loss function concentrates exponentially with increasing system size, thereby hindering effective parameter optimization. To address this challenge, we propose a general and hardware-efficient method for eliminating barren plateaus in an arbitrary PQC. Specifically, our approach achieves this by inserting a layer of easily implementable quantum channels into the original PQC, each channel requiring only one ancilla qubit and four additional gates, yielding a modified PQC (MPQC) that is provably at least as expressive as the original PQC and, under mild assumptions, is guaranteed to be free from barren plateaus. Furthermore, by appropriately adjusting the structure of MPQCs, we rigorously prove that any parameter in the original PQC can be made trainable. Importantly, the absence of barren plateaus in MPQCs is robust against realistic noise, making our approach directly applicable to near-term quantum hardware. Numerical simulations demonstrate that MPQC effectively eliminates barren plateaus in PQCs for preparing thermal states of systems with up to 100 qubits and 2400 layers. Furthermore, in end-to-end simulations, MPQC significantly outperforms PQC in finding the ground-state energy of a complex Hamiltonian.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 68 references that are in the map. First posted on arXiv 17 Nov 2025.
Builds on
16 of 68 references.
References · 16
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Variational Quantum Algorithmscited by 687
- 2018Barren plateaus in quantum neural network training landscapescited by 624
- 2021Connecting ansatz expressibility to gradient magnitudes and barren plateauscited by 180
- 2019Efficient Learning for Deep Quantum Neural Networkscited by 160
- 2024Barren Plateaus in Variational Quantum Computingcited by 130
- 2020Absence of Barren Plateaus in Quantum Convolutional Neural Networkscited by 124
- 2023Does provable absence of barren plateaus imply classical simulability?cited by 78
- 2021Equivalence of quantum barren plateaus to cost concentration and narrow gorgescited by 53
- 2022Out-of-distribution generalization for learning quantum dynamicscited by 49
- 2022Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuitscited by 42
- 2022Experimental quantum adversarial learning with programmable superconducting qubitscited by 38
4 more
- 2021Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculuscited by 30
- 2020Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuitscited by 26
- 2023Quantum Deep Hedgingcited by 22
- 2023Expressibility-induced Concentration of Quantum Neural Tangent Kernelscited by 7
Built on by
Not cited yet.