Efficient implementation of standard cryptographic primitives without auxiliary space
Determine whether standard cryptographic primitives, in particular keyed pseudorandom permutations, can be implemented efficiently without auxiliary qubits beyond the key and input registers.
References
Without auxiliary space, it is unclear whether standard cryptographic primitives can be implemented efficiently.
— Computational Work Extraction: The Complexity of Catalysts
(2609.40323 - Arora et al., 30 Sep 2026) in Section 5, “Catalytic Computation,” immediately following Problem 1 (in-place permutations)
While we formulate the required tweakable in-place qPRP security as an explicit assumption, an efficient construction achieving this guarantee from standard assumptions remains to be established.
— Function-like pseudorandom unitaries generate pseudorandom quantum processes
(2610.01038 - Xu et al., 1 Oct 2026) in Section 6, Discussion and outlook