50 citations · 140 across the 23 of their papers we have counts for
4 papers · 2 filters
Does Not Relativize
Adam Bouland, Andrew Huang, Anand Natarajan +2
We construct an oracle relative to which , resolving a long-standing open question in quantum complexity theory. Together with recent work d…
Unconditional Certified Randomness without Structure
Andrea Coladangelo, Dakshita Khurana, Saachi Mutreja +3
We obtain a certified randomness protocol in the quantum random oracle model. The protocol is non-interactive and publicly verifiable with a classical verifier, and is based on Yam…
Certified Randomness without Structure Against Shallow-Query Adversaries
Dakshita Khurana, Bhaskar Roberts, Avishay Tal
In a recent breakthrough, Yamakawa and Zhandry (J. ACM 2024) constructed a proof of quantumness in the quantum random oracle model (QROM) in which the quantum prover samples a code…
A Relativizing MIP for BQP
Scott Aaronson, Anand Natarajan, Avishay Tal +1
Complexity class containments involving interactive proof classes are famously nonrelativizing: although , Fortnow and Sipser showed that that there…