Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2205.09768

Deterministic Tensor Network Classifiers

L. Wright, Fergus Barratt, James Dborin, Vinul Wimalaweera, B. Coyle, Andrew G. Green

Published May 19, 2022• 6 citations
arXivHTMLPDF

Abstract

We present tensor networks for feature extraction and refinement of classifier performance. These networks can be initialised deterministically and have the potential for implementation on near-term intermediate-scale quantum (NISQ) devices. Feature extraction proceeds through a direct combination and compression of images amplitude-encoded over just $\log N_{\text{pixels}}$ qubits. Performance is refined using `Quantum Stacking', a deterministic method that can be applied to the predictions of any classifier regardless of structure, and implemented on NISQ devices using data re-uploading. These procedures are applied to a tensor network encoding of data, and benchmarked against the 10 class MNIST and fashion MNIST datasets. Good training and test accuracy are achieved without any variational training.

DOI
10.48550/arxiv.2205.09768

Related papers

TensorNetwork for Machine Learning

Stavros Efthymiou, Jack D. Hidary, Stefan Leichenauer

We demonstrate the use of tensor networks for image classification with the TensorNetwork open source library. We explain in detail the encoding of image data into a matrix product state form, and describe how to contract the network in a way that is parallelizable and well-suited to automatic gradients for optimization. Applying the technique to the MNIST and Fashion-MNIST datasets we find out-of-the-box performance of 98% and 88% accuracy, respectively, using the same tensor network architecture. The TensorNetwork library allows us to seamlessly move from CPU to GPU hardware, and we see a factor of more than 10 improvement in computational speed using a GPU.

arXiv:1906.06329•Jun 7, 2019•103 citations

Noise Robustness of Data Re-Uploading Quantum Classifiers

Daniel E. Molina, Kathleen E. Hamilton

We investigate the robustness of quantum neural networks (QNNs) trained as binary classifiers against bit flip and depolarizing noise, two channels that emulate a subset of noise present in noisy intermediate-scale quantum (NISQ) devices. The presence of decoherence and other forms of noise poses significant challenges to classification accuracy. To assess the impact of noise on label extraction, and to evaluate the performance and robustness of our models, we trained three different label assignment methods in the presence of various levels of noise. Each QNN model uses 2 qubits to implement a parameterized model and either the qubits of the QNN, or a set of ancilla qubits are used for label extraction. These three different methods project the state of either a single qubit or multiple qubits onto the computational basis. This generates a probability distribution that is post-processed to assign a class label and a class probability. Each QNN is trained using noisy numerical simulation on a dataset with 2 features. Depolarizing noise channels are interleaved with the parameterized gates of the QNN and we include bit flip error prior to extracting the labels. The noise levels for the depolarizing noise and bit flip error are swept over large ranges of values. We deploy QNNs trained at various noise levels on IBM quantum computers- this introduces an additional source of noise due to SWAP gate noise. We observe that the QNNs trained with simulated noise can have good performance on NISQ hardware.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•1 citation

A Primer on Quantum Neural Network Model for Text Classification: From Concept to Design

Annysha Huzzat, Ahmed Shaharyar Khwaja, Bhagawat Adhikari +3 more

Quantum neural networks (QNNs) have recently attracted remarkable attention as a potential alternative to classical and deep neural network (NN) models particularly under constraints imposed by noisy intermediate-scale quantum (NISQ) devices, which support only shallow circuits with few quantum bits (qubits) and limited variational depth. However, applying QNNs to natural language processing (NLP) remains challenging because text representations are typically high-dimensional, while NISQ classifiers can only encode a small number of features at a time, requiring classical compression to enable stable training and flexible circuit configuration. In addition, many existing studies integrate QNNs into rich-text representation pipelines, where the quantum circuit is often implemented as a variational quantum circuit (VQC). Here, the VQC acts as an additional component within a larger model, and it remains unclear how the quantum component improves the classification task. Therefore, in this work, we propose a fully reproducible and compact QNN pipeline that provides a controlled setting for studying the contribution of the VQC to text classification. The model is trained end-to-end with a lightweight classical compression layer, and the overall study is supported by systematic ablation analyses of the compression layer, the classifier heads under a shared frozen low-dimensional representation, and quantum circuit structure. Our model uses the term frequency-inverse document frequency (TF-IDF) features with linear compression followed by a shallow four-qubit, two-layer VQC, implemented in PyTorch and PennyLane for end-to-end training. It is evaluated on five benchmark text classification datasets against classical baselines, including logistic regression and multilayer perceptron (MLP) models. Experimental results show that the proposed QNN achieves a competitive performance across all evaluated datasets, yielding the best results on three of the five benchmark datasets.

IEEE Access•Jan 1, 2026•1 citation

Data compression for quantum machine learning

Rohit Dilip, Yu-Jie Liu, Adam Smith +1 more

The advent of noisy-intermediate scale quantum computers has introduced the exciting possibility of achieving quantum speedups in machine learning tasks. These devices, however, are composed of a small number of qubits and can faithfully run only short circuits. This puts many proposed approaches for quantum machine learning beyond currently available devices. We address the problem of compressing classical data into efficient representations on quantum devices. Our proposed methods allow both the required number of qubits and depth of the quantum circuit to be tuned. We achieve this by using a correspondence between matrix-product states and quantum circuits and further propose a hardware-efficient quantum circuit approach, which we benchmark on the Fashion-MNIST dataset. Finally, we demonstrate that a quantum circuit-based classifier can achieve competitive accuracy with current tensor learning methods using only 11 qubits.

arXiv:2204.11170•Physical Review Research•Oct 4, 2022•69 citations

Scalable Noise-Resilient Quantum Convolutional Neural Network Architecture for Large-Scale Image Classification on NISQ Device

Abburi Srirama Kanaka Ratnam, Durgesh Nandan

This study introduces a scalable and noise-tolerant quantum convolutional neural network (QCNN) architecture for large-scale image classification using Noisy Intermediate-Scale Quantum (NISQ) devices. The architecture employs a hybrid quantum-classical approach; classical data from the MNIST dataset are initially preprocessed before being converted into quantum states using angle encoding and superposition methods. The QCNN consists of Quantum Convolution Layers and classical layers of pooling and variational classification, which extract features from input images and classify them. To mitigate the impact of noise and hardware limitations, we applied a pruning-based optimization technique that reduces the circuit depth from 400 to 130 and the gate count from 900 to 280 while maintaining high accuracy (up to 0.94). The results also demonstrate an approximately 80% decrease in loss (from 1.20 to 0.25) and approximately 75% decrease in mean square error (from 0.50 to 0.12), and an increase in robustness (from 0.85 to 0.89). Finally, we found that our optimized QCNN has better classification performance than traditional QCNNs, and comparable performance to classical CNNs.

•Sep 1, 2026•0 citations

Incremental Data-Uploading for Full-Quantum Classification

Maniraman Periyasamy, Nico Meyer, Christian Ufrecht +3 more

The data representation in a machine-learning model strongly influences its performance. This becomes even more important for quantum machine learning models implemented on noisy intermediate scale quantum (NISQ) devices. Encoding high dimensional data into a quantum circuit for a NISQ device without any loss of information is not trivial and brings a lot of challenges. While simple encoding schemes (like single qubit rotational gates to encode high dimensional data) often lead to information loss within the circuit, complex encoding schemes with entanglement and data re-uploading lead to an increase in the encoding gate count. This is not well-suited for NISQ devices. This work proposes ‘incremental data-uploading’, a novel encoding pattern for high dimensional data that tackles these challenges. We spread the encoding gates for the feature vector of a given data point throughout the quantum circuit with parameterized gates in between them. This encoding pattern results in a better representation of data in the quantum circuit with a minimal pre-processing requirement. We show the efficiency of our encoding pattern on a classification task using the MNIST and Fashion-MNIST datasets, and compare different encoding methods via classification accuracy and the effective dimension of the model.

arXiv:2205.03057•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•21 citations
We present tensor networks for feature extraction and refinement of classifier performance. These networks can be initialised deterministically and have the potential for implementation on near-term intermediate-scale quantum (NISQ) devices. Feature extraction proceeds through a direct combination and compression of images amplitude-encoded over just log⁡Npixels\log N_{\text{pixels}}logNpixels​ qubits. Performance is refined using `Quantum Stacking', a deterministic method that can be applied to the predictions of any classifier regardless of structure, and implemented on NISQ devices using data re-uploading. These procedures are applied to a tensor network encoding of data, and benchmarked against the 10 class MNIST and fashion MNIST datasets. Good training and test accuracy are achieved without any variational training.
We demonstrate the use of tensor networks for image classification with the TensorNetwork open source library. We explain in detail the encoding of image data into a matrix product state form, and describe how to contract the network in a way that is parallelizable and well-suited to automatic gradients for optimization. Applying the technique to the MNIST and Fashion-MNIST datasets we find out-of-the-box performance of 98% and 88% accuracy, respectively, using the same tensor network architecture. The TensorNetwork library allows us to seamlessly move from CPU to GPU hardware, and we see a factor of more than 10 improvement in computational speed using a GPU.
We investigate the robustness of quantum neural networks (QNNs) trained as binary classifiers against bit flip and depolarizing noise, two channels that emulate a subset of noise present in noisy intermediate-scale quantum (NISQ) devices. The presence of decoherence and other forms of noise poses significant challenges to classification accuracy. To assess the impact of noise on label extraction, and to evaluate the performance and robustness of our models, we trained three different label assignment methods in the presence of various levels of noise. Each QNN model uses 2 qubits to implement a parameterized model and either the qubits of the QNN, or a set of ancilla qubits are used for label extraction. These three different methods project the state of either a single qubit or multiple qubits onto the computational basis. This generates a probability distribution that is post-processed to assign a class label and a class probability. Each QNN is trained using noisy numerical simulation on a dataset with 2 features. Depolarizing noise channels are interleaved with the parameterized gates of the QNN and we include bit flip error prior to extracting the labels. The noise levels for the depolarizing noise and bit flip error are swept over large ranges of values. We deploy QNNs trained at various noise levels on IBM quantum computers- this introduces an additional source of noise due to SWAP gate noise. We observe that the QNNs trained with simulated noise can have good performance on NISQ hardware.
Quantum neural networks (QNNs) have recently attracted remarkable attention as a potential alternative to classical and deep neural network (NN) models particularly under constraints imposed by noisy intermediate-scale quantum (NISQ) devices, which support only shallow circuits with few quantum bits (qubits) and limited variational depth. However, applying QNNs to natural language processing (NLP) remains challenging because text representations are typically high-dimensional, while NISQ classifiers can only encode a small number of features at a time, requiring classical compression to enable stable training and flexible circuit configuration. In addition, many existing studies integrate QNNs into rich-text representation pipelines, where the quantum circuit is often implemented as a variational quantum circuit (VQC). Here, the VQC acts as an additional component within a larger model, and it remains unclear how the quantum component improves the classification task. Therefore, in this work, we propose a fully reproducible and compact QNN pipeline that provides a controlled setting for studying the contribution of the VQC to text classification. The model is trained end-to-end with a lightweight classical compression layer, and the overall study is supported by systematic ablation analyses of the compression layer, the classifier heads under a shared frozen low-dimensional representation, and quantum circuit structure. Our model uses the term frequency-inverse document frequency (TF-IDF) features with linear compression followed by a shallow four-qubit, two-layer VQC, implemented in PyTorch and PennyLane for end-to-end training. It is evaluated on five benchmark text classification datasets against classical baselines, including logistic regression and multilayer perceptron (MLP) models. Experimental results show that the proposed QNN achieves a competitive performance across all evaluated datasets, yielding the best results on three of the five benchmark datasets.
The advent of noisy-intermediate scale quantum computers has introduced the exciting possibility of achieving quantum speedups in machine learning tasks. These devices, however, are composed of a small number of qubits and can faithfully run only short circuits. This puts many proposed approaches for quantum machine learning beyond currently available devices. We address the problem of compressing classical data into efficient representations on quantum devices. Our proposed methods allow both the required number of qubits and depth of the quantum circuit to be tuned. We achieve this by using a correspondence between matrix-product states and quantum circuits and further propose a hardware-efficient quantum circuit approach, which we benchmark on the Fashion-MNIST dataset. Finally, we demonstrate that a quantum circuit-based classifier can achieve competitive accuracy with current tensor learning methods using only 11 qubits.
This study introduces a scalable and noise-tolerant quantum convolutional neural network (QCNN) architecture for large-scale image classification using Noisy Intermediate-Scale Quantum (NISQ) devices. The architecture employs a hybrid quantum-classical approach; classical data from the MNIST dataset are initially preprocessed before being converted into quantum states using angle encoding and superposition methods. The QCNN consists of Quantum Convolution Layers and classical layers of pooling and variational classification, which extract features from input images and classify them. To mitigate the impact of noise and hardware limitations, we applied a pruning-based optimization technique that reduces the circuit depth from 400 to 130 and the gate count from 900 to 280 while maintaining high accuracy (up to 0.94). The results also demonstrate an approximately 80% decrease in loss (from 1.20 to 0.25) and approximately 75% decrease in mean square error (from 0.50 to 0.12), and an increase in robustness (from 0.85 to 0.89). Finally, we found that our optimized QCNN has better classification performance than traditional QCNNs, and comparable performance to classical CNNs.
The data representation in a machine-learning model strongly influences its performance. This becomes even more important for quantum machine learning models implemented on noisy intermediate scale quantum (NISQ) devices. Encoding high dimensional data into a quantum circuit for a NISQ device without any loss of information is not trivial and brings a lot of challenges. While simple encoding schemes (like single qubit rotational gates to encode high dimensional data) often lead to information loss within the circuit, complex encoding schemes with entanglement and data re-uploading lead to an increase in the encoding gate count. This is not well-suited for NISQ devices. This work proposes ‘incremental data-uploading’, a novel encoding pattern for high dimensional data that tackles these challenges. We spread the encoding gates for the feature vector of a given data point throughout the quantum circuit with parameterized gates in between them. This encoding pattern results in a better representation of data in the quantum circuit with a minimal pre-processing requirement. We show the efficiency of our encoding pattern on a classification task using the MNIST and Fashion-MNIST datasets, and compare different encoding methods via classification accuracy and the effective dimension of the model.