A Hybrid Classical Quantum Computing Approach to the Satellite Mission Planning Problem

Abstract

Hundreds of satellites equipped with cameras orbit the Earth to capture images from locations for various purposes. Since the field of view of the cameras is usually very narrow, the optics have to be adjusted and rotated between single shots of different locations. This is even further complicated by the fixed speed -- determined by the satellite's altitude -- such that the decision what locations to select for imaging becomes even more complex. Therefore, classical algorithms for this Satellite Mission Planning Problem (SMPP) have already been proposed decades ago. However, corresponding classical solutions have only seen evolutionary enhancements since then. Quantum computing and its promises, on the other hand, provide the potential for revolutionary improvement. Therefore, in this work, we propose a hybrid classical quantum computing approach to solve the SMPP combining the advantages of quantum hardware with decades of classical optimizer development. Using the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and its warm-start variant (W-QAOA), we demonstrate the applicability of solving the SMPP for up to 21 locations to choose from. This proof-of-concept -- which is available on GitHub (https://github.com/cda-tum/mqt-problemsolver) as part of the Munich Quantum Toolkit (MQT) -- showcases the potential of quantum computing in this application domain and represents a first step toward competing with classical algorithms in the future.

arXiv comment6 pages, 6 figures, to be published at International Conference on Quantum Computing and Engineering (QCE), 2023

References in corpus (16)

• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• A Quantum Approximate Optimization Algorithm
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• Warm-starting quantum optimization
• Option Pricing using Quantum Computers
• Quantum Computing for Neutrino-nucleus Scattering
• Compiler Optimization for Quantum Computing Using Reinforcement Learning
• Predicting Good Quantum Circuit Compilation Options
• Towards an Automated Framework for Realizing Quantum Computing Solutions
• Encoding-Independent Optimization Problem Formulation for Quantum Computing
• Recommending Solution Paths for Solving Optimization Problems with Quantum Computing
• Using a quantum computer to solve a real-world problem -- what can be achieved today?

Cited by in corpus (4)

• The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
• MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum Computing
• Quantum Optimization Methods for Satellite Mission Planning
• Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications