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

Quantum science and technology

Supervised Learning with Quantum Computers

Maria Schuld, Francesco Petruccione

Published Jan 1, 2018• 786 citations
Publisher
DOI
10.1007/978-3-319-96424-9

Related papers

Quantum computing methods for supervised learning

Viraj Kulkarni, Milind Kulkarni, Aniruddha Pant

arXiv:2006.12025•Quantum Machine Intelligence•Sep 6, 2021•43 citations

Quantum computing and supervised machine learning

Luca Oneto, Sandro Ridella, Davide Anguita

Elsevier eBooks•Oct 7, 2016•10 citations

Quantum Supervised Learning

Antonio Macaluso

arXiv:2407.17161•Künstliche Intell.•Jul 19, 2024•12 citations

Supervised learning with quantum-enhanced feature spaces

Vojtěch Havlíček, Antonio D. Corcoles, Kristan Temme +4 more

arXiv:1804.11326•Nature•Mar 13, 2019•3,056 citations

Supervised learning with a quantum classifier using multi-level systems

Soumik Adhikary, Siddharth Dangwal, Debanjan Bhowmik

arXiv:1908.08385•Quantum Information Processing•Jan 21, 2020•72 citations

Quantum Machine Learning For Classical Data

Leonard Wossnig

In this dissertation, we study the intersection of quantum computing and supervised machine learning algorithms, which means that we investigate quantum algorithms for supervised machine learning that operate on classical data. This area of research falls under the umbrella of quantum machine learning, a research area of computer science which has recently received wide attention. In particular, we investigate to what extent quantum computers can be used to accelerate supervised machine learning algorithms. The aim of this is to develop a clear understanding of the promises and limitations of the current state of the art of quantum algorithms for supervised machine learning, but also to define directions for future research in this exciting field. We start by looking at supervised quantum machine learning (QML) algorithms through the lens of statistical learning theory. In this framework, we derive novel bounds on the computational complexities of a large set of supervised QML algorithms under the requirement of optimal learning rates. Next, we give a new bound for Hamiltonian simulation of dense Hamiltonians, a major subroutine of most known supervised QML algorithms, and then derive a classical algorithm with nearly the same complexity. We then draw the parallels to recent "quantum-inspired" results, and will explain the implications of these results for quantum machine learning applications. Looking for areas which might bear larger advantages for QML algorithms, we finally propose a novel algorithm for Quantum Boltzmann machines, and argue that quantum algorithms for quantum data are one of the most promising applications for QML with potentially exponential advantage over classical approaches.

arXiv:2105.03684•May 8, 2021•14 citations
In this dissertation, we study the intersection of quantum computing and supervised machine learning algorithms, which means that we investigate quantum algorithms for supervised machine learning that operate on classical data. This area of research falls under the umbrella of quantum machine learning, a research area of computer science which has recently received wide attention. In particular, we investigate to what extent quantum computers can be used to accelerate supervised machine learning algorithms. The aim of this is to develop a clear understanding of the promises and limitations of the current state of the art of quantum algorithms for supervised machine learning, but also to define directions for future research in this exciting field. We start by looking at supervised quantum machine learning (QML) algorithms through the lens of statistical learning theory. In this framework, we derive novel bounds on the computational complexities of a large set of supervised QML algorithms under the requirement of optimal learning rates. Next, we give a new bound for Hamiltonian simulation of dense Hamiltonians, a major subroutine of most known supervised QML algorithms, and then derive a classical algorithm with nearly the same complexity. We then draw the parallels to recent "quantum-inspired" results, and will explain the implications of these results for quantum machine learning applications. Looking for areas which might bear larger advantages for QML algorithms, we finally propose a novel algorithm for Quantum Boltzmann machines, and argue that quantum algorithms for quantum data are one of the most promising applications for QML with potentially exponential advantage over classical approaches.