AI 中文总结
针对实用量子网络中用户间频率分配问题，提出基于超纠缠光子的无中继灵活网格量子网络的三阶段流水线方法，结合经典网络工具与数值优化进展，经实验验证在多方面优于遗传算法，为宽带纠缠分发提供高效工作流程。
AI 中文摘要
随着实用量子网络接近大规模部署，对高效用户间频率分配的需求日益增加，但当前方法仅为任意量子网络的路由和频谱分配问题提供部分解决方案。我们针对基于超纠缠光子的无中继灵活网格量子网络，使用一种高效的三阶段流水线方法应对这一挑战，该方法结合了经典网络中的领先工具和数值优化的最新进展。首先，Yen算法的双重实例化获取用户与纠缠源之间的低损耗路由候选。其次，先进过程优化器（APOPT）在保真度约束下获得使分发速率最大化的频率信道分配。最后，使用可满足性方法的约束编程求解器（CP-SAT）为每个链路分配特定频率 bin，确保不同源的频率之间无冲突。我们在代表性环形网络和曼哈顿现有本地交换运营商拓扑上通过数值验证了该方法，在速度、准确性和可扩展性方面比先前的遗传算法方法有显著改进。总体而言，此流水线为优化宽带纠缠分发提供了一种高效启发式工作流程，适用于集成在现有光波基础设施内的任意连接量子网络。
英文摘要
As practical quantum networks approach large-scale deployment, the need for efficient user-to-user frequency allocation is increasing, yet current approaches only provide partial solutions to the routing and spectrum allocation problem for an arbitrary quantum network. We address this challenge for repeater-less flex-grid quantum networks based on hyperentangled photons using an efficient three-stage pipeline combining leading tools in classical networking with recent advances in numerical optimization. First, double instantiations of Yen's algorithm obtain low-loss route candidates between each pair of users and the entanglement sources. Second, the advanced process optimizer (APOPT) obtains frequency channel allocations that maximize distribution rates under fidelity constraints. Finally, the constraint programming solver using satisfiability methods (CP-SAT) assigns specific frequency bins to each link, ensuring that there is no contention between frequencies from different sources. We numerically demonstrate this approach on a representative ring network and a Manhattan incumbent local exchange carrier topology, realizing significant improvements over prior genetic algorithm approaches in speed, accuracy, and scalability. Overall, this pipeline provides an efficient heuristic workflow for optimizing broadband entanglement distribution, applicable to arbitrarily connected quantum networks integrated within the existing lightwave infrastructure.
Comments16 pages, 8 figures, 1 table; submitted to Optics Express
