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 like graph optimization, routing and scheduling.
| Original language | English |
|---|---|
| Article number | 3620668 |
| Pages (from-to) | 70:1-70:36 |
| Number of pages | 36 |
| Journal | ACM Computing Surveys |
| Volume | 56 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 31 Mar 2024 |
Fields of science
- 102006 Computer supported cooperative work (CSCW)
- 102015 Information systems
- 102016 IT security
- 102020 Medical informatics
- 102022 Software development
- 102027 Web engineering
- 102034 Cyber-physical systems
- 509026 Digitalisation research
- 502032 Quality management
- 502050 Business informatics
- 503015 Subject didactics of technical sciences
JKU Focus areas
- Digital Transformation