33 citations · 36 across the 6 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
quant-ph2026
XOR Games at Full Tilt: The Hardness of Binary Nonlocal Games
Richard Cleve, Eric Culf, Aviv Taller
It is well known that the quantum value of an XOR nonlocal game, where the winning condition depends only on the XOR of the two players' output bits, may be approximated in polynom…
cs.CC2026
Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
Vahid R. Asadi, Richard Cleve
The Tree Evaluation Problem () is a computational problem originally proposed as a candidate to prove a separation between complexity classes and $\…
quant-ph2026
Lower bounds on non-local computation from controllable correlation
Richard Cleve, Alex May
Understanding entanglement cost in non-local quantum computation (NLQC) is relevant to complexity, cryptography, gravity, and other areas. This entanglement cost is largely unchara…