Impossible to efficiently build any quantum unitary with random functions

Random-Oracle Unitary Synthesis is Impossible

Computational Complexity

Summary

A key question in quantum computing is whether any quantum operation (unitary) can be efficiently created if you have access to any classical function used in a quantum way. The authors study a version of this problem where the operation is chosen randomly and show that it cannot be done efficiently. They also prove that some previously hoped-for scalable quantum operations called pseudorandom unitaries cannot be realized under this approach. However, they find a way to build certain simpler quantum operations more efficiently than before.

What this means in practice

  • For quantum algorithm designers: Understand fundamental limits on efficiently implementing arbitrary quantum operations when using random classical functions.
  • For quantum hardware engineers: Know which classes of quantum operations cannot be produced efficiently with access to random classical oracles, informing hardware and compiler design.

A theory result. No direct application yet.

Authors

Andrew Huang, Akshar Ramkumar, John Wright

Abstract

A major open problem in quantum complexity is the question of unitary synthesis---namely, is it possible to efficiently implement any unitary, given the ability to evaluate any classical function in superposition? Inspired by a recent work by Brakerski and Yuen (CRYPTO 2026), we propose an ``average-case'' unitary synthesis problem, which asks whether it is possible to efficiently implement a Haar random unitary given access to a random Boolean function. We then demonstrate a superpolynomial query lower bound, establishing that unitary synthesis in this model is impossible. Along with our main result, we settle in the negative a question Brakerski and Yuen pose, of whether scalable pseudorandom unitaries (PRUs) can be implemented in the ROM-PRU model. In particular, we show that in the ROM-PRU model, no $Ω(N^{1+γ})$ unitary design on $n$ qubits, where $N=2^n$, can be efficiently achieved for any $γ> 0$. On the other hand, we construct an $O(N)$-design in $\text{poly}(n)$ queries in the same model, surpassing the previously best known results which constructed $O(\sqrt{N})$-designs.