Quantum Communication Advantage in TFNP
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913705293250560 |
|---|---|
| author | Göös, Mika Gur, Tom Jain, Siddhartha Li, Jiawei |
| author_facet | Göös, Mika Gur, Tom Jain, Siddhartha Li, Jiawei |
| contents | We exhibit a total search problem with classically verifiable solutions whose communication complexity in the quantum SMP model is exponentially smaller than in the classical two-way randomized model. Our problem is a bipartite version of a query complexity problem recently introduced by Yamakawa and Zhandry (JACM 2024). We prove the classical lower bound using the structure-vs-randomness paradigm for analyzing communication protocols. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_03296 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum Communication Advantage in TFNP Göös, Mika Gur, Tom Jain, Siddhartha Li, Jiawei Quantum Physics Computational Complexity We exhibit a total search problem with classically verifiable solutions whose communication complexity in the quantum SMP model is exponentially smaller than in the classical two-way randomized model. Our problem is a bipartite version of a query complexity problem recently introduced by Yamakawa and Zhandry (JACM 2024). We prove the classical lower bound using the structure-vs-randomness paradigm for analyzing communication protocols. |
| title | Quantum Communication Advantage in TFNP |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2411.03296 |