Pseudorandomness in the (Inverseless) Haar Random Oracle Model
Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin

TL;DR
This paper explores the feasibility of quantum pseudorandom objects in a Haar random oracle model, demonstrating the existence of certain pseudorandom unitaries and states with minimal oracle calls, and introducing new formal tools.
Contribution
It establishes the existence of bounded-query secure pseudorandom unitaries and states in the Haar model, and introduces the path recording formalism for analyzing Haar random unitaries.
Findings
Existence of pseudorandom unitaries with two oracle calls.
Impossibility of unbounded-query security with a single call.
Existence of bounded-query secure pseudorandom unitaries and state generators with a single call.
Abstract
We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary, have oracle access to the same Haar random unitary. In this model, we show the following: - (Unbounded-query secure) pseudorandom unitaries (PRU) exist. Moreover, the PRU construction makes two calls to the Haar oracle. - We consider constructions of PRUs making a single call to the Haar oracle. In this setting, we show that unbounded-query security is impossible to achieve. We complement this result by showing that bounded-query secure PRUs do exist with a single query to the Haar oracle. - We show that multi-copy pseudorandom state generators and function-like state generators (with classical query access), making a single call to the Haar oracle, exist. Our results have two consequences: (a) when the Haar random unitary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsadvanced mathematical theories
