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 codeword preimage of a publicly computable function H. They conjectured that given any H, a successful prover must sample their preimage from a...
We construct an oracle relative to which $\mathsf{BQP} \not\subseteq \mathsf{IP}$, resolving a long-standing open question in quantum complexity theory. Together with recent work due to Aaronson et al., our work also gives the first oracle separation between $\mathsf{IP}$ and $\mathsf{MIP}$, answering a question dating...
Adam Bouland, Andrew Huang, Anand Natarajan et al.· 0 citations
A certified randomness protocol in the quantum random oracle model is obtained that proves unconditional security of this protocol against adversaries making subexponentially-many adaptive quantum queries to the random oracle.
A. Coladangelo, Dakshita Khurana, Saachi Mutreja et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.