A Hybrid Classical Quantum Computing Approach to the Satellite Mission
Planning Problem
- URL: http://arxiv.org/abs/2308.00029v1
- Date: Mon, 31 Jul 2023 18:00:01 GMT
- Title: A Hybrid Classical Quantum Computing Approach to the Satellite Mission
Planning Problem
- Authors: Nils Quetschlich, Vincent Koch, Lukas Burgholzer, Robert Wille
- Abstract summary: We propose a hybrid computing approach to solve the Satellite Mission Planning Problem (SMPP)
We demonstrate the applicability of solving the SMPP for up to 21 locations to choose from.
This proof-of-concept is available on GitHub.
- Score: 3.2124391505046272
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Bayesian Optimization Priors for Efficient Variational Quantum Algorithms [0.0]
Quantum computers currently rely on a quantum-classical approach known as Variational Quantum Algorithms (VQAs) to solve problems.
We propose a hybrid framework for basic computational optimization that reduces the number of shots per time is charged.
Using both proposed features, we show that using both proposed features statistically outperforms an implementation within VQAs for simulations.
arXiv Detail & Related papers (2024-06-20T18:00:12Z) - A quantum annealing approach to the minimum distance problem of quantum codes [0.0]
We introduce an approach to compute the minimum distance of quantum stabilizer codes by reformulating the problem as a Quadratic Unconstrained Binary Optimization problem.
We demonstrate practical viability of our method by comparing the performance of purely classical algorithms with the D-Wave Advantage 4.1 quantum annealer.
arXiv Detail & Related papers (2024-04-26T21:29:42Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - 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) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Using a quantum computer to solve a real-world problem -- what can be
achieved today? [0.0]
Quantum computing is an important developing technology with the potential to revolutionise the landscape of scientific and business problems.
The widespread excitement derives from the potential for a fault tolerant quantum computer to solve previously intractable problems.
We are currently in the so-called NISQ era where more quantum approaches are being applied to early versions of quantum hardware.
arXiv Detail & Related papers (2022-11-23T16:10:53Z) - Hybrid Quantum Classical Simulations [0.0]
We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE)
Both are hybrid quantum classical algorithms as they require incremental communication between a classical central processing unit and a quantum processing unit to solve a problem.
arXiv Detail & Related papers (2022-10-06T10:49:15Z) - Quantum Machine Learning with HQC Architectures using non-Classically Simulable Feature Maps [0.30723404270319693]
We present an application of QSVM (Quantum Support Vector Machines) to predict if a person will require mental health treatment in the future.
We prove that NISQ HQC Architectures for Quantum Machine Learning can be used alternatively to create good performance models in near-term real-world applications.
arXiv Detail & Related papers (2021-03-21T12:28:46Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z)
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.