The advantage of quantum protocols lies in the inherent properties of the shared quantum states. These states are sometimes provided by sources that are not trusted, and therefore need to be verified. Finding secure and efficient quantum state verification protocols remains a big challenge, and recent works illustrate trade-offs between efficiency and security for different groups of states in restricted settings. However, whether a universal trade-off exists for all quantum states and all verification strategies remains unknown. In this work, we instantiate the categorical composable cryptography framework to show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. Our findings show that the prevailing cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient and secure.

翻译：量子协议的优势源于共享量子态的内在特性。这些量子态有时由不可信源提供，因此需要进行验证。寻找安全且高效的量子态验证协议仍是一项重大挑战，近期研究揭示了在受限场景下针对不同态类时效率与安全性之间的权衡关系。然而，对于所有量子态及所有验证策略是否存在普适性权衡仍属未知。本研究通过实例化范畴组合密码学框架，证明了任意量子态验证中所有“切分-选择”方法存在根本性局限。我们的结果表明，当前主流的切分-选择技术无法同时实现高效与安全的量子态验证协议。