dorsal/arxiv
View SchemaHow many copies are needed for state discrimination?
| Authors | Aram W. Harrow, Andreas Winter |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0606131 |
| URL | https://arxiv.org/abs/quant-ph/0606131 |
| DOI | 10.1109/TIT.2011.2169544 |
| Journal | IEEE Trans. Inf. Th., vol. 58, no. 1, pp. 1-2, Jan 2012 |
Abstract
Given a collection of states (rho_1, ..., rho_N) with pairwise fidelities F(rho_i, rho_j) <= F < 1, we show the existence of a POVM that, given rho_i^{otimes n}, will identify i with probability >= 1-epsilon, as long as n>=2(log N/eps)/log (1/F). This improves on previous results which were either dimension-dependent or required that i be drawn from a known distribution.
{
"annotation_id": "20ca8a58-08ec-4cb9-9c65-fdf3467c6ce0",
"date_created": "2026-03-02T18:02:27.716000Z",
"date_modified": "2026-03-02T18:02:27.716000Z",
"file_hash": "949ad5450f17ede7ec2a0247185b2b4fb74d1591dab67f887f74f379d20a9cbf",
"private": false,
"record": {
"abstract": "Given a collection of states (rho_1, ..., rho_N) with pairwise fidelities\nF(rho_i, rho_j) \u003c= F \u003c 1, we show the existence of a POVM that, given\nrho_i^{otimes n}, will identify i with probability \u003e= 1-epsilon, as long as\nn\u003e=2(log N/eps)/log (1/F). This improves on previous results which were either\ndimension-dependent or required that i be drawn from a known distribution.",
"arxiv_id": "quant-ph/0606131",
"authors": [
"Aram W. Harrow",
"Andreas Winter"
],
"categories": [
"quant-ph"
],
"doi": "10.1109/TIT.2011.2169544",
"journal_ref": "IEEE Trans. Inf. Th., vol. 58, no. 1, pp. 1-2, Jan 2012",
"title": "How many copies are needed for state discrimination?",
"url": "https://arxiv.org/abs/quant-ph/0606131"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fc2b368c-d562-4d18-bed6-d2c868aeacbd",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}