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

Quantum Machine Learning using Gaussian Processes with Performant Quantum Kernels

Matthew Otten, Imene R. Goumiri, Benjamin W. Priest, George Chapline, Michael D. Schneider

Published Apr 23, 2020• 27 citations
arXivHTMLPDF

Abstract

Quantum computers have the opportunity to be transformative for a variety of computational tasks. Recently, there have been proposals to use the unsimulatably of large quantum devices to perform regression, classification, and other machine learning tasks with quantum advantage by using kernel methods. While unsimulatably is a necessary condition for quantum advantage in machine learning, it is not sufficient, as not all kernels are equally effective. Here, we study the use of quantum computers to perform the machine learning tasks of one- and multi-dimensional regression, as well as reinforcement learning, using Gaussian Processes. By using approximations of performant classical kernels enhanced with extra quantum resources, we demonstrate that quantum devices, both in simulation and on hardware, can perform machine learning tasks at least as well as, and many times better than, the classical inspiration. Our informed kernel design demonstrates a path towards effectively utilizing quantum devices for machine learning tasks.

DOI
10.48550/arxiv.2004.11280

Related papers

Quantum machine learning for multiclass classification beyond kernel methods

Chao Ding, Shi Wang, Yaonan Wang +1 more

Quantum machine learning is considered one of the current research fields with great potential. In recent years, Havl\'{\i}\ifmmode \check{c}\else \v{c}\fi{}ek et al. [Nature (London) 567, 209 (2019)] have proposed a quantum machine learning algorithm with quantum-enhanced feature spaces, which effectively addressed a binary classification problem and offered a potential pathway to achieving quantum advantage. However, a straightforward binary classification algorithm falls short in solving multiclass classification problems. In this paper, we propose a quantum algorithm that rigorously demonstrates that quantum kernel methods enhance the efficiency of multiclass classification in real-world applications, providing quantum-enhanced performance. To demonstrate this, we design six distinct quantum kernels within the quantum algorithm to map input data into quantum state spaces and estimate the corresponding quantum kernel matrices. The results from quantum simulations reveal that the quantum algorithm outperforms its classical counterpart in handling six real-world multiclass classification problems. Furthermore, we leverage a variety of performance metrics to comprehensively evaluate the classification and generalization performance of the quantum algorithm. The results demonstrate that the quantum algorithm achieves superior classification and better generalization performance relative to classical counterparts.

arXiv:2411.02913•Physical Review A•Jun 6, 2025•10 citations

Benchmarking Quantum Machine Learning Kernel Training for Classification Tasks

Diego Álvarez-Estévez

Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.

arXiv:2408.10274•IEEE Transactions on Quantum Engineering•Jan 1, 2025•52 citations

Quantum Machine Learning: Harnessing Quantum Algorithms for Supervised and Unsupervised Learning

Mohit Mittal

Quantum machine learning (QML) provides a transformative approach to data analysis by integrating the principles of quantum computing with classical machine learning methods. With the exponential growth of data and the increasing complexity of computational tasks, quantum algorithms offer tremendous advantages in terms of processing speed, memory efficiency, and the ability to resolve issues intractable for classical systems. In this work, the use of QML techniques for both supervised and unsupervised learning problems is explored. Quantum-enhanced models such Quantum Support Vector Machines (QSVMs) and Quantum Neural Networks (QNNs) show outstanding performance in classification and regression tasks by using quantum kernels and entanglement in supervised learning. Moreover, hybrid quantum-classical solutions offer useful implementations on noisy intermediate-scale quantum (NISQ) devices, hence bridging the gap between present quantum technology and practical uses. By means of comparative analysis, this paper emphasizes the possible benefits and drawbacks of QML, thereby providing understanding of its future importance in sectors including material science, finance, and healthcare. In the end, QML opens the path for a new era of intelligent data processing and solves until unthinkable difficult challenges.

International Journal of Innovative Research in Science Engineering and Technology•Sep 30, 2022•3 citations

Benchmarking of quantum fidelity kernels for Gaussian process regression

Xuyang Guo, Jun Feng Dai, Roman V. Krems

Abstract Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. Here, we examine the performance of quantum kernels for regression problems of practical interest. For an unbiased benchmarking of quantum kernels, it is necessary to construct the most optimal functional form of the classical kernels and the most optimal quantum kernels for each given data set. We develop an algorithm that uses an analog of the Bayesian information criterion to optimize the sequence of quantum gates used to estimate quantum kernels for Gaussian process models. The algorithm increases the complexity of the quantum circuits incrementally, while improving the performance of the resulting kernels, and is shown to yield much higher model accuracy with fewer quantum gates than a fixed quantum circuit ansatz. We demonstrate that quantum kernels thus obtained can be used to build accurate models of global potential energy surfaces (PES) for polyatomic molecules. The average interpolation error of the six-dimensional PES obtained with a random distribution of 2000 energy points is 16 cm−1 for H3O+, 15 cm−1 for H2CO and 88 cm−1 for HNO2. We show that a compositional optimization of classical kernels for Gaussian process regression converges to the same errors. This indicates that quantum kernels can achieve the same, though not better, expressivity as classical kernels for regression problems.

