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

International Conference on Electronic Information Engineering and Computer Technology (EIECT)

A Lightweight Design for Quantum Networks

Min Xu, Yize Tang, Yiliang Wang, Zilong Zhong, Ziheng Xu, Ting Li, Li Fei

Published Nov 15, 2024• 0 citations
Publisher

Abstract

Processing data through a quantum classifier is a powerful alternative to traditional machine learning. A quantum classifier consists of a series of parameterized quantum circuits that train known quantum data to approximate classification functions and accurately classify unknown data. Considering the development limitations of quantum computers, this paper proposes a kind of lightweight quantum classifier which contains fewer circuit parameters and integrated with the classical optimization algorithm in order to achieve high-precision classification. The architecture design of quantum classifier is inspired on tensor network states such as matrix product state, tree network (TTN) and multi-scale entangled renormalization (MERA), the classical optimization algorithm adopts gradient descent (GD), particle swarm optimization (PSO) and quantum behavior improved particle swarm optimization (QPSO). The whole classical-quantum hybrid model could theoretically be implemented on near-term devices, and its performance is proved on Anderson Iris data set.

DOI
10.1109/eiect64462.2024.10867223

Related papers

Towards quantum machine learning with tensor networks

William J. Huggins, Piyush Patil, Bradley Mitchell +2 more

Abstract Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. We demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

arXiv:1803.11537•Quantum Science and Technology•Oct 23, 2018•366 citations

Automatic Optimization of Variational Quantum Algorithm-Based Classifiers

Ruihong Jia, Guang Yang, Min Nie +2 more

With the advent of the era of big data, how to efficiently process data has become an urgent problem. Although classical machine learning algorithms are very mature in processing data, they require a large amount of data to complete the training process. Quantum machine learning uses the superposition, entanglement, parallelism and other characteristics of quantum computing to improve the performance of classical machine learning algorithms. At the same time, circuit optimization of the quantum classifier can reduce the computational complexity. This paper proposes an automatic optimization model of the classifier based on the variational quantum algorithm, which reduces the complexity of the parameter update process through the deep optimization of the core circuit. This model greatly speeds up the training process and has lower complexity than other quantum classifiers. In addition, a unique regularization method is used to avoid overfitting. The simulation results show that the classification of some typical data sets can achieve better classification results, and the training parameters and training speed are significantly better than other quantum classifiers. Finally, the robustness of the classifier is further verified in the presence of noise.

•Sep 23, 2022•2 citations

Quantum machine learning for particle physics using a variational quantum classifier

Andrew Blance, Michael Spannowsky

A bstract Quantum machine learning aims to release the prowess of quantum computing to improve machine learning methods. By combining quantum computing methods with classical neural network techniques we aim to foster an increase of performance in solving classification problems. Our algorithm is designed for existing and near-term quantum devices. We propose a novel hybrid variational quantum classifier that combines the quantum gradient descent method with steepest gradient descent to optimise the parameters of the network. By applying this algorithm to a resonance search in di-top final states, we find that this method has a better learning outcome than a classical neural network or a quantum machine learning method trained with a non-quantum optimisation method. The classifiers ability to be trained on small amounts of data indicates its benefits in data-driven classification problems.

arXiv:2010.07335•Journal of High Energy Physics•Feb 1, 2021•90 citations

Development of hybrid quantum classifiers for realistic classification tasks

Sara Aminpour, Safura Sharifi, Yaser Mike Banad

Abstract Hybrid quantum machine learning combines classical minimization with parameterized quantum circuits, enabling powerful learning models even on near-term quantum hardware. This work presents an evaluation of hybrid quantum machine learning classifiers using the data re-uploading framework across nine binary and multi-class classification tasks with varying geometric complexity. We compare three quantum circuit architectures, single-qubit, two-qubit, and two-qubit entangled, trained with three classical minimizers: COBYLA, Nelder-Mead, and SLSQP. Our experiments span training sizes from 1 to 200 samples and reveal that two-qubit classifiers, when paired with the SLSQP minimizer, achieve the highest overall test accuracy of 99.775% on structured tasks and strong performance (up to 89.78%) on complex multi-class pattern. Among minimizers, SLSQP consistently provides the best generalization, while entanglement improves accuracy in non-linear and fragmented tasks. By analyzing accuracy trends, generalization gaps, and confusion matrices, this study offers practical guidance for designing quantum classifiers that scale effectively and generalize well, providing a foundation for real-world Hybrid quantum machine learning applications.

Journal of Physics Communications•Feb 1, 2026•0 citations

A Quantum Classifier Based on Tree Structure

Hongsheng Zhu, Changqing Gong, Abdullah Gani +1 more

In the era of Noisy Intermediate-Scale Quantum(NISQ), Variational Quantum Algorithm (VQA) is the most promising method to achieve quantum dominance. The VQA is a quantum classical-hybrid algorithm that typically uses a classical optimizer to train a parameterized quantum circuit (PQC). However, the barren plateau phenomenon will occur during training, reducing the training of quantum circuits. In this paper we design a quantum circuit structure, which combines the tree tensor network (TTN) and the parameterized quantum circuit, calling this circuit the tree parameterized quantum circuit (TPQC). We found that the TPQC had better expressiveness and was also effective in alleviating the barren plateau. The quantum classifier of TPQC is used for network attack intrusion detection, and compared with the quantum classifier of universal parameterized quantum circuit, we demonstrate that TPQC has higher accuracy for binary classification tasks.

International Conference on Machine Learning and Computing (ICMLC)•Feb 17, 2023•3 citations

Hybrid quantum-classical classifier based on tensor network and variational quantum circuit

Samuel Yen-Chi Chen, Chih-Min Huang, Chia-Wei Hsing +1 more

