Variational quantum classifiers are promising for machine learning on noisy intermediate-scale quantum (NISQ) hardware, but flat circuits that act on all input features at once need many qubits, accumulate gate errors and suffer vanishing gradients as they widen. This paper proposes Hierarchical Quantum Learning (HQL), a two-level framework that splits a high-dimensional input into correlation-coherent feature groups, processes each group in a narrow 4-qubit module built from data re-uploading and quantum-convolutional pooling, and fuses the module outputs in a trainable quantum aggregator optimised end to end. HQL was implemented with an autograd statevector simulator and compared with three classical learners, a quantum-kernel SVM, a hardware-efficient VQC and a quantum convolutional neural network (QCNN) on three binary tasks with 30–64 features over five random splits. With identical inputs, HQL reached 69.6% accuracy on a 64-feature benchmark versus 62.4% for the best flat circuit, and 92.5% versus 90.3% on handwritten digits, using circuits half as wide. Its gradient variance stayed near 0.11 up to 32 qubits, while that of a hardware-efficient circuit fell 63.4-fold between 4 and 16 qubits. Classical baselines remained the most accurate on all tasks, which we report openly. HQL offers a practical, trainable route to variational learning on modular quantum processors.
Variational quantum classifiers are promising for machine learning on noisy intermediate-scale quantum (NISQ) hardware, but flat circuits that act on all input features at once need many qubits, accumulate gate errors and suffer vanishing gradients as they widen. This paper proposes Hierarchical Quantum Learning (HQL), a two-level framework that splits a high-dimensional input into correlation-coherent feature groups, processes each group in a narrow 4-qubit module built from data re-uploading and quantum-convolutional pooling, and fuses the module outputs in a trainable quantum aggregator optimised end to end. HQL was implemented with an autograd statevector simulator and compared with three classical learners, a quantum-kernel SVM, a hardware-efficient VQC and a quantum convolutional neural network (QCNN) on three binary tasks with 30–64 features over five random splits. With identical inputs, HQL reached 69.6% accuracy on a 64-feature benchmark versus 62.4% for the best flat circuit, and 92.5% versus 90.3% on handwritten digits, using circuits half as wide. Its gradient variance stayed near 0.11 up to 32 qubits, while that of a hardware-efficient circuit fell 63.4-fold between 4 and 16 qubits. Classical baselines remained the most accurate on all tasks, which we report openly. HQL offers a practical, trainable route to variational learning on modular quantum processors.
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.
As image datasets grow in scale and complexity, classical convolutional neural networks (CNNs) increasingly face limitations in computational efficiency, scalability, and generalisation in low-data regimes. Quantum machine learning (QML) offers a promising alternative, with quantum convolutional neural networks (QCNNs) exploiting quantum parallelism and entanglement for feature extraction. This paper introduces the Novel Quantum Convolutional Neural Network (No-QCNN), which differs from recent hybrid QCNN/QCQ-CNN architectures by employing an end-to-end quantum convolution-pooling pipeline without inserting an intermediate classical CNN block. No-QCNN is a hybrid quantum-classical model that employs a variational quantum classifier (VQC) optimised via the COBYLA algorithm and is designed for binary and multiclass classification of low-resolution colour images on near-term quantum devices. A key innovation is a problem-specific quantum feature map that pre-processes each image into a structured three-dimensional block-matrix representation, jointly encoding pixel colour (R, G, B) and spatial position before mapping this information into a hierarchical ZZFeatureMap. This encoding captures spatial-chromatic correlations at shallow circuit depth, making it compatible with noisy intermediate-scale quantum (NISQ) constraints. The model is implemented using IBM-Qiskit on a local quantum simulator and benchmarked against a classical CNN. For a six-class classification task on a 50-image dataset, No-QCNN achieves a validation accuracy of 82.05%, substantially outperforming the classical CNN's 40.00%, indicating improved generalisation and reduced overfitting in low-data, multiclass settings. Conversely, for a simpler binary classification task, the classical CNN achieves perfect validation accuracy of 100%, surpassing the No-QCNN's 89.7%. We further observe that No-QCNN performance declines with increasing dataset size and training time due to limited circuit expressibility, data-encoding overhead, and finite-sampling noise inherent to NISQ models. Overall, these results position No-QCNN as a complementary framework best suited to low-data, correlation-rich classification tasks, defining a realistic niche for quantum-enhanced artificial vision and quantum perception in the NISQ era.
Background: The emergent need for scalable artificial intelligence (AI) models emphasizes the shortcomings of traditional machine learning in dealing with big, complicated datasets owing to computation and energy limitations. Objective: The architecture takes advantage of quantum encoding methods like amplitude and angle encoding for compact feature representation, with classical preprocessing providing compatibility and stability. Methods: To overcome these issues, this research introduces a Hybrid Quantum-Classical Machine Learning (HQML) framework that combines Quantum Variational Classifiers (QVCs) and Quantum Convolutional Neural Networks (QCNNs) with classical deep learning layers. Results: Experiments were performed on pre-curated datasets taken from the Scikit Machine Learning Repository, with hybrid models compared to classical Convolutional Neural Networks (CNNs). The implementation was done with PennyLane using TensorFlow Quantum for compatibility with noisy intermediate-scale quantum (NISQ) machines. The comparative analysis identified that the suggested HQML model achieves significant performance gains, as classification accuracy increased from 73 percent in the baseline classical CNN to 98% in the hybrid model. Precision also went up from 77 to 96 percent, recall from 81 to 100 percent, and F1-score from 79 to 98 percent. These findings confirm the ability of the model to leverage quantum benefits for extracting complicated data distributions without losing stability through classical components. The findings confirm the viability of HQML to real-world finance, healthcare, and intelligent automation applications where scalability and precision matter. Conclusion: This research establishes that quantum-classical integration not only minimizes training overhead but also attains near-perfect classification efficiency with constrained qubit resources. The research aids in filling the gap between theoretical quantum potential and deployable practical AI, opening the door for next-generation quantum-boosted intelligence.
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.
Quantum Machine Learning (QML) unites quantum computing with modern AI to achieve potential gains in expressivity, runtime, and sample efficiency. This paper synthesizes advances in quantum feature maps, variational quantum circuits (VQCs), and hybrid quantum-classical workflows deployable on noisy intermediate-scale quantum (NISQ) hardware. We outline design principles for data encoding, ansatz selection, and trainability, and summarize error-aware practices—error mitigation, shot-frugal estimation, and compiler co-design. Using synthetic but instructive experiments, we illustrate scaling behavior, noise sensitivity, end-to-end inference latency across backends, and optimizer convergence in variational training. We conclude with an agenda emphasizing domain-aligned encodings, rigorous benchmarking, and reproducible open science to validate advantage beyond asymptotic claims.
Abstract Hybrid quantum–classical learning has emerged as a promising paradigm for leveraging near-term quantum devices in practical machine learning tasks. However, many existing hybrid architectures rely on tightly coupled end-to-end training schemes that are difficult to optimize, sensitive to quantum noise, and strongly dependent on specific encoder designs. In this work, we introduce Quantum LEGO Learning, a modular framework for hybrid artificial intelligence that decomposes learning into reusable classical and quantum blocks with explicitly separated roles. Within this framework, a pre-trained classical neural network acts as a frozen feature extractor, while a variational quantum circuit (VQC) serves as the only trainable, adaptive module that operates on structured latent representations. This design enables stable optimization, reduces parameter coupling between classical and quantum components, and supports architecture-agnostic integration across different classical backbones. We develop a block-wise theoretical analysis that decomposes the learning behavior of the hybrid model into components of approximation, estimation, optimization, and noise-induced error. The analysis shows that once expressive classical representations are fixed, the overall model's approximation capability depends primarily on the classical feature block, while the trainable quantum module governs the complexity of downstream adaptation. We further derive optimization and noise-resilience bounds demonstrating how freezing the classical block suppresses the propagation of noisy gradients during training. To validate the proposed framework, we conduct systematic experiments on quantum dot classification and genome transcription factor binding site prediction using multiple frozen feature extractors, including ResNet and tensor-train network backbones, combined with both quantum and classical adaptive heads. Experimental results from noiseless simulations, realistic quantum-noise models, and IBM Heron quantum hardware demonstrate stable optimization, robustness to noise, and improved performance of VQC-based adaptive heads under matched parameter budgets. These results suggest that modular hybrid architectures provide a practical and scalable pathway for quantum-enhanced learning in the NISQ regime.