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:1704.01965 · The European Physical Journal Plus

Fidelity-based supervised and unsupervised learning for binary classification of quantum states

Farzad Shahi, A. T. Rezakhani

Published Mar 1, 2021• 3 citations
arXivHTMLPDF
DOI
10.1140/epjp/s13360-021-01232-2

Related papers

Direct fidelity estimation of quantum states using machine learning

Xiaoqi Zhou

SPIE Conference on Quantum and Nonlinear Optics•Dec 30, 2022•1 citation

Quarta: quantum supervised and unsupervised learning for binary classification in domain-incremental learning

Corrado Appice Annalisa Malerba Donato Loglisci, Donato Malerba, Saverio Pascazio

Abstract Quantum machine learning recently gained prominence due to the promise of quantum computers in solving machine learning problems that are intractable on a classical computer. Nevertheless, several studies on problems which remain challenging for classical computing algorithms are emerging. One of these is classifying continuously incoming data instances in incremental fashion, which is studied in this paper through a hybrid computational solution that combines classical and quantum techniques. Hybrid approaches represents one of the current ways for the use of quantum computation in practical applications. In this paper, we show how typical issues of domain-incremental learning can be equally addressed with the properties of quantum mechanics, until to offer often better results. We propose the framework QUARTA to combine algorithms of quantum supervised learning, that is, variational quantum circuits, and techniques used in quantum unsupervised learning, that is, distance estimation. We aim at keeping the classification capabilities, which have learned on previously processed data instances, preserved as much as possible, and then acquiring new knowledge on new data instances. Experiments are performed on real-world datasets with quantum simulators.

Quantum Machine Intelligence•Oct 14, 2024•8 citations

Supervised and unsupervised learning of directed percolation

Jianmin Shen, Wei Li, Shengfeng Deng +1 more

Machine learning (ML) has been well applied to studying equilibrium phase transition models by accurately predicating critical thresholds and some critical exponents. Difficulty will be raised, however, for integrating ML into nonequilibrium phase transitions. The extra dimension in a given nonequilibrium system, namely time, can greatly slow down the procedure toward the steady state. In this paper we find that by using some simple techniques of ML, non-steady-state configurations of directed percolation (DP) suffice to capture its essential critical behaviors in both (1+1) and (2+1) dimensions. With the supervised learning method, the framework of our binary classification neural networks can identify the phase transition threshold, as well as the spatial and temporal correlation exponents. The characteristic time t_{c}, specifying the transition from active phases to absorbing ones, is also a major product of the learning. Moreover, we employ the convolutional autoencoder, an unsupervised learning technique, to extract dimensionality reduction representations and cluster configurations of (1+1) bond DP. It is quite appealing that such a method can yield a reasonable estimation of the critical point.

arXiv:2101.06392•Physical review. E•May 27, 2021•37 citations

Supervised Learning with Quantum Computers

Maria Schuld, Francesco Petruccione

Quantum science and technology•Jan 1, 2018•707 citations

Quantum Algorithms for Nearest-Neighbor Methods for Supervised and Unsupervised Learning

Nathan Wiebe, Ashish Kapoor, Krysta M. Svore

We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove upper bounds on the number of queries to the input data required to compute these metrics. In the worst case, our quantum algorithms lead to polynomial reductions in query complexity relative to the corresponding classical algorithm. In certain cases, we show exponential or even super-exponential reductions over the classical analog. We study the performance of our quantum nearest-neighbor algorithms on several real-world binary classification tasks and find that the classification accuracy is competitive with classical methods.

arXiv:1401.2142•Jan 9, 2014•8 citations

A Quantum Machine Learning Model for Supervised Classification

Kalyan Netti

Smart innovation, systems and technologies•Jan 1, 2025•1 citation
Abstract Quantum machine learning recently gained prominence due to the promise of quantum computers in solving machine learning problems that are intractable on a classical computer. Nevertheless, several studies on problems which remain challenging for classical computing algorithms are emerging. One of these is classifying continuously incoming data instances in incremental fashion, which is studied in this paper through a hybrid computational solution that combines classical and quantum techniques. Hybrid approaches represents one of the current ways for the use of quantum computation in practical applications. In this paper, we show how typical issues of domain-incremental learning can be equally addressed with the properties of quantum mechanics, until to offer often better results. We propose the framework QUARTA to combine algorithms of quantum supervised learning, that is, variational quantum circuits, and techniques used in quantum unsupervised learning, that is, distance estimation. We aim at keeping the classification capabilities, which have learned on previously processed data instances, preserved as much as possible, and then acquiring new knowledge on new data instances. Experiments are performed on real-world datasets with quantum simulators.
Machine learning (ML) has been well applied to studying equilibrium phase transition models by accurately predicating critical thresholds and some critical exponents. Difficulty will be raised, however, for integrating ML into nonequilibrium phase transitions. The extra dimension in a given nonequilibrium system, namely time, can greatly slow down the procedure toward the steady state. In this paper we find that by using some simple techniques of ML, non-steady-state configurations of directed percolation (DP) suffice to capture its essential critical behaviors in both (1+1) and (2+1) dimensions. With the supervised learning method, the framework of our binary classification neural networks can identify the phase transition threshold, as well as the spatial and temporal correlation exponents. The characteristic time t_{c}, specifying the transition from active phases to absorbing ones, is also a major product of the learning. Moreover, we employ the convolutional autoencoder, an unsupervised learning technique, to extract dimensionality reduction representations and cluster configurations of (1+1) bond DP. It is quite appealing that such a method can yield a reasonable estimation of the critical point.
We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove upper bounds on the number of queries to the input data required to compute these metrics. In the worst case, our quantum algorithms lead to polynomial reductions in query complexity relative to the corresponding classical algorithm. In certain cases, we show exponential or even super-exponential reductions over the classical analog. We study the performance of our quantum nearest-neighbor algorithms on several real-world binary classification tasks and find that the classification accuracy is competitive with classical methods.