In hybrid classical-quantum computing, variational quantum algorithms (VQAs) have emerged as a promising approach in the Noisy Intermediate-Scale Quantum (NISQ) era; however, their performance is often hindered by barren plateaus, where gradients vanish exponentially, rendering optimization ineffective. In this work, we introduce a residual-inspired quantum circuit architecture that incorporates a single messenger qubit, referred to as Q-LINK. By conducting numerical simulations on random quantum states, we observe that Q-LINK significantly enhances optimization behavior by sustaining larger gradient variance and accelerating convergence. Additionally, Q-LINK improves convergence efficiency by 4-6 times and increases gradient variance by up to two orders of magnitude compared with the Vanilla model. To further characterize the impact of the proposed structure, we analyze the expressibility of the circuits before and after introducing Q-LINK and find that the overall expressibility value remains largely unchanged, indicating that the original representational capacity of the circuit is preserved. In addition, we visualize the loss landscapes of different architectures to provide insights into how the proposed design reshapes the cost function landscape. These results demonstrate that introducing only a single messenger qubit can effectively mitigate barren plateau effects while maintaining the ability to explore the Hilbert space of variational quantum circuits.
Comments
Accepted and Presented at the 19th IEEE Dallas Circuits and Systems conference
In hybrid classical-quantum computing, variational quantum algorithms (VQAs) have emerged as a promising approach in the Noisy Intermediate-Scale Quantum (NISQ) era; however, their performance is often hindered by barren plateaus, where gradients vanish exponentially, rendering optimization ineffective. In this work, we introduce a residual-inspired quantum circuit architecture that incorporates a single messenger qubit, referred to as Q-LINK. By conducting numerical simulations on random quantum states, we observe that Q-LINK significantly enhances optimization behavior by sustaining larger gradient variance and accelerating convergence. Additionally, Q-LINK improves convergence efficiency by 4-6 times and increases gradient variance by up to two orders of magnitude compared with the Vanilla model. To further characterize the impact of the proposed structure, we analyze the expressibility of the circuits before and after introducing Q-LINK and find that the overall expressibility value remains largely unchanged, indicating that the original representational capacity of the circuit is preserved. In addition, we visualize the loss landscapes of different architectures to provide insights into how the proposed design reshapes the cost function landscape. These results demonstrate that introducing only a single messenger qubit can effectively mitigate barren plateau effects while maintaining the ability to explore the Hilbert space of variational quantum circuits.
In hybrid classical-quantum computing, variational quantum algorithms (VQAs) have emerged as a promising approach in the Noisy Intermediate-Scale Quantum (NISQ) era; however, their performance is often hindered by barren plateaus, where gradients vanish exponentially, rendering optimization in-effective. In this work, we introduce a residual-inspired quantum circuit architecture that incorporates a single messenger qubit, referred to as Q-LINK. By conducting numerical simulations on random quantum states, we observe that Q-LINK significantly enhances optimization behavior by sustaining larger gradient variance and accelerating convergence. Additionally, Q-LINK improves convergence efficiency by4−6times and increases gradient variance by up to two orders of magnitude compared with the Vanilla model. To further characterize the impact of the proposed structure, we analyze the expressibility of the circuits before and after introducing Q-LINK and find that the overall expressibility value remains largely unchanged, indicating that the original representational capacity of the circuit is preserved. In addition, we visualize the loss landscapes of different architectures to provide insights into how the proposed design reshapes the cost function landscape. These results demonstrate that introducing only a single messenger qubit can effectively mitigate barren plateau effects while maintaining the ability to explore the Hilbert space of variational quantum circuits.
Abstract Combining classical optimization with parameterized quantum circuit evaluation, variational quantum algorithms (VQAs) are among the most promising algorithms in near-term quantum computing. However, the training of variational quantum circuits (VQCs) is susceptible to a phenomenon known as barren plateaus (BPs). Various approaches have been proposed to mitigate this issue, such as using neural networks to generate VQC parameters. In this paper, we improve the NN-based BP mitigation approach by refining the neural network architecture and extend its applicability to a more generalized scenario that includes random quantum inputs and VQC structures. We evaluate the effectiveness of the approach by comparing the convergence speed before and after it is utilized. Furthermore, we give an explanation for the effectiveness of the NN-based BP mitigation approach by utilizing a loss landscape visualization technique and the expressibility metric of VQC. The smoothness of the loss landscape offers an intuitive insight into the approach’s utility, while the reduction in expressibility accounts for the enhanced trainability. Our research highlights the universal applicability of the NN-based BP mitigation approach, underscoring its potential to drive progress in the development of VQAs across diverse domains.
Variational quantum algorithms (VQAs) have emerged as a leading paradigm in near-term quantum computing, yet their performance can be hindered by the so-called barren plateau problem, where gradients vanish exponentially with system size or circuit depth. While most existing VQA research employs simple Gaussian or zero-initialization schemes, classical deep learning has long benefited from sophisticated weight initialization strategies such as Xavier, He, and orthogonal initialization to improve gradient flow and expedite convergence. In this work, we systematically investigate whether these classical methods can mitigate barren plateaus in quantum circuits. We first review each initialization's theoretical grounding and outline how to adapt the notions from neural networks to VQAs. We then conduct extensive numerical experiments on various circuit architectures and optimization tasks. Our findings indicate that while the initial heuristics, inspired by classical initialization, yield moderate improvements in certain experiments, their overall benefits remain marginal. By outlining a preliminary exploration plan in this paper, we aim to offer the research community a broader perspective and accessible demonstrations. Furthermore, we propose future research directions that may be further refined by leveraging the insights gained from this work.
Abstract—Quantum Machine Learning (QML) operating on Noisy Intermediate-Scale Quantum (NISQ) hardware represents an emerging computational paradigm to address high-dimensional optimization problems that challenge classical Von Neumann supercomputing architectures. By mapping complex feature vectors into exponentially large 2^N Hilbert state spaces via Parameterized Quantum Circuits (PQCs) and Variational Quantum Algorithms (VQAs), QML targets computational advantages in combinatorial optimization, high-dimensional classification, and quantum-enhanced molecular modeling. However, the theoretical promise of NISQ-era variational computing is severely constrained by three fundamental bottlenecks: (1) Barren Plateaus, characterized by the exponential concentration of measure and vanishing variance of cost function gradients; (2) Hardware Decoherece Noise and readout error rates that corrupt quantum state fidelity; and (3) Classical-to-Quantum State Preparation bottlenecks that can erase theoretical computational speedups. This paper delivers an exhaustive, mathematically formal technical investigation and empirical benchmark of QML architectures for high-dimensional optimization. We formalize the Haar-distributed geometric mechanics of barren plateaus under 2-design unitary assumptions, evaluate barren plateau mitigation through shallow local cost operators and layer-by-layer parameter initialization, and contrast Variational Quantum Eigensolvers (VQE) with Quantum Kernel Support Vector Machines (Q-SVM). Furthermore, we construct an empirical benchmarking testbed executing across both state-vector simulators and superconducting quantum backends (IBM Quantum Heron / Eagle architectures), evaluating 127-qubit Hamiltonian optimization and high-dimensional financial portfolio allocation. Our findings demonstrate that while global cost functions suffer exponential gradient decay Var[grad] ~ O(2^-N) across circuit depth d >= 4, local Hamiltonian decomposition maintains trainable variance, achieving a 98.2% ground-state fidelity under zero-noise extrapolation (ZNE) error mitigation. Finally, we formulate open challenges in quantum error mitigation scaling, non-perturbative barren plateau escapes, and quantum data loading efficiency. Index Terms—Quantum Machine Learning (QML), Parameterized Quantum Circuits (PQCs), Variational Quantum Eigensolver (VQE), Barren Plateaus, Quantum Kernel Methods, NISQ Computing, Error Mitigation, Hilbert Space.
Variational quantum algorithms (VQAs) combine the advantages of classical optimization and quantum computation, making them one of the most promising approaches in the Noisy Intermediate-Scale Quantum (NISQ) era. However, when optimized using gradient descent, VQAs often suffer from the vanishing gradient problem, commonly known as the barren plateau. Various methods have been proposed to mitigate this issue. In this work, we propose a hybrid approach that integrates a classical proportional-integral-derivative (PID) controller with a neural network to update the parameters of variational quantum circuits. We refer to this method as NPID, which aims to mitigate the barren plateau. The proposed algorithm is tested on randomly generated quantum input states and random quantum circuits with parametric noise to evaluate its universality, and additional simulations are conducted under different noise rates to examine its robustness. The effectiveness of the proposed method is evaluated based on its convergence speed toward the target cost value. Simulation results show that NPID achieves a convergence efficiency 2-9 times higher than NEQP and QV, with performance fluctuations averaging only 4.45% across different noise levels. These results highlight the potential of integrating classical control theory into quantum optimization, providing a new perspective for improving the trainability and stability of variational quantum algorithms.
Variational Quantum Algorithms (VQAs) have gained prominence as a viable framework for exploiting near-term quantum devices in applications ranging from optimization and chemistry simulation to machine learning. However, the effectiveness of VQAs is often constrained by the so-called barren plateau problem, wherein gradients diminish exponentially as system size or circuit depth increases, thereby hindering training. In this work, we propose a reinforcement learning (RL)-based initialization strategy to alleviate the barren plateau issue by reshaping the initial parameter landscape to avoid regions prone to vanishing gradients. In particular, we explore several RL algorithms (Deterministic Policy Gradient, Soft ActorCritic, and Proximal Policy Optimization, etc.) to generate the circuit parameters (treated as “actions”) that minimize the VQAs cost function before standard gradient-based optimization. By pre-training with RL in this manner, subsequent optimization using methods such as gradient descent or Adam proceeds from a more favorable initial state. Extensive numerical experiments under various noise conditions and tasks consistently demonstrate that the RL-based initialization method significantly enhances both convergence speed and final solution quality. Moreover, comparisons among different RL algorithms highlight that multiple approaches can achieve comparable performance gains, underscoring the flexibility and robustness of our method. These findings shed light on a promising avenue for integrating machine learning techniques into quantum algorithm design, offering insights into how RL-driven parameter initialization can accelerate the scalability and practical deployment of VQAs. Opening up a promising path for the research community in machine learning for quantum, especially barren plateau problems in VQAs.