Abstract This paper, for the first time, addresses the questions related to the connections between quantum pseudorandomness and quantum hardware assumptions, specifically quantum physical unclonable functions (qPUFs). Our results show that efficient pseudorandom quantum states (PRS) are sufficient to construct the challenge set for universally unforgeable qPUFs, improving the previous existing constructions based on the Haar-random states. We also show that both the qPUFs and the quantum pseudorandom unitaries (PRUs) can be constructed from each other, providing new ways to obtain PRS from the hardware assumptions. Moreover, we provide a sufficient condition (in terms of the diamond norm) that a set of unitaries should have to be a PRU in order to construct a universally unforgeable qPUF, giving yet another novel insight into the properties of the PRUs. Later, as an application of our results, we show that the efficiency of an existing qPUF-based client–server identification protocol can be improved without losing the security requirements of the protocol.

中文翻译：

---

论量子伪随机性与量子硬件假设之间的联系

摘要 本文首次解决了与量子伪随机性和量子硬件假设之间的联系相关的问题，特别是量子物理不可克隆函数（qPUFs）。我们的结果表明，有效的伪随机量子态 (PRS) 足以为普遍不可伪造的 qPUF 构建挑战集，从而改进了先前基于 Haar 随机态的现有构造。我们还表明，qPUF 和量子伪随机酉 (PRU) 都可以相互构建，从而提供了从硬件假设中获得 PRS 的新方法。此外，我们提供了一个充分条件（根据菱形范数），一组幺正必须是 PRU 才能构造一个普遍不可伪造的 qPUF，对 PRU 的属性提供了另一种新颖的见解。后来，作为我们结果的应用，我们展示了现有的基于 qPUF 的客户端-服务器识别协议的效率可以在不失去协议的安全要求的情况下得到提高。