Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer

• URL: http://arxiv.org/abs/2006.09724v1
• Date: Wed, 17 Jun 2020 08:55:37 GMT
• Title: Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer
• Authors: Tobias Stollenwerk, Vincent Michaud, Elisabeth Lobe, Mathieu Picard, Achim Basermann, Thierry Botter
• Abstract summary: We compare state-of-the-art classical optimisation methods to a D-Wave 2000Q quantum annealer for the planning of Earth observation missions. We find that the solution quality of the quantum annealer is comparable to the method used operationally for small problem instances, but degrades rapidly due to the limited precision of the quantum annealer.
• Score: 0.35232085374661287
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a comparison study of state-of-the-art classical optimisation methods to a D-Wave 2000Q quantum annealer for the planning of Earth observation missions. The problem is to acquire high value images while obeying the attitude manoeuvring constraint of the satellite. In order to investigate close to real-world problems, we created benchmark problems by simulating realistic scenarios. Our results show that a tuned quantum annealing approach can run faster than a classical exact solver for some of the problem instances. Moreover, we find that the solution quality of the quantum annealer is comparable to the heuristic method used operationally for small problem instances, but degrades rapidly due to the limited precision of the quantum annealer.

Related papers

• Quantum Optimization Methods for Satellite Mission Planning [0.3252295747842729]
  The ever-growing amount of satellites in orbit underscores the need to operate them efficiently. Current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative.
  arXiv  Detail & Related papers  (2024-04-08T13:36:29Z)
• Q-Seg: Quantum Annealing-Based Unsupervised Image Segmentation [4.737806718785056]
  We present Q-Seg, a novel unsupervised image segmentation method based on quantum annealing. We formulate the pixel-wise segmentation problem, which assimilates spectral and spatial information of the image, as a graph-cut optimization task. Empirical evaluations on synthetic datasets have shown that Q-Seg has better runtime performance than the state-of-the-art classical solution.
  arXiv  Detail & Related papers  (2023-11-21T17:27:20Z)
• Exploring the topological sector optimization on quantum computers [5.458469081464264]
  topological sector optimization (TSO) problem attracts particular interests in the quantum many-body physics community. We demonstrate that the optimization difficulties of TSO problem are not restricted to the gaplessness, but are also due to the topological nature. To solve TSO problems, we utilize quantum imaginary time evolution (QITE) with a possible realization on quantum computers.
  arXiv  Detail & Related papers  (2023-10-06T14:51:07Z)
• Optimization of Image Acquisition for Earth Observation Satellites via Quantum Computing [0.786197460675312]
  Satellite image acquisition scheduling is a problem that is omnipresent in the earth observation field. We present two QUBO formulations for the problem, using different approaches to handle the non-trivial constraints. We also provide practical guidelines on the size limits of problem instances that can be realistically solved on current quantum computers.
  arXiv  Detail & Related papers  (2023-07-26T18:00:02Z)
• 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 Optimization of Maximum Independent Set using Rydberg Atom Arrays [39.76254807200083]
  We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem. We find the problem hardness is controlled by the solution degeneracy and number of local minima. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
  arXiv  Detail & Related papers  (2022-02-18T19:00:01Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Conditional preparation of non-Gaussian quantum optical states by mesoscopic measurement [62.997667081978825]
  Non-Gaussian states of an optical field are important as a proposed resource in quantum information applications. We propose a novel approach involving displacement of the ancilla field into the regime where mesoscopic detectors can be used. We conclude that states with strong Wigner negativity can be prepared at high rates by this technique under experimentally attainable conditions.
  arXiv  Detail & Related papers  (2021-03-29T16:59:18Z)
• 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)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

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.