Description
Abstract:
Quantum heuristic algorithms do not have a proven advantage over classical algorithms. However, there are indications that these approaches might outperform classical approaches for certain applications. Moreover, they are believed to work without quantum error correction and are therefore amenable to early quantum computing devices.Hard combinatorial optimization problems as they occur in logistics or traffic management are highly relevant for society and business. Even minor improvements in the solution quality can have a enormous impact in terms of costs.
We present our work on mapping and solving hard real world planning problems from aerospace research with quantum heuristic algorithms like the Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing (QA).
In particular, we discuss the choice of representative but small problem instances as well as the mapping of the original problem to a form compatible with the device and algorithm at hand. The latter includes various obstacles like the handling of constraints, the choice of algorithm parameters and compiling.
Speaker
Dr
Thorge Müller
(DLR)
