通过循环图上的量子行走递归生成最大纠缠单粒子态
Recurrent generation of maximally entangled single particle states via quantum walks on cyclic graphs
AI总结：
本研究提出通过循环图上的离散时间量子行走递归生成最大纠缠单粒子态（MESPS）的方案，单硬币即可在4、8位点循环图周期性生成，还可在3-5、8位点图通过单/双硬币序列生成，可用于量子密码强化安全通信。
摘要：
最大纠缠单粒子态（MESPS）正为量子技术开辟新可能，因其与非局域双粒子对应态相比，具备编码更多信息的潜力且抗退相干能力更强。我们发现，单个硬币可在4位点和8位点循环图上，通过离散时间量子行走在递归时间步（周期性地）生成MESPS。该方案节省资源，且由于每一步都使用相同硬币，或许是最直接的实验实现方式。我们还表明，在任意k位点循环图（k∈{3,4,5,8}）上，可通过有效单硬币（恒等算符和任意硬币）或双硬币演化序列，生成递归MESPS。除了在基础研究中的用途，我们还提出将生成的MESPS应用于量子密码协议，MESPS作为密码密钥可强化量子安全通信。
英文摘要：
Maximally entangled single-particle states (MESPS) are opening new possibilities in quantum technology as they have the potential to encode more information and are robust to decoherence compared to their nonlocal two-particle counterparts. We find that a single coin can generate MESPS at recurrent time steps (periodically) via discrete-time quantum walks on both $4$ and $8$ site cyclic graphs. This scheme is resource-saving with possibly the most straightforward experimental realization since the same coin is applied at each time step. We also show that recurrent MESPS can be generated on any arbitrary $k$ site cyclic graph, $k\in\{3,4,5,8\}$ via effective-single (Identity and arbitrary coin) or two coin evolution sequences. Beyond their use in fundamental research, we propose an application of the generated MESPS in quantum cryptography protocols. MESPS as cryptographic keys can strengthen quantum-secure communication.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
