dorsal/arxiv
View SchemaOptimal universal programmable detectors for unambiguous discrimination
| Authors | Chi Zhang, Mingsheng Ying, Bo Qiao |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0512029 |
| URL | https://arxiv.org/abs/quant-ph/0512029 |
| DOI | 10.1103/PhysRevA.74.042308 |
| Journal | Phys. Rev. A, 74, 042308, 2006 |
Abstract
We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the data register. The quantum state in the data register is what users want to identify, which is confirmed to be among the n states in program registers. The task of the discriminator is to tell the users which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if $m=n$, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary n quantum states.
{
"annotation_id": "691dc47f-e6a5-4ecf-89e9-a27e48416a7b",
"date_created": "2026-03-02T18:02:23.721000Z",
"date_modified": "2026-03-02T18:02:23.721000Z",
"file_hash": "304e6f2090611efc3e8eabf8d55473d17e531d65a2ac19691356bf82599c9cbc",
"private": false,
"record": {
"abstract": "We discuss the problem of designing unambiguous programmable discriminators\nfor any n unknown quantum states in an m-dimensional Hilbert space. The\ndiscriminator is a fixed measurement that has two kinds of input registers: the\nprogram registers and the data register. The quantum state in the data register\nis what users want to identify, which is confirmed to be among the n states in\nprogram registers. The task of the discriminator is to tell the users which\nstate stored in the program registers is equivalent to that in the data\nregister. First, we give a necessary and sufficient condition for judging an\nunambiguous programmable discriminator. Then, if $m=n$, we present an optimal\nunambiguous programmable discriminator for them, in the sense of maximizing the\nworst-case probability of success. Finally, we propose a universal unambiguous\nprogrammable discriminator for arbitrary n quantum states.",
"arxiv_id": "quant-ph/0512029",
"authors": [
"Chi Zhang",
"Mingsheng Ying",
"Bo Qiao"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.74.042308",
"journal_ref": "Phys. Rev. A, 74, 042308, 2006",
"title": "Optimal universal programmable detectors for unambiguous discrimination",
"url": "https://arxiv.org/abs/quant-ph/0512029"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "4d75343a-0fe5-48c4-bfa7-33e455c44d77",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}