Challenges in Barren Plateau Mitigation with Dynamic Parameterized Quantum Circuits

• URL: http://arxiv.org/abs/2606.23751v1
• Date: Mon, 22 Jun 2026 00:59:01 GMT
• Title: Challenges in Barren Plateau Mitigation with Dynamic Parameterized Quantum Circuits
• Abstract summary: 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.
• Score: 0.22940141855172033
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms (VQAs) are a promising paradigm for quantum advantage, yet their trainability is severely hampered by barren plateaus (BPs). Several works have proposed using dynamic parameterized quantum circuits (DPQCs) which intersperse unitary layers with parameterized CPTP maps (e.g. engineered dissipation, feedforward gadgets, or periodic resets), as a potential route around BPs. 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. We further show via purification and Pauli path analysis, a mechanism with which cost function anti-concentrates in DPQCs while still suffering from untrainability of a significant number of parameters. Our analysis reveals ways to design DPQCs that do not have an exponentially concentrated cost function, and our results suggest that BP mitigation via DPQCs is at least as hard as designing BP-free unitaries.

Related papers

• How to find expressible and trainable parameterized quantum circuits? [0.22940141855172033]
  We propose a property-based ansatz-search framework for identifying circuits that combine trainability and expressibility.<n>We demonstrate its practical viability on a real quantum computer and apply it to variational quantum algorithms.
  arXiv  Detail & Related papers  (2026-03-15T15:54:30Z)
• Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility [6.15507840445531]
  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.
  arXiv  Detail & Related papers  (2025-11-17T14:21:43Z)
• Escaping Barren Plateau: Co-Exploration of Quantum Circuit Parameters and Architectures [9.020754400793933]
  Barren plateaus (BP) hinder the training of variational quantum circuits.<n>BP problem manifests at different scales depending on the specific application.<n>We propose a novel quantum circuit parameter and architecture co-exploration framework, namely AntiBP.
  arXiv  Detail & Related papers  (2025-01-22T23:34:17Z)
• The Dilemma of Random Parameter Initialization and Barren Plateaus in Variational Quantum Algorithms [4.348591076994875]
  barren plateaus (BPs) are challenges posed by randomly parameterized quantum circuits (PQCs) within variational quantum algorithms (VQAs)<n>This paper presents an easy-to-implement approach to mitigate the challenges posed by barren plateaus (BPs) in VQAs.<n>Our work provides a clear path forward for quantum algorithm developers seeking to mitigate BPs and unlock the full potential of VQAs.
  arXiv  Detail & Related papers  (2024-12-09T13:08:46Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [55.8930142490617]
  We propose a decoder for QLDPC codes based on BP guided decimation (BPGD) BPGD significantly reduces the BP failure rate due to non-convergence.
  arXiv  Detail & Related papers  (2023-12-18T05:58:07Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• 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)
• Mode connectivity in the loss landscape of parameterized quantum circuits [1.7546369508217283]
  Variational training of parameterized quantum circuits (PQCs) underpins many employed on near-term noisy intermediate scale quantum (NISQ) devices. We adapt the qualitative loss landscape characterization for neural networks introduced in citegoodfellowqualitatively,li 2017visualizing and tests for connectivity used in citedraxler 2018essentially to study the loss landscape features in PQC training.
  arXiv  Detail & Related papers  (2021-11-09T18:28:46Z)
• 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)

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.