arXiv:2407.15961•Machine Learning Science and Technology•Sep 1, 2024•1 citation

Applicability of quantum-enhanced machine learning (本文)

ユウダイ スズキ, Yudai Suzuki, 雄大 鈴木

Quantum computers are next-generation computing devices that have the potential to enhance the performance of machine learning.An approach to achieving quantum enhancement is to utilize the Hilbert space, whose dimension scales exponentially in the number of qubits, as a feature space for machine learning.The use of such quantum-enhanced feature space could enable us to find data patterns more easily than conventional methods.Thus far, it has been theoretically shown that quantum-enhanced machine learning models can solve specific classification tasks that classical methods cannot efficiently solve.This motivates many researchers to pursue practical advantages of the methods.Toward practical applications, it is critical to establish guidelines for designs of quantum-enhanced machine learning models.This thesis aims to analyze the performance of quantum-enhanced machine learning models and give insights into design principles of the models for practical applications.More specifically, we focus on two methods, quantum kernel methods and quantum reservoir computing, and then provide guidelines for building their models in practical situations.We focus on two challenges in quantum kernel methods for real-world applications.The first is that constructing quantum feature maps is nontrivial when applied to actual machine learning problems.This thesis proposes a method for analyzing quantum feature maps, which can help screen a suitable quantum feature map among many candidates.In addition, we examine the effectiveness of a synthesis method to construct a powerful quantum kernel.Another issue is that implementation feasibility and trainability deteriorate as the number of qubits increases.We thus propose a new quantum kernel called the quantum Fisher kernel and demonstrate from analytical and numerical perspectives that our proposal can avoid the aforementioned problem when shallow alternating layered ansatzes are used.In quantum reservoir computing, there is room for investigation in designing quantum reservoir systems that are amenable to implementation and can perform well.In this thesis, we propose a quantum reservoir computing framework that positively makes use of unavoidable quantum noise in actual quantum hardware.Our experimental demonstrations on superconducting quantum devices show that quantum noise can enhance temporal information processing.Also, numerical analysis using a tool called temporal information processing capacity elucidates that dissipation noise such as amplitude damping can induce sequential data processing capabilities.

•Jan 1, 2023•0 citations

Assessing quantum advantage for Gaussian process regression

Dominic Lowe, M. S. Kim, Roberto Bondesan

Abstract Gaussian Process Regression is a machine learning technique with established applications for which several quantum algorithms have been proposed. We show here that in a wide range of scenarios these algorithms show no exponential speedup. We achieve this by rigorously proving that the condition number of a kernel matrix scales at least linearly with the matrix size under general assumptions on the data and kernel. We additionally prove that the sparsity and Frobenius norm of a kernel matrix scale linearly under similar assumptions. Our results give similar conclusions for kernel ridge regression and quantum support vector machines under the same assumptions. The implications for the quantum algorithms runtime are independent of the complexity of loading classical data on a quantum computer and also apply to dequantised algorithms. We supplement our theoretical analysis with numerical verification for popular kernels in machine learning.

