通过CHSH博弈的刚性实现量子系统的经典控制
Classical command of quantum systems via rigidity of CHSH games
摘要：
一个经典系统能指挥一个一般的对抗性量子系统实现任意的量子动力学吗？如果是这样的话，那么我们就可以实现设备无关的量子密码学的梦想：使用不可信的量子设备来建立一个共享的随机密钥，其安全性基于量子力学的正确性。它还允许测试声称的量子计算机是否是真正的量子计算机。在这里，我们报告了一种技术，通过该技术，经典系统可以证明一个二分量子系统的联合，纠缠态，以及命令在每个子系统上应用特定的运营商。这是通过展示与Tsirelson对Clauser-Horne-Shimony-Holt（CHSH）游戏的最优性结果的强烈逆来实现的：赢得许多游戏的唯一方法是如果二分态接近EPR态的张量积，并且测量是连续量子比特上的最优CHSH测量。这直接导致了设备无关的量子密钥分发方案。对状态和算子的控制也可以被用来创建更精细的协议，以可靠地实现通用量子线路。
英文摘要：
Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryptography: using untrusted quantum devices to establish a shared random key, with security based on the correctness of quantum mechanics. It would also allow for testing whether a claimed quantum computer is truly quantum. Here we report a technique by which a classical system can certify the joint, entangled state of a bipartite quantum system, as well as command the application of specific operators on each subsystem. This is accomplished by showing a strong converse to Tsirelson's optimality result for the Clauser-Horne-Shimony-Holt (CHSH) game: the only way to win many games is if the bipartite state is close to the tensor product of EPR states, and the measurements are the optimal CHSH measurements on successive qubits. This leads directly to a scheme for device-independent quantum key distribution. Control over the state and operators can also be leveraged to create more elaborate protocols for reliably realizing general quantum circuits.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
