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:1905.01390

The Power of One Qubit in Machine Learning

Roohollah Ghobadi, Jaspreet S. Oberoi, Ehsan Zahedinejhad

Published May 3, 2019• 17 citations
arXivHTMLPDF

Abstract

Kernel methods are used extensively in classical machine learning, especially in the field of pattern analysis. In this paper, we propose a kernel-based quantum machine learning algorithm that can be implemented on a near-term, intermediate scale quantum device. Our proposal is based on estimating classically intractable kernel functions, using a restricted quantum model known as deterministic quantum computing with one qubit. Our method provides a framework for studying the role of quantum correlations other than quantum entanglement for machine learning applications.

DOI
10.48550/arxiv.1905.01390

Related papers

The power of one clean qubit in supervised machine learning

Mahsa Karimi, Ali Javadi-Abhari, Christoph Simon +1 more

This paper explores the potential benefits of quantum coherence and quantum discord in the non-universal quantum computing model called deterministic quantum computing with one qubit (DQC1) in supervised machine learning. We show that the DQC1 model can be leveraged to develop an efficient method for estimating complex kernel functions. We demonstrate a simple relationship between coherence consumption and the kernel function, a crucial element in machine learning. The paper presents an implementation of a binary classification problem on IBM hardware using the DQC1 model and analyzes the impact of quantum coherence and hardware noise. The advantage of our proposal lies in its utilization of quantum discord, which is more resilient to noise than entanglement.

arXiv:2210.09275•Scientific Reports•Nov 15, 2023•11 citations

Quantum Multiple Kernel Learning

Seyed Shakib Vedaie, Moslem Noori, Jaspreet S. Oberoi +2 more

Kernel methods play an important role in machine learning applications due to their conceptual simplicity and superior performance on numerous machine learning tasks. Expressivity of a machine learning model, referring to the ability of the model to approximate complex functions, has a significant influence on its performance in these tasks. One approach to enhancing the expressivity of kernel machines is to combine multiple individual kernels to arrive at a more expressive combined kernel. This approach is referred to as multiple kernel learning (MKL). In this work, we propose an MKL method we refer to as quantum MKL, which combines multiple quantum kernels. Our method leverages the power of deterministic quantum computing with one qubit (DQC1) to estimate the combined kernel for a set of classically intractable individual quantum kernels. The combined kernel estimation is achieved without explicitly computing each individual kernel, while still allowing for the tuning of individual kernels in order to achieve better expressivity. Our simulations on two binary classification problems---one performed on a synthetic dataset and the other on a German credit dataset---demonstrate the superiority of the quantum MKL method over single quantum kernel machines.

arXiv:2011.09694•Nov 19, 2020•17 citations

Towards understanding the power of quantum kernels in the NISQ era

Xinbiao Wang, Yuxuan Du, Yong Luo +1 more

A key problem in the field of quantum computing is understanding whether quantum machine learning (QML) models implemented on noisy intermediate-scale quantum (NISQ) machines can achieve quantum advantages. Recently, Huang et al. [Nat Commun 12, 2631] partially answered this question by the lens of quantum kernel learning. Namely, they exhibited that quantum kernels can learn specific datasets with lower generalization error over the optimal classical kernel methods. However, most of their results are established on the ideal setting and ignore the caveats of near-term quantum machines. To this end, a crucial open question is: does the power of quantum kernels still hold under the NISQ setting? In this study, we fill this knowledge gap by exploiting the power of quantum kernels when the quantum system noise and sample error are considered. Concretely, we first prove that the advantage of quantum kernels is vanished for large size of datasets, few number of measurements, and large system noise. With the aim of preserving the superiority of quantum kernels in the NISQ era, we further devise an effective method via indefinite kernel learning. Numerical simulations accord with our theoretical results. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.

arXiv:2103.16774•Quantum•Aug 30, 2021•99 citations

Quantum machine learning beyond kernel methods

Sofiène Jerbi, Lukas J. Fiderer, Hendrik Poulsen Nautrup +3 more

Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and studied extensively. Yet, our understanding of how these models compare, both mutually and to classical models, remains limited. In this work, we identify a constructive framework that captures all standard models based on parametrized quantum circuits: that of linear quantum models. In particular, we show using tools from quantum information theory how data re-uploading circuits, an apparent outlier of this framework, can be efficiently mapped into the simpler picture of linear models in quantum Hilbert spaces. Furthermore, we analyze the experimentally-relevant resource requirements of these models in terms of qubit number and amount of data needed to learn. Based on recent results from classical machine learning, we prove that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points. Our results provide a more comprehensive view of quantum machine learning models as well as insights on the compatibility of different models with NISQ constraints.

