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:1004.2468 · New Journal of Physics

Quantum learning: asymptotically optimal classification of qubit states

Mădălin Guţǎ, Wojciech Kotłowski

Published Dec 23, 2010• 54 citations
arXivHTMLPDF

Abstract

Pattern recognition is a central topic in learning theory, with numerous applications such as voice and text recognition, image analysis and computer diagnosis. The statistical setup in classification is the following: we are given an i.i.d. training set ( X 1 , Y 1 ), ... , ( X n , Y n ), where X i represents a feature and Y i ∊{0, 1} is a label attached to that feature. The underlying joint distribution of ( X , Y ) is unknown, but we can learn about it from the training set, and we aim at devising low error classifiers f: X → Y used to predict the label of new incoming features. In this paper, we solve a quantum analogue of this problem, namely the classification of two arbitrary unknown mixed qubit states. Given a number of 'training' copies from each of the states, we would like to 'learn' about them by performing a measurement on the training set. The outcome is then used to design measurements for the classification of future systems with unknown labels. We found the asymptotically optimal classification strategy and show that typically it performs strictly better than a plug-in strategy, which consists of estimating the states separately and then discriminating between them using the Helstrom measurement. The figure of merit is given by the excess risk equal to the difference between the probability of error and the probability of error of the optimal measurement for known states. We show that the excess risk scales as n −1 and compute the exact constant of the rate.

DOI
10.1088/1367-2630/12/12/123032

Related papers

Quantum learning without quantum memory

Gael Sentís, John Calsamiglia, R. Muñoz-Tapia +1 more

A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an "estimate-and-discriminate" machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.

arXiv:1106.2742•Scientific Reports•Oct 5, 2012•58 citations

Quantum learning and universal quantum matching machine

Masahide Sasaki, A. Carlini

Suppose that three kinds of quantum systems are given in some unknown states $|f{〉}^{\ensuremath{\bigotimes}N},$ $|{g}_{1}{〉}^{\ensuremath{\bigotimes}K},$ and $|{g}_{2}{〉}^{\ensuremath{\bigotimes}K},$ and we want to decide which template state $|{g}_{1}〉$ or $|{g}_{2}〉,$ each representing the feature of the pattern class ${\mathcal{C}}_{1}$ or ${\mathcal{C}}_{2},$ respectively, is closest to the input feature state $|f〉.$ This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of $K=1,$ showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process.

arXiv:quant-ph/0202173•Physical Review A•Aug 6, 2002•105 citations

Quantum learning of coherent states

Gael Sentís, Mădălin Guţǎ, Gerardo Adesso

We develop a quantum learning scheme for binary discrimination of coherent states of light. This is a problem of technological relevance for the reading of information stored in a digital memory. In our setting, a coherent light source is used to illuminate a memory cell and retrieve its encoded bit by determining the quantum state of the reflected signal. We consider a situation where the amplitude of the states produced by the source is not fully known, but instead this information is encoded in a large training set comprising many copies of the same coherent state. We show that an optimal global measurement, performed jointly over the signal and the training set, provides higher successful identification rates than any learning strategy based on first estimating the unknown amplitude by means of Gaussian measurements on the training set, followed by an adaptive discrimination procedure on the signal. By considering a simplified variant of the problem, we argue that this is the case even for non-Gaussian estimation measurements. Our results show that, even in absence of entanglement, collective quantum measurements yield an enhancement in the readout of classical information, which is particularly relevant in the operating regime of low-energy signals.

arXiv:1410.8700•EPJ Quantum Technology•Jul 8, 2015•26 citations

Optimal Universal Learning Machines for Quantum State Discrimination

Marco Fanizza, Andrea Mari, Vittorio Giovannetti

We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not have at its disposal a complete classical description of the two template states, but can only have partial prior information about their level of purity and mutual overlap. Moreover, similarly to the classical supervised learning paradigm, we assume that the machine can be trained by n qubits prepared in the first template state and by n more qubits prepared in the second template state. In this situation, we are interested in the optimal process which correctly classifies the input qubit with the largest probability allowed by quantum mechanics. The problem is studied in its full generality for a number of different prior information scenarios and for an arbitrary size n of the training data. Finite size corrections around the asymptotic limit n → ∞ are derived. When the states are assumed to be pure, with known overlap, the problem is also solved in the case of d-level systems.

