Freiburg 2019 – scientific programme
Sessions | Days | Selection | Search | Updates | Downloads | Help
FM: Fall Meeting
FM 42: Poster: Quantum Computation
FM 42.2: Poster
Tuesday, September 24, 2019, 16:30–18:30, Tents
Quantum Approximate Optimization for Industry Use Cases — •David Headley1,2 and Frank Wilhelm-Mauch2 — 1Daimler AG, Stuttgart, Germany — 2Universität des Saarlandes, Saarbrücken, Germany
The Quantum Approximate Optimization Algorithm (QAOA) is one of several quantum algorithms that may be capable of outperforming classical algorithms using a quantum computer without full quantum error correction. In this work, we explore the applicability of QAOA to use cases from industry. We consider techniques to pre-satisfy constraints and mix within constraint-satisfying sub-spaces and show how some problems can be pre-compiled to smaller, maximally hard sub-problems. Methods such as these will allow quantum computers that are small, noisy, and connectivity-limited to provide greatest performance.