Escaping Barren Plateau: Co-Exploration of Quantum Circuit Parameters and Architectures

• URL: http://arxiv.org/abs/2501.13275v1
• Date: Wed, 22 Jan 2025 23:34:17 GMT
• Title: Escaping Barren Plateau: Co-Exploration of Quantum Circuit Parameters and Architectures
• Authors: Yipei Liu, Yuhong Song, Jinyang Li, Qiang Guan, Cheng-chang Lu, Youzuo Lin, Weiwen Jiang,
• Abstract summary: Barren plateaus (BP) hinder the training of variational quantum circuits. BP problem manifests at different scales depending on the specific application. We propose a novel quantum circuit parameter and architecture co-exploration framework, namely AntiBP.
• Score: 9.020754400793933
• License:
• Abstract: Barren plateaus (BP), characterized by exponentially vanishing gradients that hinder the training of variational quantum circuits (VQC), present a pervasive and critical challenge in applying variational quantum algorithms to real-world applications. It is widely recognized that the BP problem becomes more pronounced with an increase in the number of parameters. This work demonstrates that the BP problem manifests at different scales depending on the specific application, highlighting the absence of a universal VQC ansatz capable of resolving the BP issue across all applications. Consequently, there is an imminent need for an automated tool to design and optimize VQC architectures tailored to specific applications. To close the gap, this paper takes Variational Quantum Eigensolvers (VQEs) as a vehicle, and we propose a novel quantum circuit parameter and architecture co-exploration framework, namely AntiBP. Experimental results demonstrate that AntiBP effectively avoids the BP issue for circuits that are not under-parameterized in noise-free environments. Furthermore, AntiBP significantly outperforms baseline VQEs in noisy environments.

Related papers

• 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) This paper presents an easy-to-implement approach to mitigate the challenges posed by barren plateaus (BPs) in VQAs. 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)
• A Review of Barren Plateaus in Variational Quantum Computing [0.32360458646569984]
  Variational quantum computing offers a flexible computational paradigm with applications in diverse areas. A key obstacle to realizing their potential is the Barren Plateau (BP) phenomenon. This article provides a comprehensive review of the current understanding of the BP phenomenon.
  arXiv  Detail & Related papers  (2024-05-01T18:00:10Z)
• 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)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• 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)
• Deep Attentive Belief Propagation: Integrating Reasoning and Learning for Solving Constraint Optimization Problems [24.63675651321079]
  Belief Propagation (BP) is an important message-passing algorithm for various reasoning tasks over graphical models. We propose a novel self-supervised learning algorithm for DABP with a smoothed solution cost. Our model significantly outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-09-24T13:03:46Z)
• NAPA: Intermediate-level Variational Native-pulse Ansatz for Variational Quantum Algorithms [18.66030936302464]
  Variational quantum algorithms (VQAs) have demonstrated great potentials in the Noisy Intermediate Scale Quantum (NISQ) era. We propose NAPA, a native-pulse ansatz generator framework for VQAs.
  arXiv  Detail & Related papers  (2022-08-02T02:50:36Z)
• Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations [2.4290469931265344]
  Variational quantum algorithms (VQAs) are widely applied in the noisy intermediate-scale quantum era. Training VQAs faces difficulties, one of which is the so-called barren plateaus (BP) phenomenon.
  arXiv  Detail & Related papers  (2021-12-21T02:52:59Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• 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)

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.