Quantum Communication Advantage in TFNP
Quantum Physics
2025-02-26 v2 Computational Complexity
Abstract
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.
Cite
@article{arxiv.2411.03296,
title = {Quantum Communication Advantage in TFNP},
author = {Mika Göös and Tom Gur and Siddhartha Jain and Jiawei Li},
journal= {arXiv preprint arXiv:2411.03296},
year = {2025}
}