arXiv:2110.13162•Nature Communications•Jan 31, 2023•303 citations

Deterministic and random features for large-scale quantum kernel machine

Kouhei Nakaji, Hiroyuki Tezuka, Naoki Yamamoto

Quantum machine learning (QML) is the spearhead of quantum computer applications. In particular, quantum neural networks (QNN) are actively studied as the method that works both in near-term quantum computers and fault-tolerant quantum computers. Recent studies have shown that supervised machine learning with QNN can be interpreted as the quantum kernel method (QKM), suggesting that enhancing the practicality of the QKM is the key to building near-term applications of QML. However, the QKM is also known to have two severe issues. One is that the QKM with the (inner-product based) quantum kernel defined in the original large Hilbert space does not generalize; namely, the model fails to find patterns of unseen data. The other one is that the classical computational cost of the QKM increases at least quadratically with the number of data, and therefore, QKM is not scalable with data size. This paper aims to provide algorithms free from both of these issues. That is, for a class of quantum kernels with generalization capability, we show that the QKM with those quantum kernels can be made scalable by using our proposed deterministic and random features. Our numerical experiment, using datasets including $O(1,000) \sim O(10,000)$ training data, supports the validity of our method.

arXiv:2209.01958•Sep 5, 2022•7 citations

Quantum Kernel Methods

Hamid D. Ismail

This chapter develops quantum kernel-based machine learning as one of the most mature and practically viable paradigms in quantum machine learning (QML). It explains how kernel methods separate quantum representation from classical learning, allowing quantum devices to define feature spaces through state preparation and kernel estimation while leaving optimization and inference to established classical algorithms. This hybrid structure makes quantum kernel methods especially well suited to near-term quantum hardware and provides a conceptually clean framework for studying the role of quantum-induced geometry in learning. This chapter examines the historical emergence of kernel methods in QML, their positioning relative to variational models, and the practical workflow of learning from precomputed quantum kernels. It then analyzes the issues of generalization, regularization, and kernel noise, showing how finite-shot estimation and hardware imperfections affect the learned geometry of the feature space. Two major models are developed in detail: quantum support vector machines (QSVMs), which perform margin maximization in quantum-induced Hilbert spaces, and quantum kernel ridge regression (QKRR), which provides a closed-form framework for studying stability and conditioning. Together, these models illustrate how quantum kernels can be integrated into standard classical learning pipelines while preserving both mathematical rigor and experimental feasibility.

