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:2003.12459 · Chinese Physics B

Quantum annealing for semi-supervised learning

Yu-Lin Zheng, Wen Zhang, Cheng Zhou, Wei Geng

Published Feb 3, 2021• 3 citations
arXivHTMLPDF

Abstract

Recent advances in quantum technology have led to the development and the manufacturing of programmable quantum annealers that promise to solve certain combinatorial optimization problems faster than their classical counterparts. Semi-supervised learning is a machine learning technique that makes use of both labeled and unlabeled data for training, which enables a good classifier with only a small amount of labeled data. In this paper, we propose and theoretically analyze a graph-based semi-supervised learning method with the aid of the quantum annealing technique, which efficiently utilizes the quantum resources while maintaining good accuracy. We illustrate two classification examples, suggesting the feasibility of this method even with a small portion (30%) of labeled data involved.

DOI
10.1088/1674-1056/abe298

Related papers

Variational quantum semi-supervised classifier based on label propagation

Yan-Yan Hou, Jian Li, Xiu‐Bo Chen +1 more

Label propagation is an essential semi-supervised learning method based on graphs, which has a broad spectrum of applications in pattern recognition and data mining. This paper proposes a quantum semi-supervised classifier based on label propagation. Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method. In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization. Furthermore, we design a quantum semi-supervised binary classifier based on hybrid Bell and Z bases measurement, which has a shallower circuit depth and is more suitable for implementation on near-term quantum devices. We demonstrate the performance of the quantum semi-supervised classifier on the Iris data set, and the simulation results show that the quantum semi-supervised classifier has higher classification accuracy than the swap test classifier. This work opens a new path to quantum machine learning based on graphs.

Chinese Physics B•Feb 8, 2023•2 citations

Quantum Semi-Supervised Learning with Quantum Supremacy

Zhou Shangnan

Quantum machine learning promises to efficiently solve important problems. There are two persistent challenges in classical machine learning: the lack of labeled data, and the limit of computational power. We propose a novel framework that resolves both issues: quantum semi-supervised learning. Moreover, we provide a protocol in systematically designing quantum machine learning algorithms with quantum supremacy, which can be extended beyond quantum semi-supervised learning. In the meantime, we show that naive quantum matrix product estimation algorithm outperforms the best known classical matrix multiplication algorithm. We showcase two concrete quantum semi-supervised learning algorithms: a quantum self-training algorithm named the propagating nearest-neighbor classifier, and the quantum semi-supervised K-means clustering algorithm. By doing time complexity analysis, we conclude that they indeed possess quantum supremacy.

arXiv:2110.02343•Oct 5, 2021•5 citations

Enhancement of Quantum Semi-Supervised Learning via Improved Laplacian and Poisson Methods

Hamed Gholipour, Farid Bozorgnia, Hamzeh Mohammadigheymasi +5 more

This paper develops a hybrid quantum approach for graph-based semi-supervised learning to enhance performance in scenarios where labeled data is scarce. We introduce two enhanced quantum models, the Improved Laplacian Quantum Semi-Supervised Learning (ILQSSL) and the Improved Poisson Quantum Semi-Supervised Learning (IPQSSL), that incorporate advanced label propagation strategies within variational quantum circuits. These models utilize QR decomposition to embed graph structure directly into quantum states, thereby enabling more effective learning in low-label settings. We validate our methods across four benchmark datasets like Iris, Wine, Heart Disease, and German Credit Card -- and show that both ILQSSL and IPQSSL consistently outperform leading classical semi-supervised learning algorithms, particularly under limited supervision. Beyond standard performance metrics, we examine the effect of circuit depth and qubit count on learning quality by analyzing entanglement entropy and Randomized Benchmarking (RB). Our results suggest that while some level of entanglement improves the model's ability to generalize, increased circuit complexity may introduce noise that undermines performance on current quantum hardware. Overall, the study highlights the potential of quantum-enhanced models for semi-supervised learning, offering practical insights into how quantum circuits can be designed to balance expressivity and stability. These findings support the role of quantum machine learning in advancing data-efficient classification, especially in applications constrained by label availability and hardware limitations.

