Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem

by   Thinh Q. Dinh, et al.

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 contributes early efforts to applying quantum computing in satellite optimization problems, especially applications formulated as clique cover/graph coloring problems.


Exploring Airline Gate-Scheduling Optimization Using Quantum Computers

This paper investigates the application of quantum computing technology ...

Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms

Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of o...

Reducing Binary Quadratic Forms for More Scalable Quantum Annealing

Recent advances in the development of commercial quantum annealers such ...

FastHare: Fast Hamiltonian Reduction for Large-scale Quantum Annealing

Quantum annealing (QA) that encodes optimization problems into Hamiltoni...

Q-Match: Iterative Shape Matching via Quantum Annealing

Finding shape correspondences can be formulated as an NP-hard quadratic ...

EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations

Quantum computing is an information processing paradigm that uses quantu...

Please sign up or login with your details

Forgot password? Click here to reset