arXiv:2505.22502•npj Quantum Information•Aug 14, 2026•3 citations
Quantum computers have the opportunity to be transformative for a variety of computational tasks. Recently, there have been proposals to use the unsimulatably of large quantum devices to perform regression, classification, and other machine learning tasks with quantum advantage by using kernel methods. While unsimulatably is a necessary condition for quantum advantage in machine learning, it is not sufficient, as not all kernels are equally effective. Here, we study the use of quantum computers to perform the machine learning tasks of one- and multi-dimensional regression, as well as reinforcement learning, using Gaussian Processes. By using approximations of performant classical kernels enhanced with extra quantum resources, we demonstrate that quantum devices, both in simulation and on hardware, can perform machine learning tasks at least as well as, and many times better than, the classical inspiration. Our informed kernel design demonstrates a path towards effectively utilizing quantum devices for machine learning tasks.
Quantum machine learning is considered one of the current research fields with great potential. In recent years, Havl\'{\i}\ifmmode \check{c}\else \v{c}\fi{}ek et al. [Nature (London) 567, 209 (2019)] have proposed a quantum machine learning algorithm with quantum-enhanced feature spaces, which effectively addressed a binary classification problem and offered a potential pathway to achieving quantum advantage. However, a straightforward binary classification algorithm falls short in solving multiclass classification problems. In this paper, we propose a quantum algorithm that rigorously demonstrates that quantum kernel methods enhance the efficiency of multiclass classification in real-world applications, providing quantum-enhanced performance. To demonstrate this, we design six distinct quantum kernels within the quantum algorithm to map input data into quantum state spaces and estimate the corresponding quantum kernel matrices. The results from quantum simulations reveal that the quantum algorithm outperforms its classical counterpart in handling six real-world multiclass classification problems. Furthermore, we leverage a variety of performance metrics to comprehensively evaluate the classification and generalization performance of the quantum algorithm. The results demonstrate that the quantum algorithm achieves superior classification and better generalization performance relative to classical counterparts.
Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.
Quantum machine learning (QML) provides a transformative approach to data analysis by integrating the principles of quantum computing with classical machine learning methods. With the exponential growth of data and the increasing complexity of computational tasks, quantum algorithms offer tremendous advantages in terms of processing speed, memory efficiency, and the ability to resolve issues intractable for classical systems. In this work, the use of QML techniques for both supervised and unsupervised learning problems is explored. Quantum-enhanced models such Quantum Support Vector Machines (QSVMs) and Quantum Neural Networks (QNNs) show outstanding performance in classification and regression tasks by using quantum kernels and entanglement in supervised learning. Moreover, hybrid quantum-classical solutions offer useful implementations on noisy intermediate-scale quantum (NISQ) devices, hence bridging the gap between present quantum technology and practical uses. By means of comparative analysis, this paper emphasizes the possible benefits and drawbacks of QML, thereby providing understanding of its future importance in sectors including material science, finance, and healthcare. In the end, QML opens the path for a new era of intelligent data processing and solves until unthinkable difficult challenges.
Abstract Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. Here, we examine the performance of quantum kernels for regression problems of practical interest. For an unbiased benchmarking of quantum kernels, it is necessary to construct the most optimal functional form of the classical kernels and the most optimal quantum kernels for each given data set. We develop an algorithm that uses an analog of the Bayesian information criterion to optimize the sequence of quantum gates used to estimate quantum kernels for Gaussian process models. The algorithm increases the complexity of the quantum circuits incrementally, while improving the performance of the resulting kernels, and is shown to yield much higher model accuracy with fewer quantum gates than a fixed quantum circuit ansatz. We demonstrate that quantum kernels thus obtained can be used to build accurate models of global potential energy surfaces (PES) for polyatomic molecules. The average interpolation error of the six-dimensional PES obtained with a random distribution of 2000 energy points is 16 cm−1 for H3O+, 15 cm−1 for H2CO and 88 cm−1 for HNO2. We show that a compositional optimization of classical kernels for Gaussian process regression converges to the same errors. This indicates that quantum kernels can achieve the same, though not better, expressivity as classical kernels for regression problems.
Quantum computers are next-generation computing devices that have the potential to enhance the performance of machine learning.An approach to achieving quantum enhancement is to utilize the Hilbert space, whose dimension scales exponentially in the number of qubits, as a feature space for machine learning.The use of such quantum-enhanced feature space could enable us to find data patterns more easily than conventional methods.Thus far, it has been theoretically shown that quantum-enhanced machine learning models can solve specific classification tasks that classical methods cannot efficiently solve.This motivates many researchers to pursue practical advantages of the methods.Toward practical applications, it is critical to establish guidelines for designs of quantum-enhanced machine learning models.This thesis aims to analyze the performance of quantum-enhanced machine learning models and give insights into design principles of the models for practical applications.More specifically, we focus on two methods, quantum kernel methods and quantum reservoir computing, and then provide guidelines for building their models in practical situations.We focus on two challenges in quantum kernel methods for real-world applications.The first is that constructing quantum feature maps is nontrivial when applied to actual machine learning problems.This thesis proposes a method for analyzing quantum feature maps, which can help screen a suitable quantum feature map among many candidates.In addition, we examine the effectiveness of a synthesis method to construct a powerful quantum kernel.Another issue is that implementation feasibility and trainability deteriorate as the number of qubits increases.We thus propose a new quantum kernel called the quantum Fisher kernel and demonstrate from analytical and numerical perspectives that our proposal can avoid the aforementioned problem when shallow alternating layered ansatzes are used.In quantum reservoir computing, there is room for investigation in designing quantum reservoir systems that are amenable to implementation and can perform well.In this thesis, we propose a quantum reservoir computing framework that positively makes use of unavoidable quantum noise in actual quantum hardware.Our experimental demonstrations on superconducting quantum devices show that quantum noise can enhance temporal information processing.Also, numerical analysis using a tool called temporal information processing capacity elucidates that dissipation noise such as amplitude damping can induce sequential data processing capabilities.
Abstract Gaussian Process Regression is a machine learning technique with established applications for which several quantum algorithms have been proposed. We show here that in a wide range of scenarios these algorithms show no exponential speedup. We achieve this by rigorously proving that the condition number of a kernel matrix scales at least linearly with the matrix size under general assumptions on the data and kernel. We additionally prove that the sparsity and Frobenius norm of a kernel matrix scale linearly under similar assumptions. Our results give similar conclusions for kernel ridge regression and quantum support vector machines under the same assumptions. The implications for the quantum algorithms runtime are independent of the complexity of loading classical data on a quantum computer and also apply to dequantised algorithms. We supplement our theoretical analysis with numerical verification for popular kernels in machine learning.