{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.32595",
  "author_total": 21,
  "authors": [
    {
      "name": "Philipp Kammerlander"
    },
    {
      "name": "Thomas E. O'Brien"
    },
    {
      "name": "Robbie King"
    },
    {
      "name": "Rolando D. Somma"
    },
    {
      "name": "Mária Kieferová"
    },
    {
      "name": "Brad Lackey"
    },
    {
      "name": "Alexander Schmidhuber"
    },
    {
      "name": "Siddhartha Jain"
    },
    {
      "name": "Andi Gu"
    },
    {
      "name": "Yuri Alexeev"
    },
    {
      "name": "Shouvanik Chakrabarti"
    },
    {
      "name": "Ruslan Shaydulin"
    },
    {
      "name": "Pietro M. Posta"
    },
    {
      "name": "Guang Hao Low"
    },
    {
      "name": "Dar Gilboa"
    },
    {
      "name": "Matthias Troyer"
    },
    {
      "name": "Barry C. Sanders"
    },
    {
      "name": "Matthias Christandl"
    },
    {
      "name": "Elica Kyoseva"
    },
    {
      "name": "Catherine Lefebvre"
    },
    {
      "name": "Ryan Babbush"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/09rzfgqr3hhg5.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.32595",
  "fulltext_url": null,
  "id": "09rzfgqr3hhg5",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.32595",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7223699345",
  "pdf_url": "https://arxiv.org/pdf/2610.32595",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-23",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/09rzfgqr3hhg5.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:15Z",
      "native_id": "2610.32595",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.32595"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "The Compendium of Super-Quadratic Computational Quantum Advantages",
  "title_text": "The Compendium of Super-Quadratic Computational Quantum Advantages",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:15Z",
  "url": "https://research.draconitic.com/paper/09rzfgqr3hhg5",
  "venue": "arXiv",
  "versions": []
}