Estimates of loss function concentration in noisy parametrized quantum circuits

Abstract

Variational quantum computing offers a powerful framework with applications across diverse fields such as quantum chemistry, machine learning, and optimization. However, its scalability is hindered by the exponential concentration of the loss function, known as the barren plateau problem. While significant progress has been made and prior work has separately analyzed barren plateaus in unitary and noisy settings, their combined impact remains poorly understood, largely due to limitations in conventional Lie-algebraic approaches. In this work, we introduce a novel analytical framework based on non-negative matrix theory that enables the description of the variance in layered noisy quantum circuits with arbitrary noise channels. This approach enables the derivation of exact expressions in the deep-circuit regime, uncovering the complex interplay between unitary layers and noise. Notably, we identify a noise-induced absorption mechanism-a phenomenon absent in purely unitary dynamics-which provides new insight into how noise shapes circuit behavior. We further present a controlled convergence analysis, establishing general lower bounds on the variance of both deep and shallow circuits. This leads to a principled connection between noise resilience and the expressive capacity of parameterized quantum circuits, particularly under smart initialization strategies. Our theoretical results are supported by numerical simulations and illustrative applications.

References in corpus (25)

• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• On barren plateaus and cost function locality in variational quantum algorithms
• Early Fault-Tolerant Quantum Computing
• Collapse models with non-white noises
• Evaluating the noise resilience of variational quantum algorithms
• Does provable absence of barren plateaus imply classical simulability?
• Barren plateaus in quantum tensor network optimization
• Hamiltonian variational ansatz without barren plateaus
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Universal Sampling Lower Bounds for Quantum Error Mitigation
• Universal cost bound of quantum error mitigation based on quantum estimation theory
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• A novel approach to noisy gates for simulating quantum computers
• Variational quantum simulation: a case study for understanding warm starts
• Symmetry breaking in geometric quantum machine learning in the presence of noise
• Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
• Non-Unitary Quantum Machine Learning
• Emergence of noise-induced barren plateaus in arbitrary layered noise models
• Simulating photonic devices with noisy optical elements
• Equivariant Variational Quantum Eigensolver to detect Phase Transitions through Energy Level Crossings