arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.04425quant-phcs.NI
收藏

不确定保真度要求下的纠缠对资源分配

Entangled Pair Resource Allocation under Uncertain Fidelity Requirements

Rakpong Kaewpuang, Minrui Xu, Stephen John Turner, Dusit Niyato, Han Yu, Dong In Kim

AI总结:

针对量子网络长距离纠缠保真度挑战,提出基于两阶段随机规划的纠缠对资源分配与路由联合优化模型,在不确定保真度要求下最小化总成本,较基线降低至少20%成本。

摘要:

在量子网络中,有效的纠缠路由促进了量子源节点和量子目标节点之间的远程纠缠通信。与经典网络中的路由不同,量子网络中的纠缠路由必须考虑纠缠量子比特的质量(即纠缠保真度),这在确保长距离下的纠缠保真度方面提出了挑战。为了解决这个问题,我们提出了一种纠缠对的资源分配模型和一种具有保真度保证的纠缠路由模型。该方法联合优化纠缠资源(即纠缠对)和纠缠路由,以支持量子网络中的应用。我们提出的模型采用两阶段随机规划进行表述,考虑了量子应用需求的不确定性。旨在最小化总成本,我们的模型在不确定保真度要求下确保了纠缠对的高效利用和量子中继器的节能。实验结果表明,与基线模型相比,我们提出的模型可以将总成本降低至少20%。

英文摘要:

In quantum networks, effective entanglement routing facilitates remote entanglement communication between quantum source and quantum destination nodes. Unlike routing in classical networks, entanglement routing in quantum networks must consider the quality of entanglement qubits (i.e., entanglement fidelity), presenting a challenge in ensuring entanglement fidelity over extended distances. To address this issue, we propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. This approach jointly optimizes entangled resources (i.e., entangled pairs) and entanglement routing to support applications in quantum networks. Our proposed model is formulated using two-stage stochastic programming, taking into account the uncertainty of quantum application requirements. Aiming to minimize the total cost, our model ensures efficient utilization of entangled pairs and energy conservation for quantum repeaters under uncertain fidelity requirements. Experimental results demonstrate that our proposed model can reduce the total cost by at least 20\% compared to the baseline model.

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

↑