Programmable discrimination with an error margin
arXiv:1308.1378 · doi:10.1103/PhysRevA.88.052304
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.
arXiv commentPublished version, typos corrected. 8 pages, 3 figures
References in corpus (17)
- The Quantum Chernoff Bound
- The quantum Chernoff bound as a measure of distinguishability between density matrices: application to qubit and Gaussian states
- A universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states
- Multiple copy 2-state discrimination with individual measurements
- Quantum multimeters: A programmable state discriminator
- Local discrimination of mixed states
- Optimal discrimination of quantum states with a fixed rate of inconclusive outcomes
- State discrimination with error margin and its locality
- Optimal unambiguous discrimination of two subspaces as a case in mixed state discrimination
- Discrimination with error margin between two states - Case of general occurrence probabilities -
- Multiple-copy state discrimination: Thinking globally, acting locally
- Quantum Metrology Assisted with Abstention
- Multi-copy programmable discrimination of general qubit states
- Changepoint Problem in Quantumn Setting
- Beating noise with abstention in state estimation
- Optimal parameter estimation with a fixed rate of abstention
- Unambiguous identification of coherent states II: Multiple resources
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