{
  "abstract": "Recent advances in quantum computing hardware toward fault-tolerance have increased interest in evaluating near-term quantum platforms on application-relevant quantum algorithms. In this work, we introduce Quantum WalkScore (QWS), a scalable application-oriented benchmark designed to assess the performance of NISQ and future fault-tolerant quantum computers in executing essential quantum routines --discrete-time quantum walks and quantum amplitude amplification-- to solve the graph nodefinding problem (marked-vertex search). QWS quantifies performance by scoring the largest problem size for which a designated target node can be found with success probability above a defined threshold. In addition to the complete protocol description, we provide example parameter-selection scenarios designed from noiseless simulation results and demonstrate QWS evaluation through experimental runs on multiple generations of IBM real quantum processors.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.19931",
  "author_total": 2,
  "authors": [
    {
      "name": "Noé Olivier"
    },
    {
      "name": "Michel Nowak"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/fz3vaz6fq03ra.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.19931",
  "fulltext_url": null,
  "id": "fz3vaz6fq03ra",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.19931",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7213602893",
  "pdf_url": "https://arxiv.org/pdf/2609.19931",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-17",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/fz3vaz6fq03ra.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:22:19Z",
      "native_id": "2609.19931",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.19931"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Quantum WalkScore: Benchmarking Quantum Computers on the Graph Nodefinding Problem",
  "title_text": "Quantum WalkScore: Benchmarking Quantum Computers on the Graph Nodefinding Problem",
  "type": "preprint",
  "updated_at": "2026-10-30T12:22:19Z",
  "url": "https://research.draconitic.com/paper/fz3vaz6fq03ra",
  "venue": "arXiv",
  "versions": []
}