Quantum-inspired optimization for wavelength assignment

Abstract

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 to transform this problem into the quadratic unconstrained binary optimization (QUBO) form, having a 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 further analysis of the use of quantum computing devices.

Quantum and quantum-inspired optimization for an in-core fuel management problem

“…Constraints inequalities ( 8)-( 9) could be represented [3,15] in quadratic terms. We suggest using a precalculated number of adjacent elements not on the border:…”

“…The resulting expression for H is obtained by sum of Eqs. ( 13)-( 17): H = H (1) + H (2) + H (3) + H (4) + H (5) .…”

“…Quantum computing has emerged as a promising paradigm for tackling complex computational challenges in various fields, including industrial applications [1][2][3][4][5]. As it is expected, the intrinsic quantum properties, such as superposition and entanglement, enable quantum computers to efficiently solve certain problems that are intractable for classical computers.…”

Quantum and quantum-inspired optimization for solving the minimum bin packing problem

“…As soon as these algorithms are compatible with currently existing (classical) hardware, analyzing their limiting capabilities and advantages over classical approaches are required towards their use in practice. Recently, solving the wavelength assignment problem in telecommunication using quantum-inspired algorithm SimCIM [31] has been demonstrated [33]. For a wide range of benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization, namely D-Wave Hybrid Solver Service, Toshiba Simulated Bifurcation Machine, Fujitsu Digital Annealer, and simulated annealing, see Ref.…”