限制相对论量子任务的可行性
Constraining the doability of relativistic quantum tasks
摘要：
我们在相对论量子任务的框架内表明，任何任务的可行性完全取决于其参数的一个小子集，我们称之为“粗糙的因果结构”，以及它旨在完成的分布式计算。我们通过使用称为时空电路的结构来严格定义协议的概念来做到这一点，时空电路描述了计算如何在时空区域内进行。使用时空电路，我们表明，任何协议，可以完成一个给定的任务，而不改变它的可行性，进行重大的几何修改，如改变背景时空和移动的位置的输入和输出点，只要粗糙的因果结构的任务是保持。除了提供一个强大的工具来确定一个任务的可行性，我们的研究结果加强了基于位置的量子密码学的不去定理，包括任意发送和接收信号的验证区域以外的验证代理。它们也可以作为全息原理的一致性检验，表明体积和边界因果结构之间的差异不会导致一项任务在一个地方可行而在另一个地方不可行。
英文摘要：
We show within the framework of relativistic quantum tasks that the doability of any task is fully determined by a small subset of its parameters that we call its "coarse causal structure", as well as the distributed computation it aims to accomplish. We do this by making rigorous the notion of a protocol using a structure known as a spacetime circuit, which describes how a computation is preformed across a region of spacetime. Using spacetime circuits we show that any protocol that can accomplish a given task can, without changing its doability, undergo significant geometric modifications such as changing the background spacetime and moving the location of input and output points, so long as the coarse causal structure of the task is maintained. Besides giving a powerful tool for determining the doability of a task, our results strengthen the no-go theorem for position based quantum cryptography to include arbitrary sending and receiving of signals by verifier agents outside the authentication region. They also serve as a consistency check for the holographic principle by showing that discrepancies between bulk and boundary causal structure can not cause a task to be doable in one but not the other.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
