Programmable discrimination with an error margin

Abstract

The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed with a number of identically prepared qubits---the data and the programs. The device aims at correctly identifying the data state with one of the two program states. This scheme has the unambiguous and the minimum-error schemes as extremal cases, when the error margin is set to zero or it is sufficiently large, respectively. Analytical results are given in the two situations where the margin is imposed on the average error probability---weak condition---or it is imposed separately on the two probabilities of assigning the state of the data to the wrong program---strong condition. It is a general feature of our scheme that the success probability rises sharply as soon as a small error margin is allowed, thus providing a significant gain over the unambiguous scheme while still having high confidence results.

Published version, typos corrected. 8 pages, 3 figures

References in corpus (8)

• The Quantum Chernoff Bound
• The quantum Chernoff bound as a measure of distinguishability between density matrices: application to qubit and Gaussian states
• Local discrimination of mixed states
• State discrimination with error margin and its locality
• Optimal unambiguous discrimination of two subspaces as a case in mixed state discrimination
• Changepoint Problem in Quantumn Setting
• Unambiguous identification of coherent states II: Multiple resources
• Optimal parameter estimation with a fixed rate of abstention

Cited by in corpus (11)

• Machine learning \& artificial intelligence in the quantum domain
• Optimal quantum operations at zero energy cost
• Simultaneously sorting overlapping quantum states of light
• Resource Quantification for the No-Programming Theorem
• Optimal universal learning machines for quantum state discrimination
• Success probabilities for universal unambiguous discriminators between unknown pure states
• Parametric separation of symmetric pure quantum states
• An agnostic-Dolinar receiver for coherent states classification
• Optimal quantum state identification with qudit-encoded unknown states
• Optimal programmable unambiguous discriminator between two unknown latitudinal states
• Dealing with ignorance: universal discrimination, learning and quantum correlations