Can I read Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem on EtoBox?

Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem by Dinh, Thinh Q.; Dau, Son Hoang; Lagunas, Eva; Chatzinotas, Symeon is a scholarly article available to read on EtoBox.

What is Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem about?

Beam Placement (BP) is a well-known problem in Low-Earth Orbit (LEO) satellite communication (SatCom) systems, which can be modelled as an NP-hard clique cover problem. Recently, quantum computing has emerged as a novel technology which revolutionizes how to solve challenging optimization problems by formulating Quadratic Unconstrained Binary Optimization (QUBO), then preparing Hamiltonians as inputs for quantum computers. In this paper, we study how to use quantum computing to solve BP problems. However, due to limited hardware resources, existing quantum computers are unable to tackle large optimization spaces. Therefore, we propose an efficient Hamiltonian Reduction method that allows quantum processors to solve large BP instances encountered in LEO systems. We conduct our simulations on real quantum computers (D-Wave Advantage) using a real dataset of vessel locations in the US. Numerical results show that our algorithm outperforms commercialized solutions of D-Wave by allowing existing quantum annealers to solve 17.5 times larger BP instances while maintaining high solution quality. Although quantum computing cannot theoretically overcome the hardness of BP problems, this work

Author

Dinh, Thinh Q.; Dau, Son Hoang; Lagunas, Eva; Chatzinotas, Symeon

Published

2022

Language

EN