dorsal/arxiv
View SchemaOptimal unambiguous filtering of a quantum state: An instance in mixed state discrimination
| Authors | Janos Bergou, Ulrike Herzog, Mark Hillery |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0504138 |
| URL | https://arxiv.org/abs/quant-ph/0504138 |
| DOI | 10.1103/PhysRevA.71.042314 |
| Journal | Physical Review A 71, 042314 (2005) |
Abstract
Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e. allow for inconclusive outcomes to occur, then unambiguous discrimination becomes possible with a certain probability of success. A variant of the problem is set discrimination: the states are grouped in sets and we want to determine to which particular set a given pure input state belongs. We consider here the simplest case, termed quantum state filtering, when the $N$ given non-orthogonal states, $\{|\psi_{1} >,..., |\psi_{N} > \}$, are divided into two sets and the first set consists of one state only while the second consists of all of the remaining states. We present the derivation of the optimal measurement strategy, in terms of a generalized measurement (POVM), to distinguish $|\psi_1>$ from the set $\{|\psi_2 >,...,|\psi_N > \}$ and the corresponding optimal success and failure probabilities. The results, but not the complete derivation, were presented previously [\prl {\bf 90}, 257901 (2003)] as the emphasis there was on appplication of the results to novel probabilistic quantum algorithms. We also show that the problem is equivalent to the discrimination of a pure state and an arbitrary mixed state.
{
"annotation_id": "ffc7b589-ede6-4659-86d8-975d164998b5",
"date_created": "2026-03-02T18:02:16.800000Z",
"date_modified": "2026-03-02T18:02:16.800000Z",
"file_hash": "5905c8407bb04e001bac038c9d67980098be92679e1b10dbb585043cc6be7310",
"private": false,
"record": {
"abstract": "Deterministic discrimination of nonorthogonal states is forbidden by quantum\nmeasurement theory. However, if we do not want to succeed all the time, i.e.\nallow for inconclusive outcomes to occur, then unambiguous discrimination\nbecomes possible with a certain probability of success. A variant of the\nproblem is set discrimination: the states are grouped in sets and we want to\ndetermine to which particular set a given pure input state belongs. We consider\nhere the simplest case, termed quantum state filtering, when the $N$ given\nnon-orthogonal states, $\\{|\\psi_{1} \u003e,..., |\\psi_{N} \u003e \\}$, are divided into\ntwo sets and the first set consists of one state only while the second consists\nof all of the remaining states. We present the derivation of the optimal\nmeasurement strategy, in terms of a generalized measurement (POVM), to\ndistinguish $|\\psi_1\u003e$ from the set $\\{|\\psi_2 \u003e,...,|\\psi_N \u003e \\}$ and the\ncorresponding optimal success and failure probabilities. The results, but not\nthe complete derivation, were presented previously [\\prl {\\bf 90}, 257901\n(2003)] as the emphasis there was on appplication of the results to novel\nprobabilistic quantum algorithms. We also show that the problem is equivalent\nto the discrimination of a pure state and an arbitrary mixed state.",
"arxiv_id": "quant-ph/0504138",
"authors": [
"Janos Bergou",
"Ulrike Herzog",
"Mark Hillery"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.71.042314",
"journal_ref": "Physical Review A 71, 042314 (2005)",
"title": "Optimal unambiguous filtering of a quantum state: An instance in mixed state discrimination",
"url": "https://arxiv.org/abs/quant-ph/0504138"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7885ae96-561d-41fa-9ccc-5c34fd70226b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}