arXiv:1805.03477•IEEE Transactions on Information Theory•May 16, 2019•29 citations

Quantum ensembles of quantum classifiers

Maria Schuld, Francesco Petruccione

Quantum machine learning witnesses an increasing amount of quantum algorithms for data-driven decision making, a problem with potential applications ranging from automated image recognition to medical diagnosis. Many of those algorithms are implementations of quantum classifiers, or models for the classification of data inputs with a quantum computer. Following the success of collective decision making with ensembles in classical machine learning, this paper introduces the concept of quantum ensembles of quantum classifiers. Creating the ensemble corresponds to a state preparation routine, after which the quantum classifiers are evaluated in parallel and their combined decision is accessed by a single-qubit measurement. This framework naturally allows for exponentially large ensembles in which - similar to Bayesian learning - the individual classifiers do not have to be trained. As an example, we analyse an exponentially large quantum ensemble in which each classifier is weighed according to its performance in classifying the training data, leading to new results for quantum as well as classical machine learning.

arXiv:1704.02146•Scientific Reports•Feb 5, 2018•93 citations

Learning Gaussian optical states with quantum computers

Spencer Dimitroff, John Kallaugher, Ashe Miller +1 more

Recent results have established dramatic advantages in learning properties of quantum states when a quantum computer is available to process or jointly measure multiple copies of the unknown quantum state. Learning tasks can be accomplished with exponentially fewer copies of the state when compared to optimized classical learning strategies that are restricted to measuring one copy of the state at a time. While these results were established in abstract settings and for artificial learning tasks, they motivate the application of quantum computers to imaging and sensing of weak electromagnetic fields since these settings are ultimately concerned with the learning of unknown quantum states. In this work we apply these new results in quantum learning to the problem of learning Gaussian states of the electromagnetic field, which are germane since they describe most fields used in imaging and sensing. In order to connect with quantum learning theory, we consider the transduction of an $n$-mode Gaussian state into a register of qubits on a quantum computer followed by optimized measurements on these qubits to extract the parameters defining the original Gaussian state. We rigorously bound the number of copies of the Gaussian state required to achieve worst-case additive error in parameter estimates. The scaling of this bound with $n$ is exponentially better than naïve strategies for characterizing Gaussian states and matches recently derived bounds for characterization of Gaussian states using continuous-variable (CV) classical shadows. In addition, our bound has a polynomially better dependence on the energy of the multimode Gaussian state compared to the CV shadows protocol.

