Quantum-inspired optimization for wavelength assignment
- URL: http://arxiv.org/abs/2211.00317v2
- Date: Thu, 19 Jan 2023 14:12:16 GMT
- Title: Quantum-inspired optimization for wavelength assignment
- Authors: Aleksey S. Boev, Sergey R. Usmanov, Alexander M. Semenov, Maria M.
Ushakova, Gleb V. Salahov, Alena S. Mastiukova, Evgeniy O. Kiktenko, Aleksey
K. Fedorov
- Abstract summary: We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem.
Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
- Score: 51.55491037321065
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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 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.
Related papers
- Pulse-based variational quantum optimization and metalearning in superconducting circuits [3.770494165043573]
We introduce pulse-based variational quantum optimization (PBVQO) as a hardware-level framework.
We illustrate the framework by optimizing external superconducting on quantum interference devices.
The synergy between PBVQO and meta-learning provides an advantage over conventional gate-based variational algorithms.
arXiv Detail & Related papers (2024-07-17T15:05:36Z) - Performant near-term quantum combinatorial optimization [1.1999555634662633]
We present a variational quantum algorithm for solving optimization problems with linear-depth circuits.
Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target quantum function.
We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.
arXiv Detail & Related papers (2024-04-24T18:49:07Z) - Performance analysis of a filtering variational quantum algorithm [0.0]
Filtering Variational Quantum Eigensolver (F-VQE) is a variational hybrid quantum algorithm designed to solve optimization problems on existing quantum computers.
We employ Instantaneous Quantum Polynomial circuits as our parameterized quantum circuits.
Despite some observed positive signs, we conclude that significant development is necessary for a practical advantage with F-VQE.
arXiv Detail & Related papers (2024-04-13T08:50:44Z) - A Universal Quantum Algorithm for Weighted Maximum Cut and Ising
Problems [0.0]
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary problems.
We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted maximum cut or the Ising Hamiltonian.
Measuring the expectation of this operator on a variational quantum state yields the variational energy of the quantum system.
arXiv Detail & Related papers (2023-06-10T23:28:13Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum Speedup for Higher-Order Unconstrained Binary Optimization and
MIMO Maximum Likelihood Detection [2.5272389610447856]
We propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization problem.
The proposed algorithm is capable of reducing the query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
arXiv Detail & Related papers (2022-05-31T00:14:49Z) - A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting.
Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs.
We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z) - Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP)
This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm.
Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
arXiv Detail & Related papers (2021-05-06T17:59:38Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.