Author

Ryan A. Anselm

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Optimal and Verifiable Quantum Advantages in Communication Complexity

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 it admits an $n$-qubit quantum one-way protocol, whereas every randomized two-way protocol requires $\Omega(2^n)$ bits of communication. We...

Ryan A. Anselm, Michelle Ding, D. Gilboa et al. · 0 citations

Preprint Oct 2026

An exponential separation between entanglement-assisted and unassisted one-way quantum communication

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 require much more quantum communication in the absence of entanglement. Separations of this nature were previously known for relational problems...

Ryan A. Anselm, Srijita Kundu, Olivier Lalonde et al. · 0 citations