Pseudorandom unitaries with non-adaptive security

ePrint Report: Pseudorandom unitaries with non-adaptive security

Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen

Pseudorandom unitaries (PRUs) are ensembles of efficiently implementable unitary operators that cannot be distinguished from Haar random unitaries by any quantum polynomial-time algorithm with query access to the unitary. We present a simple PRU construction that is a concatenation of a random Clifford unitary, a pseudorandom binary phase operator, and a pseudorandom permutation operator. We prove that this PRU construction is secure against non-adaptive distinguishers …

access algorithm construction eprint report non operators quantum query random report security simple