This paper, for the first time, addresses the questions related to the connections between the quantum pseudorandomness and quantum hardware assumptions, specifically quantum physical unclonable functions (qPUFs). Our results show that the efficient pseudorandom quantum states (PRS) are sufficient to construct the challenge set for the universally unforgeable qPUF, improving the previous existing constructions that are 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-random国家的现有建筑。我们还表明,qPUFs和量子假冒单位(PRUs)可以相互建立,为从硬件假设中获得PRS提供了新的途径。此外,我们提供了一种充分的条件(根据钻石规范),即一套单位必须是一个PRU,才能构建一个普遍不可救药的qPUF,从而对PRUs的特性提出新的见解。 之后,作为我们应用的结果,我们表明,在不丧失协议的安全要求的情况下,可以提高基于qPUF的客户-服务器识别协议的效率。