论文标题

量子启发的优化波长分配

Quantum-inspired optimization for wavelength assignment

论文作者

Boev, Aleksey S., Usmanov, Sergey R., Semenov, Alexander M., Ushakova, Maria M., Salahov, Gleb V., Mastiukova, Alena S., Kiktenko, Evgeniy O., Fedorov, Aleksey K.

论文摘要

光学通信网络中与波长分配(WA)有关的问题涉及分配传输波长,以在节点之间为已知的传输路径分配,以最大程度地减少某个目标函数,例如,波长总数。这个问题在现代电信中发挥了核心作用,属于NP完整类别的一般案例,因此为行业相关案例获得最佳解决方案是指数级的。在这项工作中,我们提出并开发了一种量子启发的算法,用于解决波长分配问题。我们建议将此问题的高级嵌入过程用于二进制二进制优化(QUBO)形式,其迭代次数有所改善,而付费的变量数量略有增加(“旋转”)。然后,我们比较一种量子启发的技术,该技术用于解决相应的QUBO形式与经典的启发式和工业组合求解器。获得的数值结果表明,在大量的测试用例中,针对在标准环境中起作用的工业组合求解器中,量子启发的方法的优势。我们的结果为使用量子启发的算法用于电信问题的实际问题铺平了道路,并为进一步分析量子计算设备的使用开辟了一个观点。

Problems related to wavelength assignment (WA) in optical communications networks involve allocating transmission wavelengths for known transmission paths between nodes that minimize a certain objective function, for example, the total number of wavelengths. Playing a central role in modern telecommunications, this problem belongs to NP-complete class for a general case, so that obtaining optimal solutions for industry relevant cases is exponentially hard. In this work, we propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. We propose an advanced embedding procedure for this problem into the quadratic unconstrained binary optimization (QUBO) form having an improvement in the number of iterations with price-to-pay being a slight increase in the number of variables ("spins"). Then we compare a quantum-inspired technique for solving the corresponding QUBO form against classical heuristic and industrial combinatorial solvers. The obtained numerical results indicate on an advantage of the quantum-inspired approach in a substantial number of test cases against the industrial combinatorial solver that works in the standard setting. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications and open a perspective for the further analysis of the employ of quantum computing devices.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源