Optimal discrimination of quantum sequences
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917883456520192 |
|---|---|
| author | Gupta, Tathagata Murshid, Shayeef Russo, Vincent Bandyopadhyay, Somshubhro |
| author_facet | Gupta, Tathagata Murshid, Shayeef Russo, Vincent Bandyopadhyay, Somshubhro |
| contents | A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely, quantum sequence discrimination, appears in various quantum information processing tasks, the objective being to determine the state of a finite sequence of quantum states. Since such a sequence is a composite quantum system, the fundamental question is whether an optimal measurement is local, i.e., comprising measurements on the individual members, or collective, i.e. requiring joint measurement(s). In some known instances of this problem, the optimal measurement is local, whereas in others, it is collective. But, so far, a definite prescription based solely on the problem description has been lacking. In this paper, we prove that if the members of a given sequence are drawn secretly and independently from an ensemble or even from different ensembles, the optimum success probability is achievable by fixed local measurements on the individual members of the sequence, and no collective measurement is necessary. This holds for both minimum-error and unambiguous state discrimination paradigms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_08705 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal discrimination of quantum sequences Gupta, Tathagata Murshid, Shayeef Russo, Vincent Bandyopadhyay, Somshubhro Quantum Physics A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely, quantum sequence discrimination, appears in various quantum information processing tasks, the objective being to determine the state of a finite sequence of quantum states. Since such a sequence is a composite quantum system, the fundamental question is whether an optimal measurement is local, i.e., comprising measurements on the individual members, or collective, i.e. requiring joint measurement(s). In some known instances of this problem, the optimal measurement is local, whereas in others, it is collective. But, so far, a definite prescription based solely on the problem description has been lacking. In this paper, we prove that if the members of a given sequence are drawn secretly and independently from an ensemble or even from different ensembles, the optimum success probability is achievable by fixed local measurements on the individual members of the sequence, and no collective measurement is necessary. This holds for both minimum-error and unambiguous state discrimination paradigms. |
| title | Optimal discrimination of quantum sequences |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2409.08705 |