CRC Press eBooks•Nov 4, 2026•0 citations
Kernel methods are used extensively in classical machine learning, especially in the field of pattern analysis. In this paper, we propose a kernel-based quantum machine learning algorithm that can be implemented on a near-term, intermediate scale quantum device. Our proposal is based on estimating classically intractable kernel functions, using a restricted quantum model known as deterministic quantum computing with one qubit. Our method provides a framework for studying the role of quantum correlations other than quantum entanglement for machine learning applications.
This paper explores the potential benefits of quantum coherence and quantum discord in the non-universal quantum computing model called deterministic quantum computing with one qubit (DQC1) in supervised machine learning. We show that the DQC1 model can be leveraged to develop an efficient method for estimating complex kernel functions. We demonstrate a simple relationship between coherence consumption and the kernel function, a crucial element in machine learning. The paper presents an implementation of a binary classification problem on IBM hardware using the DQC1 model and analyzes the impact of quantum coherence and hardware noise. The advantage of our proposal lies in its utilization of quantum discord, which is more resilient to noise than entanglement.
Kernel methods play an important role in machine learning applications due to their conceptual simplicity and superior performance on numerous machine learning tasks. Expressivity of a machine learning model, referring to the ability of the model to approximate complex functions, has a significant influence on its performance in these tasks. One approach to enhancing the expressivity of kernel machines is to combine multiple individual kernels to arrive at a more expressive combined kernel. This approach is referred to as multiple kernel learning (MKL). In this work, we propose an MKL method we refer to as quantum MKL, which combines multiple quantum kernels. Our method leverages the power of deterministic quantum computing with one qubit (DQC1) to estimate the combined kernel for a set of classically intractable individual quantum kernels. The combined kernel estimation is achieved without explicitly computing each individual kernel, while still allowing for the tuning of individual kernels in order to achieve better expressivity. Our simulations on two binary classification problems---one performed on a synthetic dataset and the other on a German credit dataset---demonstrate the superiority of the quantum MKL method over single quantum kernel machines.
A key problem in the field of quantum computing is understanding whether quantum machine learning (QML) models implemented on noisy intermediate-scale quantum (NISQ) machines can achieve quantum advantages. Recently, Huang et al. [Nat Commun 12, 2631] partially answered this question by the lens of quantum kernel learning. Namely, they exhibited that quantum kernels can learn specific datasets with lower generalization error over the optimal classical kernel methods. However, most of their results are established on the ideal setting and ignore the caveats of near-term quantum machines. To this end, a crucial open question is: does the power of quantum kernels still hold under the NISQ setting? In this study, we fill this knowledge gap by exploiting the power of quantum kernels when the quantum system noise and sample error are considered. Concretely, we first prove that the advantage of quantum kernels is vanished for large size of datasets, few number of measurements, and large system noise. With the aim of preserving the superiority of quantum kernels in the NISQ era, we further devise an effective method via indefinite kernel learning. Numerical simulations accord with our theoretical results. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and studied extensively. Yet, our understanding of how these models compare, both mutually and to classical models, remains limited. In this work, we identify a constructive framework that captures all standard models based on parametrized quantum circuits: that of linear quantum models. In particular, we show using tools from quantum information theory how data re-uploading circuits, an apparent outlier of this framework, can be efficiently mapped into the simpler picture of linear models in quantum Hilbert spaces. Furthermore, we analyze the experimentally-relevant resource requirements of these models in terms of qubit number and amount of data needed to learn. Based on recent results from classical machine learning, we prove that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points. Our results provide a more comprehensive view of quantum machine learning models as well as insights on the compatibility of different models with NISQ constraints.
Quantum machine learning (QML) is the spearhead of quantum computer applications. In particular, quantum neural networks (QNN) are actively studied as the method that works both in near-term quantum computers and fault-tolerant quantum computers. Recent studies have shown that supervised machine learning with QNN can be interpreted as the quantum kernel method (QKM), suggesting that enhancing the practicality of the QKM is the key to building near-term applications of QML. However, the QKM is also known to have two severe issues. One is that the QKM with the (inner-product based) quantum kernel defined in the original large Hilbert space does not generalize; namely, the model fails to find patterns of unseen data. The other one is that the classical computational cost of the QKM increases at least quadratically with the number of data, and therefore, QKM is not scalable with data size. This paper aims to provide algorithms free from both of these issues. That is, for a class of quantum kernels with generalization capability, we show that the QKM with those quantum kernels can be made scalable by using our proposed deterministic and random features. Our numerical experiment, using datasets including O(1,000)∼O(10,000)O(1,000) \sim O(10,000)O(1,000)∼O(10,000) training data, supports the validity of our method.
This chapter develops quantum kernel-based machine learning as one of the most mature and practically viable paradigms in quantum machine learning (QML). It explains how kernel methods separate quantum representation from classical learning, allowing quantum devices to define feature spaces through state preparation and kernel estimation while leaving optimization and inference to established classical algorithms. This hybrid structure makes quantum kernel methods especially well suited to near-term quantum hardware and provides a conceptually clean framework for studying the role of quantum-induced geometry in learning. This chapter examines the historical emergence of kernel methods in QML, their positioning relative to variational models, and the practical workflow of learning from precomputed quantum kernels. It then analyzes the issues of generalization, regularization, and kernel noise, showing how finite-shot estimation and hardware imperfections affect the learned geometry of the feature space. Two major models are developed in detail: quantum support vector machines (QSVMs), which perform margin maximization in quantum-induced Hilbert spaces, and quantum kernel ridge regression (QKRR), which provides a closed-form framework for studying stability and conditioning. Together, these models illustrate how quantum kernels can be integrated into standard classical learning pipelines while preserving both mathematical rigor and experimental feasibility.