Searcharxiv⌕ Search

arXiv subjects

Zhehao Yi

Publications and source records attributed to Zhehao Yi.

6 recordsLinked to original sources
arXiv2026

Q-LINK: Quantum Layerwise Information Residual Network via a Messenger Qubit for Barren Plateaus Mitigation

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.

quant-ph↗
arXiv2025

Geometric Optimization on Lie Groups: A Lie-Theoretic Explanation of Barren Plateau Mitigation for Variational Quantum Algorithms

Barren plateaus, which means the training gradients become extremely small, pose a major challenge in optimizing parameterized quantum circuits, often making the learning process impractically slow or stall. This work shows why using neural networks to generate quantum circuit parameters helps overcome this difficulty. We introduce a geometric viewpoint that describes how the parameters produced by neural networks evolve during training. Our analysis shows that these parameters follow smooth and efficient paths that avoid the flat regions in the training that cause barren plateaus. This provides a computational explanation for the improved trainability observed in recent neural network-assisted quantum learning methods. Overall, our findings bridge ideas from quantum machine learning and computational optimization, offering new insight into the structure of quantum models and guiding future approaches for designing more trainable quantum circuits or parameter initialization.

quant-ph↗
arXiv2025

The PID Controller Strikes Back: Classical Controller Helps Mitigate Barren Plateaus in Noisy Variational Quantum Circuits

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.

quant-ph↗
arXiv2025

Learnability of a hybrid quantum-classical neural network for graph-structured quantum data

Graph-structured data commonly arise in many real-world applications, and this extends naturally into the quantum setting, where quantum data with inherent graph structures are frequently generated by typical quantum data sources. However, existing state-of-the-art models often lack training and evaluation on deeper quantum neural networks. In this work, we design a hybrid quantum-classical neural network with deep residual learning, termed Res-HQCNN, specifically designed to handle graph-structured quantum data.Building upon this architecture, we systematically explore the interplay between residual block structures and graph information in both training and testing phases. Through extensive experiments, we demonstrate that incorporating graph structure information into the quantum data significantly improves learning efficiency compared to the existing model. Additionally, we conduct comparative experiments to evaluate the effectiveness of residual blocks. Our results show that the residual structure enables deeper Res-HQCNN models to learn graph-structured quantum data more efficiently and accurately.

quant-ph↗
arXiv2024

Enhancing Variational Quantum Circuit Training: An Improved Neural Network Approach for Barren Plateau Mitigation

Combining classical optimization with parameterized quantum circuit evaluation, variational quantum algorithms (VQAs) are among the most promising algorithms in near-term quantum computing. Similar to neural networks (NNs), VQAs iteratively update circuit parameters to optimize a cost function. However, the training of variational quantum circuits (VQCs) is susceptible to a phenomenon known as barren plateaus (BPs). Various methods 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 this approach by comparing the convergence speed before and after it is utilized. Furthermore, we give an explanation for the effectiveness of this method 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 method'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.

quant-ph↗