[Resource Topic] 2024/487: Real-Valued Somewhat-Pseudorandom Unitaries

Welcome to the resource topic for 2024/487

Real-Valued Somewhat-Pseudorandom Unitaries

Authors: Zvika Brakerski, Nir Magrafta


We explore a very simple distribution of unitaries: random (binary) phase – Hadamard – random (binary) phase – random computational-basis permutation.
We show that this distribution is statistically indistinguishable from random Haar unitaries for any polynomial set of orthogonal input states (in any basis) with polynomial multiplicity.
This shows that even though real-valued unitaries cannot be completely pseudorandom (Haug, Bharti, Koh, arXiv:2306.11677), we can still obtain some pseudorandom properties without giving up on the simplicity of a real-valued unitary.

Our analysis shows that an even simpler construction: applying a random (binary) phase followed by a random computational-basis permutation, would suffice, assuming that the input is orthogonal and flat (that is, has high min-entropy when measured in the computational basis).

Using quantum-secure one-way functions (which imply quantum-secure pseudorandom functions and permutations), we obtain an efficient cryptographic instantiation of the above.

ePrint: https://eprint.iacr.org/2024/487

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .