Quantum pseudorandom states differ fundamentally from pseudorandom unitaries
Derivatives of Quantum Randomness: Separating Pseudorandom Unitaries from Pseudorandom (Function-like) States
Summary
Quantum computers can create special random-like objects called pseudorandom states and pseudorandom unitaries, which are important for cryptography and computing. This paper finds that the strongest forms of pseudorandomness for quantum states do not automatically give you the simplest forms of pseudorandomness for quantum unitaries, even if you have a lot of extra resources. The authors use a new idea of studying changes (derivatives) in how these quantum operations work to prove this difference. This shows a basic separation between two kinds of quantum pseudorandomness that was not clear before.
What this means in practice
- •For quantum cryptography engineers: Clarify the limits of generating quantum pseudorandom unitaries from pseudorandom state sources to ensure secure protocol design.
- •For quantum algorithm designers: Identify that certain pseudorandom quantum states cannot be converted into pseudorandom unitaries, guiding algorithmic resource choices.
A theory result. No direct application yet.