arXiv:2508.02054•Aug 4, 2025•0 citations

ILF: A Quantum Semi-Supervised Learning Approach for Binary Classification

Reshma Ahmed Swarna, Mohammed Ibrahim Hussain, Md. Sadiq Iqbal +2 more

The lack of enough labeled data is a great issue when designing a real-life scheme.Data labeling is timeconsuming as well as costly.Semi-supervised learning (SSL) is a way to solve the issues of data labeling.SSL uses a tiny quantity of labeled data to find labels of massive quantities of unlabeled data.This paper presents a quantum-classical SSL mechanism named "Iterative Labels Finding (ILF)" by combining the Quantum Support Vector Machine algorithm (QSVM) and Ising Models Based Binary Clustering algorithm.The proposed method performs a matching and iteration process to discover the labels of unlabeled data.ILF is designed for binary classification purposes.We have illustrated the experimental result of ILF with a real-time dataset and with a practical example.From experimental results, we have found ILF as a highly efficient approach for quantum SSL.

IJARCCE•Nov 30, 2023•0 citations

Semi-supervised time series classification method for quantum computing

Sheir Yarkoni, Andrii Kleshchonok, Yury Dzerin +2 more

Abstract In this paper we develop methods to solve two problems related to time series (TS) analysis using quantum computing: reconstruction and classification. We formulate the task of reconstructing a given TS from a training set of data as an unconstrained binary optimization (QUBO) problem, which can be solved by both quantum annealers and gate-model quantum processors. We accomplish this by discretizing the TS and converting the reconstruction to a set cover problem, allowing us to perform a one-versus-all method of reconstruction. Using the solution to the reconstruction problem, we show how to extend this method to perform semi-supervised classification of TS data. We present results indicating our method is competitive with current semi- and unsupervised classification techniques, but using less data than classical techniques.

arXiv:2006.11031•Quantum Machine Intelligence•Apr 6, 2021•10 citations

Entanglement verification with deep semisupervised machine learning

Lifeng Zhang, Zhihua Chen, Shao-Ming Fei

Quantum entanglement lies at the heart of quantum information-processing tasks. Although many criteria have been proposed, efficient and scalable methods to detect the entanglement of generally given quantum states are still not available yet, particularly for high-dimensional and multipartite quantum systems. Based on FixMatch and Pseudo-Label methods, we propose a deep semisupervised learning model with a small portion of labeled data and a large portion of unlabeled data. The data-augmentation strategies are applied in this model by using the convexity of separable states and performing local unitary operations on the training data. We verify that our model has good generalization ability and gives rise to better accuracies than traditional supervised learning models with detailed examples.

