允许有限经典通信的自检图状态
Self-Testing Graph States Permitting Bounded Classical Communication
AI总结：
本研究在允许有限经典通信的情况下开发了图状态的自检方法，并展示了特定图状态在通信允许下的稳健自检能力，同时提供了从较大图状态中自检的程序。
摘要：
自检用于识别表现出非局部性的量子态和关联，将它们与其它量子态区分开来，除了局部变换之外。由于其强烈的非局部性，已知在标准设置下（即参与者不允许通信的情况下）所有图状态都可以被自检。最近的研究表明，即使在允许底层图上有限经典通信的情况下，图状态仍然表现出非局部关联，这一特性在证明经典计算与量子计算的电路深度分离中找到了应用。在本工作中，我们开发了在有限经典通信框架下的自检方法，并展示了某些图状态即使允许通信也可以稳健地被自检。特别是，我们为环状图状态和蜂窝状簇状态提供了明确的自检方法——后者已知是基于测量的量子计算的通用资源。由于通信通常会阻碍图状态的自检，我们进一步提供了一种从较大的、在通信场景中表现出非局部关联的图状态中稳健地自检任何图状态的程序。
英文摘要：
Self-testing identifies quantum states and correlations that exhibit nonlocality, distinguishing them, up to local transformations, from other quantum states. Due to their strong nonlocality, it is known that all graph states can be self-tested in the standard setting - where parties are not allowed to communicate. Recently it has been shown that graph states display nonlocal correlations even when bounded classical communication on the underlying graph is permitted, a feature that has found applications in proving a circuit-depth separation between classical and quantum computing. In this work, we develop self testing in the framework of bounded classical communication, and we show that certain graph states can be robustly self-tested even allowing for communication. In particular, we provide an explicit self-test for the circular graph state and the honeycomb cluster state - the latter known to be a universal resource for measurement based quantum computation. Since communication generally obstructs self-testing of graph states, we further provide a procedure to robustly self-test any graph state from larger ones that exhibit nonlocal correlations in the communication scenario.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
