We propose a hardware efficient quantum residual neural network which implements residual connections through a deterministic mixture of the identity operation and variational unitaries, enabling fully differentiable training. In contrast to the previous implementation of residual connections, our architecture avoids post-selection while preserving residual learning. Furthermore, we highlight circuit constructions where barren plateaus could be mitigated, which are considered as a major limitation of variational quantum learning models. In order to show the working of our model, we report its application to image classification tasks by training it for MNIST, CIFAR, and SARFish datasets, achieving accuracies of 99\% and 80\% for binary and multi-class classifications, respectively. These accuracies are comparable to previously achieved from the standard variational models, however our model requires 10x fewer gates making it better suited for resource constraint near-term quantum processors. In addition to high accuracies, the proposed architecture also demonstrates adversarial robustness which is another desirable parameter for quantum machine learning models. Overall our architecture offers a new pathway for developing accurate, robust, trainable and hardware efficient quantum machine learning models.
We propose a hardware efficient quantum residual neural network which implements residual connections through a deterministic mixture of the identity operation and variational unitaries, enabling fully differentiable training. In contrast to the previous implementation of residual connections, our architecture avoids post-selection while preserving residual learning. Furthermore, we highlight circuit constructions where barren plateaus could be mitigated, which are considered as a major limitation of variational quantum learning models. In order to show the working of our model, we report its application to image classification tasks by training it for MNIST, CIFAR, and SARFish datasets, achieving accuracies of 99% and 80% for binary and multi-class classifications, respectively. These accuracies are comparable to previously achieved from the standard variational models, however our model requires 10x fewer gates making it better suited for resource constraint near-term quantum processors. In addition to high accuracies, the proposed architecture also demonstrates adversarial robustness which is another desirable parameter for quantum machine learning models. Overall our architecture offers a new pathway for developing accurate, robust, trainable and hardware efficient quantum machine learning models.
We implement a post-variational quantum neural network on a real HPC-QC system and show the feasibility of fully training this class of algorithms on current Noisy Intermediate-Scale Quantum (NISQ) devices, which are limited by noise, low number of qubits, and scarcity. Post-variational methods are hybrid classical-quantum Machine Learning algorithms that remove the need for quantum circuits evaluations during training, thus making them more suited to the availability constraints of physical quantum devices. We investigate the scalability of the algorithm to a higher number of qubits, larger datasets, and more elaborate models, giving insight for more efficient implementation. Experiments for an image classification task on a cutting-edge HPC-QC system show that post-variational quantum neural networks are fully trainable in reasonable times on a superconducting device. The models trained also show performance at least comparable to a variational approach, with one configuration showing a significant improvement in classification accuracy.
While Quantum Convolutional Neural Networks (QCNNs) offer a theoretical paradigm for quantum machine learning, their practical implementation is severely bottlenecked by barren plateaus -- the exponential vanishing of gradients -- and poor empirical accuracy compared to classical counterparts. In this work, we propose a novel QCNN architecture utilizing localized cost functions and a hardware-efficient tensor-network initialization strategy to provably mitigate barren plateaus. We evaluate our scalable QCNN on the MNIST dataset, demonstrating a significant performance leap. By resolving the gradient vanishing issue, our optimized QCNN achieves a classification accuracy of 98.7\%, a substantial improvement over the baseline QCNN accuracy of 52.32\% found in unmitigated models. Furthermore, we provide empirical evidence of a parameter-efficiency advantage, requiring O(logN) fewer trainable parameters than equivalent classical CNNs to achieve >95% convergence. This work bridges the gap between theoretical quantum utility and practical application, providing a scalable framework for quantum computer vision tasks without succumbing to loss landscape concentration.
Current quantum neural networks suffer from extreme sensitivity to both adversarial perturbations and hardware noise, creating a significant barrier to real-world deployment. Existing robustness techniques typically sacrifice clean accuracy or require prohibitive computational resources. We propose a hybrid quantum-classical Differentiable Quantum Architecture Search (DQAS) framework that addresses these limitations by jointly optimizing circuit structure and robustness through gradient-based methods. Our approach enhances traditional DQAS with a lightweight Classical Noise Layer applied before quantum processing, enabling simultaneous optimization of gate selection and noise parameters. This design preserves the quantum circuit's integrity while introducing trainable perturbations that enhance robustness without compromising standard performance. Experimental validation on MNIST, FashionMNIST, and CIFAR datasets shows consistent improvements in both clean and adversarial accuracy compared to existing quantum architecture search methods. Under various attack scenarios, including Fast Gradient Sign Method (FGSM), Projected Gradient Descent (PGD), Basic Iterative Method (BIM), and Momentum Iterative Method (MIM), and under realistic quantum noise conditions, our hybrid framework maintains superior performance. Testing on actual quantum hardware confirms the practical viability of discovered architectures. These results demonstrate that strategic classical preprocessing combined with differentiable quantum architecture optimization can significantly enhance quantum neural network robustness while maintaining computational efficiency.
Image classification plays a vital role in large-scale data analysis, especially in object recognition tasks using advanced Deep Learning (DL) frameworks. However, the growing complexity and computational demands of modern DL models have introduced challenges related to scalability and efficiency. Quantum Computing (QC) has emerged as a promising alternative, capable of addressing these limitations by leveraging the principles of Quantum Machine Learning (QML). However, many existing QML models require a large number of qubits, which poses limitations within the current Noisy Intermediate-Scale Quantum (NISQ) era. This work introduces a novel Adaptive Quantum Convolutional Neural Network (AQCNN) designed for efficient and scalable image classification within the constraints of NISQ devices. Addressing the limitations of existing QML approaches, particularly the high qubit requirements, AQCNN incorporates a resource-efficient quantum convolutional layer that performs localized quantum filtering using parameterized quantum circuits. A classical preprocessing layer encodes input features to reduce qubit load, followed by quantum embedding and hybrid quantum-classical layers that optimize feature extraction and classification performance. The model leverages an adaptive quantum convolution strategy, minimizing quantum gate depth and circuit complexity while preserving critical spatial hierarchies in image data. Evaluated on benchmark datasets, AQCNN achieved 95.88% accuracy on MNIST and 95.68% on FMNIST, outperforming comparable QML architectures. Additionally, the model supports scalable execution through parallel quantum circuit arrays, enabling practical deployment on current quantum hardware. This architecture demonstrates a significant advance in quantum-assisted image classification, balancing performance with qubit and gate efficiency. The integration of adaptive quantum convolution and hybrid processing not only enhances classification accuracy but also provides a viable path forward for deploying QML solutions under realistic hardware constraints.
Quantum operations on pure states can be fully represented by unitary matrices. Variational quantum circuits, also known as quantum neural networks, embed data and trainable parameters into gate-based operations and optimize the parameters via gradient descent. The high cost of training and low fidelity of current quantum devices, however, restricts much of quantum machine learning to classical simulation. For few-qubit problems with large datasets, training the matrix elements directly, as is done with weight matrices in classical neural networks, can be faster than decomposing data and parameters into gates. We propose a method that trains matrices directly while maintaining unitarity through a single regularization term added to the loss function. A second training step, circuit alignment, then recovers a gate-based architecture from the resulting soft-unitary. On a five-qubit supervised classification task with 1000 datapoints, this two-step process produces a trained variational circuit in under four minutes, compared to over two hours for direct circuit training, while achieving lower binary cross-entropy loss. In a second experiment, soft-unitaries are embedded in a hybrid quantum-classical network for a reinforcement learning cartpole task, where the hybrid agent outperforms a purely classical baseline of comparable size.
Abstract While classical convolutional neural networks (CNNs) have revolutionized image classification, the emergence of quantum CNNs (QCNNs) presents new opportunities with high-dimensional transformations that are infeasible for classical CNNs. However, their implementation on current noisy intermediate-scale quantum (NISQ) devices remains challenging due to hardware limitations. In our research, we address this challenge by introducing fragment encoding that significantly reduces the input dimensionality. We show that accuracy improves as the number of qubits increases from 1 to 4 to 16, providing evidence of favorable scaling. Motivated by this, we developed a primitive QCNN architecture with $$\varvec{49}$$ qubits which is sufficient to directly process $$\varvec{28 \times 28}$$ pixel MNIST images, eliminating the need for classical dimensionality reduction pre-processing. Additionally, we propose an automated framework based on expressibility, entanglement, and complexity characteristics to identify the building blocks of QCNNs, parameterized quantum circuits (PQCs). Our approach demonstrates advantages in convergence speed with a similar parameter count compared to both LM-QCNNs and classical CNNs. We validated our experiments on IBM’s Heron r2 quantum processor, achieving $$\varvec{96.08\%}$$ accuracy with approximately $$\varvec{70\%}$$ faster convergence relative to classical CNNs under identical training conditions. Our results show that simple image-classification tasks can be realized on real quantum hardware today.