量子网络中的单次路由
One-shot Routing in Quantum Networks
浏览论文内容
中文总结 AI 辅助
针对分布式量子计算中的单次路由问题，提出FOLD启发式算法，联合优化路径选择和纠缠调度，在多项式时间内接近最优保真度，并处理保真度不确定性与协调问题。
中文摘要 AI 辅助
分布式量子计算需要同时可用许多纠缠对，因此路由必须从一组固定的、短暂存在的网络资源中优化保真度，而不是优化随时间累积的配对速率。我们针对异构Werner态链路制定了这一单次路由问题，并联合优化路径选择以及纠缠交换和蒸馏的调度。我们证明了常见的先纯化后交换顺序在网络范围内并非最优，且精确调度枚举需要m^Θ(m)时间。我们引入了保真度优化的局部绕行（FOLD），这是一种启发式算法，从最高保真度路径开始，仅当蒸馏在两条路由上都有改进并提高端到端保真度时才合并绕行。FOLD在多项式时间内运行，在可处理的实例上恢复了几乎所有的最优保真度，并且在电路秩为5时比精确优化快四个数量级。在互联网拓扑中，任何策略都优于最短路径路由，FOLD在多项式基线中实现了最高的平均端到端保真度。我们进一步将公式扩展到保真度仅作为分布已知的链路，其中不确定性（而非路由所花费的努力）限制了所传递的保真度。通过一个请求竞争相同链路的示例，我们表明协调成为可行性的条件，并且共享路径预算控制它们之间的保真度权衡。
英文摘要
Distributed quantum computation requires many entangled pairs to be available simultaneously, so routing must optimize fidelity from a fixed, short-lived set of network resources rather than the rate of pairs accumulated over time. We formulate this one-shot routing problem for heterogeneous Werner-state links and jointly optimize path selection and the schedule of entanglement swapping and distillation. We show that the common purify-then-swap ordering is not optimal network-wide and that exact schedule enumeration requires $m^{Θ(m)}$ time. We introduce Fidelity-Optimizing Local Detours (FOLD), a heuristic that starts from the highest-fidelity path and merges a detour only when distillation improves on both routes and raises end-to-end fidelity. FOLD runs in polynomial time, recovers almost all of the optimal fidelity on tractable instances, and is four orders of magnitude faster than exact optimization at circuit rank $5$. On the Internet topologies where any strategy improves on shortest-path routing, FOLD achieves the highest mean end-to-end fidelity among the polynomial baselines. We further extend the formulation to links whose fidelities are known only as distributions, where uncertainty, rather than the effort spent routing, limits the fidelity delivered. Through an example of requests competing for the same links, we show that coordination becomes a condition for feasibility, and that a shared path budget controls the fidelity trade-off between them.
发表机构
- Viterbi Faculty of Electrical and Computer Engineering, Technion – Israel Institute of Technology（以色列理工学院 Viterbi 电气与计算机工程学院）
机构由 AI 辅助整理，请以论文原文为准。
