论文标题
具有量子对抗求解器的有效的两分纠缠检测方案
Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver
论文作者
论文摘要
当没有事先信息可用时，对纠缠状态的认可是一个众所周知的困难问题。在这里，我们提出了一个有效的量子对抗性二分纠缠检测方案，以解决此问题。我们的建议将两分部分的纠缠检测重新定义为通过参数化量子电路完成的两人零和游戏，其中可以使用两次结果测量来查询有关输入状态是否纠缠的输入状态的经典二进制结果。原则上，对于$ n $ qubit量子状态，我们的提案的运行时复杂性为$ o（\ text {poly}（n）t）$，$ t $是迭代的数量。我们在线性光网络上实验实现了我们的方案，并表现出其有效性，可以实现5 Quibent量子纯态和2 QUITION量子混合状态的两部分纠缠检测。我们的工作铺平了使用近期量子机在多部分纠缠量子系统上处理纠缠检测的方式。
The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits, where a two-outcome measurement can be used to query a classical binary result about whether the input state is bipartite entangled or not. In principle, for an $N$-qubit quantum state, the runtime complexity of our proposal is $O(\text{poly}(N)T)$ with $T$ being the number of iterations. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states. Our work paves the way for using near-term quantum machines to tackle entanglement detection on multipartite entangled quantum systems.
