Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Felix Gemeinhardt, Antonio Garmendía, Manuel Wimmer, Benjamin Weder, Frank Leymann
Abstract
The application of quantum computing to combinatorial optimization problems is attracting increasing research interest, resulting in diverse approaches and research streams. This study aims at identifying, classifying, and understanding existing solution approaches as well as typical use cases in the field. The obtained classification schemes are based on a full-text analysis of 156 included papers. Our results can be used by researchers and practitioners to (i) better understand adaptations to and utilizations of existing gate-based and quantum annealing approaches and (ii) identify typical use cases for quantum computing in areas such as graph optimization, routing, and scheduling.