One key step in performing quantum machine learning (QML) on noisy intermediate-scale quantum (NISQ) devices is the dimension reduction of the input data prior to their encoding. Traditional principle component analysis (PCA) and neural networks have been used to perform this task; however, the classical and quantum layers are usually trained separately. A framework that allows for a better integration of the two key components is thus highly desirable. Here we introduce a hybrid model combining the quantum-inspired tensor networks (TN) and the variational quantum circuits (VQC) to perform supervised learning tasks, which allows for an end-to-end training. We show that a matrix product state based TN with low bond dimensions performs better than PCA as a feature extractor to compress data for the input of VQCs in the binary classification of MNIST dataset. The architecture is highly adaptable and can easily incorporate extra quantum resource when available.

arXiv:2011.14651•Nov 30, 2020•27 citations
Processing data through a quantum classifier is a powerful alternative to traditional machine learning. A quantum classifier consists of a series of parameterized quantum circuits that train known quantum data to approximate classification functions and accurately classify unknown data. Considering the development limitations of quantum computers, this paper proposes a kind of lightweight quantum classifier which contains fewer circuit parameters and integrated with the classical optimization algorithm in order to achieve high-precision classification. The architecture design of quantum classifier is inspired on tensor network states such as matrix product state, tree network (TTN) and multi-scale entangled renormalization (MERA), the classical optimization algorithm adopts gradient descent (GD), particle swarm optimization (PSO) and quantum behavior improved particle swarm optimization (QPSO). The whole classical-quantum hybrid model could theoretically be implemented on near-term devices, and its performance is proved on Anderson Iris data set.
Abstract Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. We demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.
With the advent of the era of big data, how to efficiently process data has become an urgent problem. Although classical machine learning algorithms are very mature in processing data, they require a large amount of data to complete the training process. Quantum machine learning uses the superposition, entanglement, parallelism and other characteristics of quantum computing to improve the performance of classical machine learning algorithms. At the same time, circuit optimization of the quantum classifier can reduce the computational complexity. This paper proposes an automatic optimization model of the classifier based on the variational quantum algorithm, which reduces the complexity of the parameter update process through the deep optimization of the core circuit. This model greatly speeds up the training process and has lower complexity than other quantum classifiers. In addition, a unique regularization method is used to avoid overfitting. The simulation results show that the classification of some typical data sets can achieve better classification results, and the training parameters and training speed are significantly better than other quantum classifiers. Finally, the robustness of the classifier is further verified in the presence of noise.
A bstract Quantum machine learning aims to release the prowess of quantum computing to improve machine learning methods. By combining quantum computing methods with classical neural network techniques we aim to foster an increase of performance in solving classification problems. Our algorithm is designed for existing and near-term quantum devices. We propose a novel hybrid variational quantum classifier that combines the quantum gradient descent method with steepest gradient descent to optimise the parameters of the network. By applying this algorithm to a resonance search in di-top final states, we find that this method has a better learning outcome than a classical neural network or a quantum machine learning method trained with a non-quantum optimisation method. The classifiers ability to be trained on small amounts of data indicates its benefits in data-driven classification problems.
Abstract Hybrid quantum machine learning combines classical minimization with parameterized quantum circuits, enabling powerful learning models even on near-term quantum hardware. This work presents an evaluation of hybrid quantum machine learning classifiers using the data re-uploading framework across nine binary and multi-class classification tasks with varying geometric complexity. We compare three quantum circuit architectures, single-qubit, two-qubit, and two-qubit entangled, trained with three classical minimizers: COBYLA, Nelder-Mead, and SLSQP. Our experiments span training sizes from 1 to 200 samples and reveal that two-qubit classifiers, when paired with the SLSQP minimizer, achieve the highest overall test accuracy of 99.775% on structured tasks and strong performance (up to 89.78%) on complex multi-class pattern. Among minimizers, SLSQP consistently provides the best generalization, while entanglement improves accuracy in non-linear and fragmented tasks. By analyzing accuracy trends, generalization gaps, and confusion matrices, this study offers practical guidance for designing quantum classifiers that scale effectively and generalize well, providing a foundation for real-world Hybrid quantum machine learning applications.
In the era of Noisy Intermediate-Scale Quantum(NISQ), Variational Quantum Algorithm (VQA) is the most promising method to achieve quantum dominance. The VQA is a quantum classical-hybrid algorithm that typically uses a classical optimizer to train a parameterized quantum circuit (PQC). However, the barren plateau phenomenon will occur during training, reducing the training of quantum circuits. In this paper we design a quantum circuit structure, which combines the tree tensor network (TTN) and the parameterized quantum circuit, calling this circuit the tree parameterized quantum circuit (TPQC). We found that the TPQC had better expressiveness and was also effective in alleviating the barren plateau. The quantum classifier of TPQC is used for network attack intrusion detection, and compared with the quantum classifier of universal parameterized quantum circuit, we demonstrate that TPQC has higher accuracy for binary classification tasks.
One key step in performing quantum machine learning (QML) on noisy intermediate-scale quantum (NISQ) devices is the dimension reduction of the input data prior to their encoding. Traditional principle component analysis (PCA) and neural networks have been used to perform this task; however, the classical and quantum layers are usually trained separately. A framework that allows for a better integration of the two key components is thus highly desirable. Here we introduce a hybrid model combining the quantum-inspired tensor networks (TN) and the variational quantum circuits (VQC) to perform supervised learning tasks, which allows for an end-to-end training. We show that a matrix product state based TN with low bond dimensions performs better than PCA as a feature extractor to compress data for the input of VQCs in the binary classification of MNIST dataset. The architecture is highly adaptable and can easily incorporate extra quantum resource when available.