Optimal universal learning machines for quantum state discrimination

Abstract

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\to \infty$ are also 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 comment15 pages without appendix (total 19), 5 figures, typos corrected, added plots, new results on the d-level system case, new noise simulations with QISKit Aer

References in corpus (16)

• Quantum Machine Learning
• An introduction to quantum machine learning
• Quantum machine learning: a classical perspective
• Spin flips and quantum information for anti-parallel spins
• Efficient use of quantum resources for the transmission of a reference frame
• Quantum learning and universal quantum matching machine
• A universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states
• Quantum Template Matching
• Collective versus local measurements on two parallel or antiparallel spins
• Quantum pure-state identification
• Unambiguous pure state identification without classical knowledge
• Inductive supervised quantum learning
• Quantum learning of coherent states
• Multi-copy programmable discrimination of general qubit states
• Programmable discrimination with an error margin
• Joint probability distributions for projection probabilities of random orthonormal states

Cited by in corpus (13)

• Unsupervised classification of quantum data
• Real-time calibration of coherent-state receivers: learning by trial and error
• Statistical Complexity of Quantum Learning
• An agnostic-Dolinar receiver for coherent states classification
• Quantum State Discrimination on Reconfigurable Noise-Robust Quantum Networks
• Optimal quantum discrimination of single-qubit unitary gates between two candidates
• Universal algorithms for quantum data learning
• Quantum Edge Detection
• Quantum Stochastic Walk Models for Quantum State Discrimination
• Quantum circuit-like learning: A fast and scalable classical machine-learning algorithm with similar performance to quantum circuit learning
• Quantum clustering and jet reconstruction at the LHC
• Constructing a qubit POVM from quantum data
• State learning from pairs of states