量子望远镜时钟游戏
Quantum Telescopy Clock Games
摘要：
我们认为时钟游戏制定的量子信息理论的框架内的任务，可以用来改善现有的计划的量子增强复制。学习恒星光子何时到达望远镜的问题被转化为一个抽象的游戏，我们称之为时钟游戏。提供了一种获胜策略，该策略涉及执行量子非破坏测量，该测量验证光子占据了哪些恒星时空模式，而不干扰相位信息。我们证明紧的纠缠成本上的下限需要赢得时钟游戏，与必要的纠缠位的数量等于被区分的时间箱的数量。这种纠缠成本的下限适用于任何旨在通过本地测量非破坏性地提取入射光子的时间仓信息的复制协议，我们的结果表明Khabiboulline等人的协议[ \text{Phys. Rev. Lett.} 123，70504（2019）]在纠缠消耗方面是最佳的。相位提取的全部任务也被认为是，我们表明，恒星相位的量子费舍尔信息可以实现本地测量和共享纠缠，而不需要非线性光学操作。随着辅助量子比特数量的增加，最佳相位测量渐近地实现，而如果允许非线性操作，则需要单个量子比特对。
英文摘要：
We consider the clock game-a task formulated in the framework of quantum information theory-that can be used to improve the existing schemes of quantum-enhanced telescopy. The problem of learning when a stellar photon reaches a telescope is translated into an abstract game, which we call the clock game. A winning strategy is provided that involves performing a quantum non-demolition measurement that verifies which stellar spatio-temporal modes are occupied by a photon without disturbing the phase information. We prove tight lower bounds on the entanglement cost needed to win the clock game, with the amount of necessary entangled bits equaling the number of time-bins being distinguished. This lower bound on the entanglement cost applies to any telescopy protocol that aims to non-destructively extract the time-bin information of an incident photon through local measurements, and our result implies that the protocol of Khabiboulline et al. [\text{Phys. Rev. Lett.} 123, 70504 (2019)] is optimal in terms of entanglement consumption. The full task of the phase extraction is also considered, and we show that the quantum Fisher information of the stellar phase can be achieved by local measurements and shared entanglement without the necessity of nonlinear optical operations. The optimal phase measurement is achieved asymptotically with increasing number of ancilla qubits, whereas a single qubit pair is required if nonlinear operations are allowed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
