2 papers
quant-ph2026
Optimal and Verifiable Quantum Advantages in Communication Complexity
Ryan Anselm, Michelle Ding, Dar Gilboa +1
We establish optimal quantum-classical separations in communication complexity for search problems. We introduce a total search problem called Pelagic Fourier Fishing and show that…
quant-ph2026
An exponential separation between entanglement-assisted and unassisted one-way quantum communication
Ryan Anselm, Srijita Kundu, Olivier Lalonde +1
A longstanding question in quantum communication complexity is whether some task can be accomplished with a small amount of communication in the presence of entanglement, yet requi…