Variational quantum algorithms often encounter barren plateaus, where cost gradients decay rapidly with increasing circuit depth, undermining the trainability of parameterized quantum circuits. This paper evaluates AdaInit (Adaptive Initialization), proposed by Zhuang and Cunningham, which uses large language models to propose initial parameters for quantum neural networks. We study a simplified single-query AdaInit variant paired with GPU-accelerated simulation in NVIDIA CUDA-Q and apply it to binary classification on the DMR-IR mammography dataset. AdaInit delivers 14.6 times higher gradient variance at initialization than random initialization (0.0095 vs. 0.0006), producing 160 times faster convergence (1.1s vs. 176 s) while maintaining the same classification accuracy of 61.4 percent. We provide theoretical analysis grounded in the geometry of parameterized circuit landscapes and show empirically that LLM-guided initialization places the optimizer in trainable regions of parameter space. Beyond performance, our results indicate that a single LLM query can yield informative parameters without iterative refinement, suggesting a low-overhead path to improved trainability. The findings validate AdaInit in a medical imaging setting and demonstrate its compatibility with GPU-accelerated quantum backends for practical speedups.
Variational quantum algorithms often encounter barren plateaus, where cost gradients decay rapidly with increasing circuit depth, undermining the trainability of parameterized quantum circuits. This paper evaluates AdaInit (Adaptive Initialization), proposed by Zhuang and Cunningham, which uses large language models to propose initial parameters for quantum neural networks. We study a simplified single-query AdaInit variant paired with GPU-accelerated simulation in NVIDIA CUDA-Q and apply it to binary classification on the DMR-IR mammography dataset. AdaInit delivers 14.6 times higher gradient variance at initialization than random initialization (0.0095 vs. 0.0006), producing 160 times faster convergence (1.1s vs. 176 s) while maintaining the same classification accuracy of 61.4 percent. We provide theoretical analysis grounded in the geometry of parameterized circuit landscapes and show empirically that LLM-guided initialization places the optimizer in trainable regions of parameter space. Beyond performance, our results indicate that a single LLM query can yield informative parameters without iterative refinement, suggesting a low-overhead path to improved trainability. The findings validate AdaInit in a medical imaging setting and demonstrate its compatibility with GPU-accelerated quantum backends for practical speedups.
In the era of noisy intermediate-scale quantum (NISQ) computing, Quantum Neural Networks (QNNs) have emerged as a promising approach for various applications, yet their training is often hindered by barren plateaus (BPs), where gradient variance vanishes exponentially as the qubit size increases.Most initializationbased mitigation strategies rely heavily on predesigned static parameter distributions, thereby lacking adaptability to diverse model sizes or data conditions.To address these limitations, we propose AdaInit, a foundational framework that leverages large language models with the submartingale property to iteratively synthesize initial parameters for QNNs that yield nonnegligible gradient variance, thereby mitigating BPs.Unlike conventional one-shot initialization methods, AdaInit adaptively explores the parameter space by incorporating dataset characteristics and gradient feedback, with theoretical guarantees of convergence to finding a set of effective initial parameters for QNNs.We provide rigorous theoretical analyses of the submartingale-based process and empirically validate that AdaInit consistently outperforms existing initialization methods in maintaining higher gradient variance across various QNN scales.We believe this work may initiate a new avenue to mitigate BPs.
Although recent advances in transfer learning have simplified training, fine-tuning big language models remains an energy-intensive and expensive process, with high hardware and energy costs that make it difficult to use and scale. While quantum machine learning (QML) presents a promising theoretical tool to overcome these bottlenecks, the practical implementation is hampered by the barren plateau problem, a phenomenon well established in literature that manifests through exponentially vanishing gradients of deep parameterized quantum circuits (PQCs) with increasing circuit depth, preventing informative parameter updates by rendering the optimization landscape flat. This study presents a hybrid quantum-classical architecture in which a PQC layer is integrated into a pretrained classical LLM backbone and fine-tuned throughout this work. This iterative refinement loop is controlled by an Expected Improvement acquisition function, which actively guides the search process through parameter regimes with obvious non-vanishing gradient variance. The study proposes that this theory-driven initialization scheme reduces the onset of barren plateaus, thereby enabling efficient and stable convergence in hybrid optimization. Experiments show that the proposed method consistently outperforms purely classical fine-tuning baselines and randomly initialized quantum baselines on representative downstream natural language processing tasks. The experimental results show that principled parameter initialization leads to concrete improvements in convergence stability, gradient trainability, and task-level performance. In summary, this research provides a scalable method for integrating near-term noisy intermediate-scale Quantum (NISQ) devices into state-of-the-art deep learning pipelines, fostering the further real-world adoption of hybrid quantum-classical systems for demanding artificial intelligence tasks.
Medical image classification poses significant challenges due to the complex and nonlinear patterns present in imaging data. Traditional deep learning models often struggle to capture the intricate relationships inherent in such data, especially under conditions of noise and training instability. To address these limitations, this study proposes a novel Hybrid Quantum Convolutional Neural Network (HQCNN) integrated with a Gradient Variance-Controlled Optimizer (GVCO). The aim is to enhance diagnostic accuracy by combining classical convolutional layers for shallow feature extraction with a parameterized quantum circuit (PQC) that enables richer and more discriminative feature representations. The GVCO dynamically adjusts learning rates and momentum coefficients based on real-time gradient variance, improving convergence speed and generalization performance. The proposed HQCNN-GVCO model was evaluated on two public brain imaging datasets: the Kaggle Brain MRI dataset and the REMBRANDT dataset. It achieved classification accuracies of 99.2% and 98.2%, respectively. Compared to baseline HQCNN and other state-of-the-art models, HQCNN-GVCO demonstrated superior and more consistent performance. These findings highlight the potential of integrating quantum computing techniques with adaptive optimization strategies to advance reliable and accurate medical image analysis.
Parameterized quantum circuits (PQCs) have emerged as a foundational element in the development and applications of quantum algorithms. However, when initialized with random parameter values, PQCs often exhibit barren plateaus (BP). These plateaus, characterized by vanishing gradients with an increasing number of qubits, hinder optimization in quantum algorithms. In this paper, we analyze the impact of state-of-the-art parameter initialization strategies from classical machine learning in random PQCs from the aspect of BP phenomenon. Our investigation encompasses a spectrum of initialization techniques, including random, Xavier (both normal and uniform variants), He, LeCun, and Orthogonal methods. Empirical assessment reveals a pronounced reduction in variance decay of gradients across all these methodologies compared to the randomly initialized PQCs. Specifically, the Xavier initialization technique outperforms the rest, showing a 62% improvement in variance decay compared to the random initialization. The He, Lecun, and orthogonal methods also display improvements, with respective enhancements of 32 %, 28 %, and 26 %. This compellingly suggests that the adoption of these existing initialization techniques holds the potential to significantly amplify the training efficacy of Quantum Neural Networks (QNNs), a subclass of PQCs. Demonstrating this effect, we employ the identified techniques to train QNNs for learning the identity function, effectively mitigating the adverse effects of BPs. The training performance, ranked from the best to the worst, aligns with the variance decay enhancement as outlined above. This paper underscores the role of tailored parameter initialization in mitigating the BP problem and eventually enhancing the training dynamics of QNNs.
Parameterized quantum circuits (PQCs) have been widely used as a machine learning model to explore the potential of achieving quantum advantages for various tasks. However, training PQCs is notoriously challenging owing to the phenomenon of plateaus and/or the existence of (exponentially) many spurious local minima. To enhance trainability, in this work we propose an efficient parameter initialization strategy with theoretical guarantees. We prove that, by reducing the initial domain of each parameter inversely proportional to the square root of the circuit depth, the magnitude of the cost gradient decays at most polynomially with respect to the qubit count and circuit depth. Our theoretical results are substantiated through numerical simulations of variational quantum eigensolver tasks. Moreover, we demonstrate that the reduced-domain initialization strategy can protect specific quantum neural networks from exponentially many spurious local minima. Our results highlight the significance of an appropriate parameter initialization strategy, offering insights to enhance the trainability and convergence of variational quantum algorithms.
This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.