quant-pharXiv:2605.05325•May 8, 2026•3 citations
Pattern recognition is a central topic in learning theory, with numerous applications such as voice and text recognition, image analysis and computer diagnosis. The statistical setup in classification is the following: we are given an i.i.d. training set ( X 1 , Y 1 ), ... , ( X n , Y n ), where X i represents a feature and Y i ∊{0, 1} is a label attached to that feature. The underlying joint distribution of ( X , Y ) is unknown, but we can learn about it from the training set, and we aim at devising low error classifiers f: X → Y used to predict the label of new incoming features. In this paper, we solve a quantum analogue of this problem, namely the classification of two arbitrary unknown mixed qubit states. Given a number of 'training' copies from each of the states, we would like to 'learn' about them by performing a measurement on the training set. The outcome is then used to design measurements for the classification of future systems with unknown labels. We found the asymptotically optimal classification strategy and show that typically it performs strictly better than a plug-in strategy, which consists of estimating the states separately and then discriminating between them using the Helstrom measurement. The figure of merit is given by the excess risk equal to the difference between the probability of error and the probability of error of the optimal measurement for known states. We show that the excess risk scales as n −1 and compute the exact constant of the rate.
A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an "estimate-and-discriminate" machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.
Suppose that three kinds of quantum systems are given in some unknown states $|f{〉}^{\ensuremath{\bigotimes}N},$ $|{g}_{1}{〉}^{\ensuremath{\bigotimes}K},$ and $|{g}_{2}{〉}^{\ensuremath{\bigotimes}K},$ and we want to decide which template state ∣g1〉|{g}_{1}〉∣g1​〉 or ∣g2〉,|{g}_{2}〉,∣g2​〉, each representing the feature of the pattern class C1{\mathcal{C}}_{1}C1​ or C2,{\mathcal{C}}_{2},C2​, respectively, is closest to the input feature state ∣f〉.|f〉.∣f〉. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1,K=1,K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process.
We develop a quantum learning scheme for binary discrimination of coherent states of light. This is a problem of technological relevance for the reading of information stored in a digital memory. In our setting, a coherent light source is used to illuminate a memory cell and retrieve its encoded bit by determining the quantum state of the reflected signal. We consider a situation where the amplitude of the states produced by the source is not fully known, but instead this information is encoded in a large training set comprising many copies of the same coherent state. We show that an optimal global measurement, performed jointly over the signal and the training set, provides higher successful identification rates than any learning strategy based on first estimating the unknown amplitude by means of Gaussian measurements on the training set, followed by an adaptive discrimination procedure on the signal. By considering a simplified variant of the problem, we argue that this is the case even for non-Gaussian estimation measurements. Our results show that, even in absence of entanglement, collective quantum measurements yield an enhancement in the readout of classical information, which is particularly relevant in the operating regime of low-energy signals.
We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not have at its disposal a complete classical description of the two template states, but can only have partial prior information about their level of purity and mutual overlap. Moreover, similarly to the classical supervised learning paradigm, we assume that the machine can be trained by n qubits prepared in the first template state and by n more qubits prepared in the second template state. In this situation, we are interested in the optimal process which correctly classifies the input qubit with the largest probability allowed by quantum mechanics. The problem is studied in its full generality for a number of different prior information scenarios and for an arbitrary size n of the training data. Finite size corrections around the asymptotic limit n → ∞ are derived. When the states are assumed to be pure, with known overlap, the problem is also solved in the case of d-level systems.
Quantum machine learning witnesses an increasing amount of quantum algorithms for data-driven decision making, a problem with potential applications ranging from automated image recognition to medical diagnosis. Many of those algorithms are implementations of quantum classifiers, or models for the classification of data inputs with a quantum computer. Following the success of collective decision making with ensembles in classical machine learning, this paper introduces the concept of quantum ensembles of quantum classifiers. Creating the ensemble corresponds to a state preparation routine, after which the quantum classifiers are evaluated in parallel and their combined decision is accessed by a single-qubit measurement. This framework naturally allows for exponentially large ensembles in which - similar to Bayesian learning - the individual classifiers do not have to be trained. As an example, we analyse an exponentially large quantum ensemble in which each classifier is weighed according to its performance in classifying the training data, leading to new results for quantum as well as classical machine learning.
Recent results have established dramatic advantages in learning properties of quantum states when a quantum computer is available to process or jointly measure multiple copies of the unknown quantum state. Learning tasks can be accomplished with exponentially fewer copies of the state when compared to optimized classical learning strategies that are restricted to measuring one copy of the state at a time. While these results were established in abstract settings and for artificial learning tasks, they motivate the application of quantum computers to imaging and sensing of weak electromagnetic fields since these settings are ultimately concerned with the learning of unknown quantum states. In this work we apply these new results in quantum learning to the problem of learning Gaussian states of the electromagnetic field, which are germane since they describe most fields used in imaging and sensing. In order to connect with quantum learning theory, we consider the transduction of an nnn-mode Gaussian state into a register of qubits on a quantum computer followed by optimized measurements on these qubits to extract the parameters defining the original Gaussian state. We rigorously bound the number of copies of the Gaussian state required to achieve worst-case additive error in parameter estimates. The scaling of this bound with nnn is exponentially better than naïve strategies for characterizing Gaussian states and matches recently derived bounds for characterization of Gaussian states using continuous-variable (CV) classical shadows. In addition, our bound has a polynomially better dependence on the energy of the multimode Gaussian state compared to the CV shadows protocol.