1 citations · 1 across the 1 of their papers we have counts for
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…
cs.AI2024★ 1 cited
PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition
George Tsoukalas, Jasper Lee, John Jennings +5
We present PutnamBench, a new multi-language benchmark for evaluating the ability of neural theorem-provers to solve competition mathematics problems. PutnamBench consists of 1692…