arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.14738quant-ph
收藏

量子中继链中的概率截断

Probabilistic Cutoffs in Homogeneous Quantum Repeater Chains

QuTech, Delft University of Technology(代尔夫特理工大学 QuTech);Quantum Computer Science, EEMCS, Delft University of Technology(代尔夫特理工大学 EEMCS 量子计算机科学);Kavli Institute of Nanoscience, Delft University of Technology(代尔夫特理工大学 卡弗里纳米科学研究所);College of Information and Computer Science, University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校 信息与计算机科学学院)

Jeroen Grimbergen, Stav Haldar, Alvaro Gomez Inesta, Stephanie Wehner

AI总结:

本文提出了一种无需跟踪链接年龄的概率截断策略,可在节点较少或基本链接生成概率较高的情况下提供与确定性策略相当的秘密密钥速率。

摘要:

我们研究了一种量子中继链,其中相邻节点之间的纠缠链接是通过 heralded 精密纠缠生成创建的,而相邻链接一旦生成就立即交换。由于 heralded 精密纠缠生成尝试只以概率成功,一些链接必须在链中的节点处存储在量子记忆中,直到相邻链接生成。这些存储链接的保真度会随时间下降,如果存储时间过长,这可能导致端到端保真度降低。先前的工作表明,通过确定性地丢弃超过某些截断值的链接可以提高端到端保真度。这种确定性截断策略为所有链接的保真度提供了严格控制,但代价是需要跟踪链接年龄。在本工作中,我们引入了一种概率截断策略,该策略不需要跟踪链接年龄,但放弃了对保真度的严格控制。我们将这种新的概率截断策略与确定性截断策略进行比较。我们从端到端速率和保真度,以及秘密密钥速率的角度比较这些策略。我们发现,尽管概率截断策略跟踪的状态较少,它可以在节点较少或基本链接生成概率较高的链中提供与确定性截断策略相同数量级的秘密密钥速率。此外,我们识别出一种场景,在这种场景中,概率截断策略可以以比确定性截断策略更高的速率提供端到端链接,这些链接需要具有某些最小阈值保真度。

英文摘要:

We study quantum repeater chains in which entangled links between neighbouring nodes are created through heralded entanglement generation and adjacent links are swapped as soon as possible. Since heralded entanglement generation attempts succeed only probabilistically, some links will have to be stored in quantum memories at the nodes of the chain while waiting for adjacent links to be generated. The fidelity of these stored links decreases with time due to decoherence, and if they are stored for too long then this can lead to low end-to-end fidelity. Previous work has shown that the end-to-end fidelity can be improved by deterministically discarding links when their ages exceed some cutoff value. Such deterministic cutoff policies provide strict control of the fidelity of all links, but they come at the expense of having to track link ages. In this work, we introduce a probabilistic cutoff policy that does not require tracking link ages, at the cost of abandoning strict control of the fidelity. We benchmark this new probabilistic cutoff policy against a deterministic cutoff policy. We compare the policies in terms of the end-to-end rate and fidelity, and the secret-key rate. We find that even though the probabilistic cutoff policy keeps track of less state, it can provide secret-key rates of the same order of magnitude as the deterministic cutoff policy in chains with few nodes or high elementary link generation probabilities. Moreover, we identify a scenario in which the probabilistic cutoff policy can deliver end-to-end links that are required to have some minimum threshold fidelity at a higher rate than the deterministic cutoff policy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