Year: 2026
Type: preprint
Abstract: This compendium presents a structured collection of computational problems with credible prospects for realizing meaningful quantum advantage, focused on describing problem characteristics rather than specific algorithms. It is intended for non-quantum researchers and practitioners with strong computational backgrounds, particularly domain experts, seeking to assess the relevance of quantum methods to real-world problems. The compendium focuses on enumerating core problems for which there is good evidence that a quantum computer can realize more than a quadratic speedup in offline non-relativized time-complexity (e.g., as opposed to in oracular settings, streaming models, or communication advantages). Entries characterize the structural constraints that real-world instances must satisfy to realize those advantages in practice. The intention is to provide a reference that can be leveraged to connect quantum algorithms to practical use cases.
Source: arXiv (Cornell University)
Authors: Kammerlander, Philipp, O'Brien, Thomas E., King, Robbie, Somma, Rolando D., Kieferová, Mária, Lackey, Brad, Schmidhuber, Alexander, Jain, Siddhartha, Gu, Andi, Alexeev, Yuri, Chakrabarti, Shouvanik, Shaydulin, Ruslan, Posta, Pietro M., Low, Guang Hao, Gilboa, Dar, Troyer, Matthias, Sanders, Barry C., Christandl, Matthias, Kyoseva, Elica, Lefebvre, Catherine, Babbush, Ryan
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: CERN
OpenAlex ID: W7223699345