Entanglement assisted communication complexity measured by distinguishability
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915875823550464 |
|---|---|
| author | Manna, Satyaki Pandit, Ankush Saha, Debashis |
| author_facet | Manna, Satyaki Pandit, Ankush Saha, Debashis |
| contents | We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication, both classical and quantum, can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. We identify certain communication tasks that exhibit an advantage under entanglement assistance compared to classical communication. Through these results, we establish a connection between quantum communication and entanglement-assisted classical communication, and also show an equivalence between entanglement-assisted classical communication and entanglement-assisted quantum communication. We then consider the simplest scenarios in which the receiver has no input and demonstrate that entanglement-assisted strategies still offer advantages over both classical communication and quantum communication without prior entanglement. Finally, by constructing a class of communication tasks, we show that a non-maximally entangled state can, in some cases, be more useful than a maximally entangled state as a pre-shared resource. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_19105 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Entanglement assisted communication complexity measured by distinguishability Manna, Satyaki Pandit, Ankush Saha, Debashis Quantum Physics We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication, both classical and quantum, can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. We identify certain communication tasks that exhibit an advantage under entanglement assistance compared to classical communication. Through these results, we establish a connection between quantum communication and entanglement-assisted classical communication, and also show an equivalence between entanglement-assisted classical communication and entanglement-assisted quantum communication. We then consider the simplest scenarios in which the receiver has no input and demonstrate that entanglement-assisted strategies still offer advantages over both classical communication and quantum communication without prior entanglement. Finally, by constructing a class of communication tasks, we show that a non-maximally entangled state can, in some cases, be more useful than a maximally entangled state as a pre-shared resource. |
| title | Entanglement assisted communication complexity measured by distinguishability |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2603.19105 |