Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2508.05050 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918176902610944 |
|---|---|
| author | Ha, Donghoon Kim, Jeong San |
| author_facet | Ha, Donghoon Kim, Jeong San |
| contents | We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC), and provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be factorized into that of each individual ensemble. In other words, the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be achieved just by performing optimal LOCC discrimination independently at each step of the quantum sequence. We also illustrate through examples of multi-party quantum states that such factorizability of optimal LOCC discrimination is possible. We further establish a necessary and sufficient condition under which the optimal LOCC discrimination of a multi-party quantum state ensemble can be realized just by guessing the state with the largest probability. Our results can provide a useful application to investigate the fundamental limits of quantum data hiding. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_05050 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Factorizability of multi-party quantum sequence discrimination under local operations and classical communication Ha, Donghoon Kim, Jeong San Quantum Physics We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC), and provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be factorized into that of each individual ensemble. In other words, the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be achieved just by performing optimal LOCC discrimination independently at each step of the quantum sequence. We also illustrate through examples of multi-party quantum states that such factorizability of optimal LOCC discrimination is possible. We further establish a necessary and sufficient condition under which the optimal LOCC discrimination of a multi-party quantum state ensemble can be realized just by guessing the state with the largest probability. Our results can provide a useful application to investigate the fundamental limits of quantum data hiding. |
| title | Factorizability of multi-party quantum sequence discrimination under local operations and classical communication |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.05050 |