Comprehensive Numerical Studies of Barren Plateau and Overparametrization in Variational Quantum Algorithm

• URL: http://arxiv.org/abs/2602.03291v1
• Date: Tue, 03 Feb 2026 09:17:48 GMT
• Title: Comprehensive Numerical Studies of Barren Plateau and Overparametrization in Variational Quantum Algorithm
• Authors: Himuro Hashimoto, Akio Nakabayashi, Lento Nagano, Yutaro Iiyama, Ryu Sawada, Junichi Tanaka, Koji Terashi,
• Abstract summary: The variational quantum algorithm (VQA) with a parametrized quantum circuit is widely applicable to near-term quantum computing.<n>VQA optimization often suffers from vanishing gradients called barren plateau (BP) and the presence of local minima.<n>This paper quantitatively evaluating the impacts of BP and OP and their interplay on the optimization of a variational quantum circuit.
• Score: 0.1507721242745381
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The variational quantum algorithm (VQA) with a parametrized quantum circuit is widely applicable to near-term quantum computing, but its fundamental issues that limit optimization performance have been reported in the literature. For example, VQA optimization often suffers from vanishing gradients called barren plateau (BP) and the presence of local minima in the landscape of the cost function. Numerical studies have shown that the trap in local minima is significantly reduced when the circuit is overparametrized (OP), where the number of parameters exceeds a certain threshold. Theoretical understanding of the BP and OP phenomena has advanced over the past years, however, comprehensive studies of both effects in the same setting are not fully covered in the literature. In this paper, we perform a comprehensive numerical study in VQA, quantitatively evaluating the impacts of BP and OP and their interplay on the optimization of a variational quantum circuit, using concrete implementations of one-dimensional transverse and longitudinal field quantum Ising model. The numerical results are compared with the theoretical diagnostics of BP and OP phenomena. The framework presented in this paper will provide a guiding principle for designing VQA algorithms and ansatzes with theoretical support for behaviors of parameter optimization in practical settings.

Related papers

• Quantum optimisation applied to the Quadratic Assignment Problem [4.483208369550461]
  This paper investigates the performance of the emerging non-variational Quantum Walk-based optimisation algorithm (NV-QWOA) for solving small instances of the Quadratic Assignment Problem (QAP)<n>Performance is evaluated using two metrics: the number of objective function evaluations and the number of algorithm iterations required to consistently reach optimal or near optimal solutions across QAP instances with 5 to 10 facilities.<n>Our findings highlight the practical utility of quantum walks for complex quantum problems and establish a foundation for future quantum optimisation algorithms.
  arXiv  Detail & Related papers  (2026-01-03T07:50:03Z)
• Quantum Approximate Optimization Algorithm with Fixed Number of Parameters [0.0]
  We introduce a novel quantum optimization paradigm: the Fixed--Count Approximate Quantum Optimization Algorithm (FPC-QAOA)<n>It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth.<n>We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA.
  arXiv  Detail & Related papers  (2025-12-24T14:02:31Z)
• An Introduction to the Quantum Approximate Optimization Algorithm [51.56484100374058]
  The tutorial begins by outlining variational quantum circuits and QUBO problems.<n>Next, it explores the QAOA in detail, covering its Hamiltonian formulation, gate decomposition, and example applications.<n>The tutorial extends these concepts to higher-order Hamiltonians and discussing the associated symmetries and circuit construction.
  arXiv  Detail & Related papers  (2025-11-23T09:54:20Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Post-Variational Ground State Estimation via QPE-Based Quantum Imaginary Time Evolution [0.0]
  We present the QPE-based quantum imaginary time evolution (QPE-QITE) algorithm, designed for post-variational ground state estimation.<n>Unlike variational methods, QPE-QITE employs additional ancillae to project the quantum register into low-energy eigenstates.<n>We demonstrate the capabilities of QPE-QITE by applying it to the low-autocorrelation binary sequences (LABS) problem.
  arXiv  Detail & Related papers  (2025-04-15T18:44:14Z)
• 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)
• 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)
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization [3.031137751464259]
  We show that by reducing the initial domain of each parameter proportional to the square root of circuit depth, the magnitude of the cost gradient decays at most inversely to qubit count and circuit depth. This strategy can protect specific quantum neural networks from exponentially many spurious local minima.
  arXiv  Detail & Related papers  (2023-02-14T06:41:37Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Fundamental limitations on optimization in variational quantum algorithms [7.165356904023871]
  A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs) We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability. This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
  arXiv  Detail & Related papers  (2022-05-10T17:14:57Z)
• 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)
• 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)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.