Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility

• URL: http://arxiv.org/abs/2511.13408v2
• Date: Tue, 18 Nov 2025 03:38:23 GMT
• Title: Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility
• Abstract summary: We propose a general and hardware-efficient method for eliminating barren plateaus in an arbitrary PQC.<n>Specifically, our approach achieves this by inserting a layer of easily implementable quantum channels into the original PQC.<n> Importantly, the absence of barren plateaus in MPQCs is robust against realistic noise, making our approach directly applicable to current noisy intermediate-scale quantum (NISQ) hardware.
• Score: 6.15507840445531
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 current noisy intermediate-scale quantum (NISQ) hardware. Numerically, we demonstrate the practicality of our method by modifying a commonly used PQC for thermal-state preparation. The results show that {barren plateaus are effectively eliminated} in this class of circuits with up to 100 qubits and 2400 layers, whereas the original ansatz suffers from severe gradient vanishing.

Related papers

• Challenges in Barren Plateau Mitigation with Dynamic Parameterized Quantum Circuits [0.22940141855172033]
  Variational quantum algorithms (VQAs) are a promising paradigm for quantum advantage, yet their trainability is severely hampered by barren plateaus (BPs)<n>Several works have proposed using dynamic parameterized quantum circuits (DPQCs) which intersperse unitary layers with parameterized CPTP maps.<n>We unite this class of circuits into a formalization for DPQCs. We identify constraints on the nature and the structure of DPQCs if they are to prevent a significant number of parameters from becoming untrainable.
  arXiv  Detail & Related papers  (2026-06-22T00:59:01Z)
• Global Optimization for Parametrized Quantum Circuits [3.558201566667322]
  We study the training of practical classes of quantum circuits with a constant number of trainable parameters.<n>Our main result is a fully randomized approximation scheme (FPRAS)<n>Unlike the standard hybrid quantum-classical training in variational algorithms, our approach separates the computation into two distinct stages.
  arXiv  Detail & Related papers  (2026-03-23T09:49:40Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Almost fault-tolerant quantum machine learning with drastic overhead reduction [1.1695271533915463]
  This work proposes the idea of partial quantum error correction (QEC) for quantum machine learning (QML) models.<n>By assuming error-corrected two-qubit Controlled-$Z$s (Clifford operations), we demonstrate that the QML models remain trainable even when single-qubit gates are subjected to depolarizing noise.<n>Our work proposes a resource-efficient solution for trainable and high-accuracy QML implementations in noisy environments.
  arXiv  Detail & Related papers  (2025-07-25T04:43:37Z)
• Addressing the Current Challenges of Quantum Machine Learning through Multi-Chip Ensembles [8.3236800339513]
  We propose a multi-chip ensemble VQC framework that systematically overcomes these hurdles.<n>By high-dimensional computations across ensembles of smaller, independently operating quantum chips, our approach demonstrably mitigates barren plateaus, enhances generalization, and reduces both quantum error bias and variance simultaneously without additional mitigation overhead.<n>This allows for robust processing of large-scale data, as validated on standard benchmarks and a real-world PhysioNet EEG dataset.
  arXiv  Detail & Related papers  (2025-05-13T17:57:53Z)
• PTQ1.61: Push the Real Limit of Extremely Low-Bit Post-Training Quantization Methods for Large Language Models [64.84734437930362]
  Large Language Models (LLMs) suffer severe performance degradation when facing extremely low-bit (sub 2-bit) quantization.<n>We propose an extremely low-bit PTQ method called PTQ1.61, which enables weight quantization to 1.61-bit for the first time.<n>Experiments indicate our PTQ1.61 achieves state-of-the-art performance in extremely low-bit quantization.
  arXiv  Detail & Related papers  (2025-02-18T08:04:58Z)
• Enhanced Quantum Circuit Cutting Framework for Sampling Overhead Reduction [25.01488143369413]
  ShotQC is an enhanced circuit cutting framework with effective sampling overhead reduction.<n>It achieves significant reductions in sampling overhead without increasing classical postprocessing complexity.
  arXiv  Detail & Related papers  (2024-12-23T16:34:57Z)
• Machine-Learning Insights into the Entanglement-trainability Correlation of Parameterized Quantum Circuits [17.975555487972166]
  Variational quantum algorithms (VQAs) have emerged as the leading strategy to obtain quantum advantage on the current noisy intermediate-scale devices.<n>Their entanglement-trainability correlation, as the major reason for the barren plateau (BP) phenomenon, poses a challenge to their applications.<n>In this Letter, we suggest a gate-to-tensor (GTT) encoding method for parameterized quantum circuits (PQCs)<n>Two long short-term memory networks (L-G networks) are trained to predict both entanglement and trainability.
  arXiv  Detail & Related papers  (2024-06-04T06:28:05Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Instantaneous Quantum Polynomial-Time Sampling and Verifiable Quantum Advantage: Stabilizer Scheme and Classical Security [1.5647673631415648]
  We introduce a family of IQP sampling protocols called the stabilizer scheme.<n>We also introduce the Hidden Structured Code (HSC) problem as a well-defined mathematical challenge.
  arXiv  Detail & Related papers  (2023-08-14T14:03:33Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise [0.0]
  Parametrized Quantum Circuits (PQCs) are employed in Quantum Neural Networks and Variational Quantum Algorithms. We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. We introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs.
  arXiv  Detail & Related papers  (2020-11-17T16:43:05Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.