Paper 2026/1206

Scalable, quantum-accessible, and adaptive pseudorandom quantum state and pseudorandom function-like quantum state generators

Zhili Chen, Centre for Quantum Technologies, Singapore, National University of Singapore

Rahul Jain, Centre for Quantum Technologies, Singapore, National University of Singapore, MajuLab, UMI 3654, Singapore

YaoNan Zhang, Centre for Quantum Technologies, Singapore, National University of Singapore

Abstract

We show new constructions for pseudorandom quantum states (PRS) and pseudorandom function-like quantum state (PRFS) generators satisfying scalability, which means the security parameter can be much larger than the number of qubits, quantum accessibility, which means the adversary can provide quantum input, and adaptivity, which means the adversary can query it adaptively. We present an isometric procedure to prepare quantum states that can be arbitrarily random (i.e., the trace distance from the Haar-random state can be arbitrarily small for the true random case, or the distinguishing advantage can be arbitrarily small for the pseudorandom case). This naturally gives the first construction for scalable, quantum-accessible, and adaptive PRFS assuming quantum-secure one-way functions. Compared to prior PRFS works, we use a stronger definition of quantum accessibility in which the adversary can be ancilla-assisted, i.e., the input state may not be pure and could be entangled with other quantum registers. Thus, our result also gives the first (fully) quantum-accessible PRFS. Our PRFS construction implies various primitives, including long-input PRFS, short-input PRFS, short-output PRFS, non-adaptive PRFS, and classically-accessible adaptive PRFS. This new construction may be helpful in simplifying the microcrypt zoo.

@misc{cryptoeprint:2026/1206,
      author = {Rishabh Batra and Zhili Chen and Rahul Jain and YaoNan Zhang},
      title = {Scalable, quantum-accessible, and adaptive pseudorandom quantum state and pseudorandom function-like quantum state generators},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1206},
      year = {2026},
      doi = {10.1007/978-3-032-35409-9_8},
      url = {https://eprint.iacr.org/2026/1206}
}