Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer

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.

[1]  Tobias Stollenwerk,et al.  Flight Gate Assignment with a Quantum Annealer , 2018, QTOP@NetSys.

[2]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem , 2014, 1412.6062.

[3]  Rupak Biswas,et al.  Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management , 2017, IEEE Transactions on Intelligent Transportation Systems.

[4]  Vicky Choi,et al.  Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..

[5]  Virginie Gabrel An Extensive Comparison of 0–1 Linear Programs for the Daily Satellite Mission Planning , 2010 .

[6]  Aidan Roy,et al.  A practical heuristic for finding graph minors , 2014, ArXiv.

[7]  Eyob A. Sete,et al.  A functional architecture for scalable quantum computing , 2016, 2016 IEEE International Conference on Rebooting Computing (ICRC).

[8]  Virginie Gabrel Dantzig-Wolfe decomposition for linearly constrained stable set problem , 2010 .

[9]  Gérard Verfaillie,et al.  Selecting and scheduling observations of agile satellites , 2002 .

[10]  Bryan O'Gorman,et al.  A case study in programming a quantum annealer for hard operational planning problems , 2014, Quantum Information Processing.

[11]  L. DiCarlo,et al.  Scalable Quantum Circuit and Control for a Superconducting Surface Code , 2016, 1612.08208.

[12]  Christian Artigues,et al.  On scheduling models for the frequency interval assignment problem with cumulative interferences , 2016 .

[13]  D. Venturelli,et al.  Quantum Annealing Implementation of Job-Shop Scheduling , 2015, 1506.08479.

[14]  Sabrina Hong,et al.  Demonstration of universal parametric entangling gates on a multi-qubit lattice , 2017, Science Advances.

[15]  Ryan Babbush,et al.  What is the Computational Value of Finite Range Tunneling , 2015, 1512.02206.

[16]  H. Neven,et al.  Characterizing quantum supremacy in near-term devices , 2016, Nature Physics.

[17]  Rupak Biswas,et al.  From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz , 2017, Algorithms.