We address the problem of implementing bottleneck layers from classical pretrained neural networks on a quantum computer, with the goal of exploring intrinsically quantum ansatz for representing large linear layers within hybrid classical-quantum models. Our approach begins with a compression step in which the target linear layer is represented as an effective matrix product operator (MPO) without degrading model performance. The MPO is then further disentangled into a more compact form. This enables a hybrid classical-quantum execution scheme, where the disentangling circuits are deployed on a quantum computer while the remainder of the network—including the disentangled MPO—runs on classical hardware. We introduce two complementary algorithms for MPO disentangling: (1) an disentangling variational method leveraging standard tensor network optimization techniques and (2) an disentangling gradient-descent-based approach. We validate these methods through a proof-of-concept translation of simple classical neural networks for MNIST and CIFAR-10 image classification into a hybrid classical-quantum form.
We address the problem of implementing bottleneck layers from classical pretrained neural networks on a quantum computer, with the goal of exploring intrinsically quantum ansatz for representing large linear layers within hybrid classical-quantum models. Our approach begins with a compression step in which the target linear layer is represented as an effective matrix product operator (MPO) without degrading model performance. The MPO is then further disentangled into a more compact form. This enables a hybrid classical-quantum execution scheme, where the disentangling circuits are deployed on a quantum computer while the remainder of the network—including the disentangled MPO—runs on classical hardware. We introduce two complementary algorithms for MPO disentangling: (1) an disentangling variational method leveraging standard tensor network optimization techniques and (2) an disentangling gradient-descent-based approach. We validate these methods through a proof-of-concept translation of simple classical neural networks for MNIST and CIFAR-10 image classification into a hybrid classical-quantum form.
We introduce a framework for seamlessly integrating quantum computing into pretrained large language models (LLMs). The key idea is to construct a hybrid quantum-classical representation that exactly reproduces the original model, providing a principled starting point from which quantum resources can only improve performance. Our approach replaces the weight matrices in self-attention and multilayer perceptron layers with two variational quantum circuits coupled to a matrix product operator (MPO). Tensor network disentanglers transfer much of each layer's information into the quantum circuits, enabling the remaining tensor network to be compressed to a bond-dimension-one MPO with over three orders of magnitude fewer classical parameters (in our experiments, from 110,592 to approximately 36 for the replaced layer) and less than a 0.3\% increase in perplexity. Training an added unitary adapter on top of this representation then surpasses the original model, reducing perplexity by up to 1.6\%. Finally, we validate the hybrid architecture on a real quantum processor, demonstrating a practical route towards quantum-enhanced language models.
Tensor networks can compactly represent high-dimensional data in the form of low-rank tensor decompositions, which helps capture complex structures and correlations within the data. However, their inherently multilinear nature limits their potential as universal approximators. To address this limitation, tensor networks are combined with classical neural network layers, introducing nonlinear elements to enhance the model’s expressive power. The Hybrid Tensor Networks (HTN) system encompasses two prevalent tensor network configurations, Matrix Product States and Tree Tensor Networks, which facilitates the adaptable design of models customized for particular machine learning applications. This framework has been validated on classification and image reconstruction tasks, demonstrating its potential to handle complex data structures and its applicability within the machine learning field. Employing this approach, the goal is to establish a foundation for future research on hybrid quantum-classical models, thereby opening up avenues for the realm of quantum machine learning.
Abstract Image classification, a pivotal task in multiple industries, faces computational challenges due to the burgeoning volume of visual data. This research addresses these challenges by introducing two quantum machine learning models that leverage the principles of quantum mechanics for effective computations. Our first model, a hybrid quantum neural network with parallel quantum circuits, enables the execution of computations even in the noisy intermediate-scale quantum era, where circuits with a large number of qubits are currently infeasible. This model demonstrated a record-breaking classification accuracy of 99.21% on the full MNIST dataset, surpassing the performance of known quantum–classical models, while having eight times fewer parameters than its classical counterpart. Also, the results of testing this hybrid model on a Medical MNIST (classification accuracy over 99%), and on CIFAR-10 (classification accuracy over 82%), can serve as evidence of the generalizability of the model and highlights the efficiency of quantum layers in distinguishing common features of input data. Our second model introduces a hybrid quantum neural network with a Quanvolutional layer, reducing image resolution via a convolution process. The model matches the performance of its classical counterpart, having four times fewer trainable parameters, and outperforms a classical model with equal weight parameters. These models represent advancements in quantum machine learning research and illuminate the path towards more accurate image classification systems.
In recent years, the field of machine learning has witnessed a paradigm shift with the emergence of hybrid quantum-classical neural networks. These networks combine the power of classical neural networks with the computational advantages offered by quantum variational circuits. This study presents a comprehensive survey of hybrid quantum-classical machine learning algorithms, focusing on their architecture, performance, and hyperparameter optimization techniques. Introducing the concept of hybrid quantum-classical machine learning and its significance in contemporary image classification tasks. It explores the theoretical foundations of quantum variational circuits and their integration with classical neural network architectures. Special attention is given to prominent algorithms such as Quantum Convolutional Neural Networks, Quanvolutional Neural Networks, and Quantum ResNet, each offering unique advantages in image classification tasks. A major aspect covered in this study is the hyperparameter optimization techniques employed in hybrid quantum-classical machine learning. The chapter discusses quantum-inspired optimization methods tailored for efficiently tuning the hyperparameters of complex neural network models. Through comparative analysis, the effectiveness of these optimization techniques is demonstrated in reducing computational overhead and improving model performance. Moreover, the study also delves into experimental results obtained from benchmarking hybrid quantum-classical models against traditional classical approaches. It highlights the accuracy variations observed across different quantum architectures and explores the impact of architectural permutations on model convergence. Insights gained from these experiments provide valuable guidance for researchers and practitioners seeking to leverage hybrid quantum-classical neural networks in real-world applications.
The combination of the principles of quantum computing and classical deep learning is a potentially fruitful direction to develop the field of artificial intelligence, but the benchmarking of such hybrid architectures against standard computer vision problems is an under-explored area. The paper explores the behavior of Hybrid Quantum-Classical Neural Network (HQNN) in the classification of images into multiple classes using the MNIST database. Our architecture is an HQNN implementing an 8-qubit and 2-layer variational circuit, and it is parameterized by a classical multi-layer perceptron (MLP). To make the evaluation process rigorous and fair, the hybrid was benchmarked on a purely classical MLP, which had almost the same parameter footprint ( 105,000 parameters). Results over 50 training epochs show that the classical MLP reached its highest test accuracy of 96.50% and Macro F1 of 0.96. The HQNN was able to converge and learn the data of high dimensions delivering a competitive but slightly lower maximum accuracy of 94.35% and Macro F1 of 0.94. Moreover, there was a high computational cost on the simulation of the quantum layers, which increased the training time by 233 times the classical baseline. These results suggest that while the quantum layer is expressive and capable of learning complex representations, the current state of quantum simulation on classical hardware is a significant bottleneck. Which can be reduced by QPU/NISQ hardware, lighter quantum circuits and better dta encoding.
This is a set of lectures on tensor networks with a strong emphasis on the core algorithms involving Matrix Product States (MPS) and Matrix Product Operators (MPO). Compared to other presentations, particular care has been given to disentangle aspects of tensor networks from the quantum many-body problem: MPO/MPS algorithms are presented as a way to deal with linear algebra on extremely (exponentially) large matrices and vectors, regardless of any particular application. The lectures include well-known algorithms to find eigenvectors of MPOs (the celebrated DMRG), solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS (the Tensor Cross Interpolation, or TCI, algorithm). The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation. They include the detailed analytical construction of important MPOs such as those for differentiation, indefinite integration, convolution, and the quantum Fourier transform. Three concrete applications are discussed in detail: the simulation of a quantum computer (either exactly or with compression), the simulation of a quantum annealer, and techniques to solve partial differential equations (e.g. Poisson, diffusion, or Gross-Pitaevskii) within the "quantics" representation. The lectures have been designed to be accessible to a first-year PhD student and include detailed proofs of all statements.