3 papers
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…
quant-ph2025
Improved Clifford operations in constant commutative depth
Richard Cleve, Zhiqian Ding, Luke Schaeffer
The commutative depth model allows gates that commute with each other to be performed in parallel. We show how to compute Clifford operations in constant commutative depth more eff…