arXiv:2308.15391•Physical Review A•Aug 28, 2023•17 citations
Recent advances in quantum technology have led to the development and the manufacturing of programmable quantum annealers that promise to solve certain combinatorial optimization problems faster than their classical counterparts. Semi-supervised learning is a machine learning technique that makes use of both labeled and unlabeled data for training, which enables a good classifier with only a small amount of labeled data. In this paper, we propose and theoretically analyze a graph-based semi-supervised learning method with the aid of the quantum annealing technique, which efficiently utilizes the quantum resources while maintaining good accuracy. We illustrate two classification examples, suggesting the feasibility of this method even with a small portion (30%) of labeled data involved.
Label propagation is an essential semi-supervised learning method based on graphs, which has a broad spectrum of applications in pattern recognition and data mining. This paper proposes a quantum semi-supervised classifier based on label propagation. Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method. In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization. Furthermore, we design a quantum semi-supervised binary classifier based on hybrid Bell and Z bases measurement, which has a shallower circuit depth and is more suitable for implementation on near-term quantum devices. We demonstrate the performance of the quantum semi-supervised classifier on the Iris data set, and the simulation results show that the quantum semi-supervised classifier has higher classification accuracy than the swap test classifier. This work opens a new path to quantum machine learning based on graphs.
Quantum machine learning promises to efficiently solve important problems. There are two persistent challenges in classical machine learning: the lack of labeled data, and the limit of computational power. We propose a novel framework that resolves both issues: quantum semi-supervised learning. Moreover, we provide a protocol in systematically designing quantum machine learning algorithms with quantum supremacy, which can be extended beyond quantum semi-supervised learning. In the meantime, we show that naive quantum matrix product estimation algorithm outperforms the best known classical matrix multiplication algorithm. We showcase two concrete quantum semi-supervised learning algorithms: a quantum self-training algorithm named the propagating nearest-neighbor classifier, and the quantum semi-supervised K-means clustering algorithm. By doing time complexity analysis, we conclude that they indeed possess quantum supremacy.
This paper develops a hybrid quantum approach for graph-based semi-supervised learning to enhance performance in scenarios where labeled data is scarce. We introduce two enhanced quantum models, the Improved Laplacian Quantum Semi-Supervised Learning (ILQSSL) and the Improved Poisson Quantum Semi-Supervised Learning (IPQSSL), that incorporate advanced label propagation strategies within variational quantum circuits. These models utilize QR decomposition to embed graph structure directly into quantum states, thereby enabling more effective learning in low-label settings. We validate our methods across four benchmark datasets like Iris, Wine, Heart Disease, and German Credit Card -- and show that both ILQSSL and IPQSSL consistently outperform leading classical semi-supervised learning algorithms, particularly under limited supervision. Beyond standard performance metrics, we examine the effect of circuit depth and qubit count on learning quality by analyzing entanglement entropy and Randomized Benchmarking (RB). Our results suggest that while some level of entanglement improves the model's ability to generalize, increased circuit complexity may introduce noise that undermines performance on current quantum hardware. Overall, the study highlights the potential of quantum-enhanced models for semi-supervised learning, offering practical insights into how quantum circuits can be designed to balance expressivity and stability. These findings support the role of quantum machine learning in advancing data-efficient classification, especially in applications constrained by label availability and hardware limitations.
The lack of enough labeled data is a great issue when designing a real-life scheme.Data labeling is timeconsuming as well as costly.Semi-supervised learning (SSL) is a way to solve the issues of data labeling.SSL uses a tiny quantity of labeled data to find labels of massive quantities of unlabeled data.This paper presents a quantum-classical SSL mechanism named "Iterative Labels Finding (ILF)" by combining the Quantum Support Vector Machine algorithm (QSVM) and Ising Models Based Binary Clustering algorithm.The proposed method performs a matching and iteration process to discover the labels of unlabeled data.ILF is designed for binary classification purposes.We have illustrated the experimental result of ILF with a real-time dataset and with a practical example.From experimental results, we have found ILF as a highly efficient approach for quantum SSL.
Abstract In this paper we develop methods to solve two problems related to time series (TS) analysis using quantum computing: reconstruction and classification. We formulate the task of reconstructing a given TS from a training set of data as an unconstrained binary optimization (QUBO) problem, which can be solved by both quantum annealers and gate-model quantum processors. We accomplish this by discretizing the TS and converting the reconstruction to a set cover problem, allowing us to perform a one-versus-all method of reconstruction. Using the solution to the reconstruction problem, we show how to extend this method to perform semi-supervised classification of TS data. We present results indicating our method is competitive with current semi- and unsupervised classification techniques, but using less data than classical techniques.
Quantum entanglement lies at the heart of quantum information-processing tasks. Although many criteria have been proposed, efficient and scalable methods to detect the entanglement of generally given quantum states are still not available yet, particularly for high-dimensional and multipartite quantum systems. Based on FixMatch and Pseudo-Label methods, we propose a deep semisupervised learning model with a small portion of labeled data and a large portion of unlabeled data. The data-augmentation strategies are applied in this model by using the convexity of separable states and performing local unitary operations on the training data. We verify that our model has good generalization ability and gives rise to better accuracies than traditional supervised learning models with detailed examples.