Noisy Qubits, Hard Problems: A SystematicReview and Taxonomy of Quantum OptimizationBeyond Toy Benchmarks

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Abstract Quantum optimization has become a leading application for near-term quantumcomputing, and yet many publications compare algorithms against idealizedassumptions and small toy benchmarks. This limits the interpretability, reproducibility,and practical relevance of reported performance gains, particularlyin the noisy intermediate-scale quantum (NISQ) era. In this work, we presenta systematic literature review that investigate quantum optimization beyondtoy benchmarks. Following established SLR protocols, we analyze the literaturealong multiple methodological dimensions, including algorithmic approach,benchmark realism, encoding strategies, hybrid quantum-classical workflows,hardware and noise modeling, evaluation metrics, and reporting practices. Weintroduce a unified taxonomy that captures the interaction between problemformulation, encoding overhead, noise-aware execution, and hybrid optimizationloops. In addition, we propose a reproducibility checklist and scoring rubric toassess reporting completeness and experimental rigor across studies. Instead ofdeveloping new quantum optimization algorithms or making theoretical quantumadvantage claims, the main contribution of this work is that it providesa methodological analysis on benchmarking realism and encoding or evaluationpractices as well as reproducibility rigor in NISQ-era quantum optimization studies.Our review uncovers a continued chasm between algorithmic innovation andevaluation maturity, with the number of publications and diversity of methodsgrowing without corresponding growth in standardized benchmarks, strongclassical baselines, noise-consistent evaluation, or reproducibility.
Full text 11,340 characters · extracted from preprint-html · click to expand
Noisy Qubits, Hard Problems: A SystematicReview and Taxonomy of Quantum OptimizationBeyond Toy Benchmarks | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Noisy Qubits, Hard Problems: A SystematicReview and Taxonomy of Quantum OptimizationBeyond Toy Benchmarks Srikanth Kumar Sridhara, Dr. K. Kishore Kumar This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8721596/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Quantum optimization has become a leading application for near-term quantumcomputing, and yet many publications compare algorithms against idealizedassumptions and small toy benchmarks. This limits the interpretability, reproducibility,and practical relevance of reported performance gains, particularlyin the noisy intermediate-scale quantum (NISQ) era. In this work, we presenta systematic literature review that investigate quantum optimization beyondtoy benchmarks. Following established SLR protocols, we analyze the literaturealong multiple methodological dimensions, including algorithmic approach,benchmark realism, encoding strategies, hybrid quantum-classical workflows,hardware and noise modeling, evaluation metrics, and reporting practices. Weintroduce a unified taxonomy that captures the interaction between problemformulation, encoding overhead, noise-aware execution, and hybrid optimizationloops. In addition, we propose a reproducibility checklist and scoring rubric toassess reporting completeness and experimental rigor across studies. Instead ofdeveloping new quantum optimization algorithms or making theoretical quantumadvantage claims, the main contribution of this work is that it providesa methodological analysis on benchmarking realism and encoding or evaluationpractices as well as reproducibility rigor in NISQ-era quantum optimization studies.Our review uncovers a continued chasm between algorithmic innovation andevaluation maturity, with the number of publications and diversity of methodsgrowing without corresponding growth in standardized benchmarks, strongclassical baselines, noise-consistent evaluation, or reproducibility. Quantum Optimization Noisy Quantum Devices NISQ QAOA Quantum Annealing Toy Benchmark Benchmarking Full Text Additional Declarations No competing interests reported. Supplementary Files SpringerNaturewithoutname.pdf Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8721596","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":604514570,"identity":"90ed643b-6ae3-4b0a-ab71-eb2eb0b32f5b","order_by":0,"name":"Srikanth Kumar Sridhara","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABTklEQVRIie2RMWsCMRSAEw7OJeecYKt/4YnQVhD8KxcKdnMRikNpI4G4aPsDtPgXbmvHOw7scjhXXBRXhU6F0laaOwv29ErXDvlIHoT3Pt4jDyGD4V+CZRxdfW1E2rRY73aEftBtliQnS4FvJapVgAR/KcjaKY5qcI+6P5IZ9aVBKOHt8aNZEs54vrJD/MCWqtC+OmvCzMfztUJHp2kFJlzyfgQt8PMX5SEJreqAKxaNaQsmrlW+V4hURVohWPqOAu4hclIgNLTRTCvCptyLkF1wtAJ+erAelsGnVkYiViAkaBpoZZMoufcMBUVYnsddhB8rboPCM1aso7ZdrAwFtFI5VhXuhfkGG/o1YD0uq51b2mI6xYYTejhYbsnWqshH3f6Yrjf05i73tJiK1+tmPrKCl9Vlrb4/2G49eytw9Zbjr6K/1MccKgaDwWBI+AKSW3NBZdSsWgAAAABJRU5ErkJggg==","orcid":"","institution":"","correspondingAuthor":true,"prefix":"","firstName":"Srikanth","middleName":"Kumar","lastName":"Sridhara","suffix":""},{"id":604514571,"identity":"48d7a095-bc70-4492-84ab-6a1b83e04b9b","order_by":1,"name":"Dr. K. Kishore Kumar","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"Dr.","firstName":"K.","middleName":"Kishore","lastName":"Kumar","suffix":""}],"badges":[],"createdAt":"2026-01-28 13:53:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8721596/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8721596/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":106402794,"identity":"389512a1-03fa-4725-b69a-8fdfca1e5d01","added_by":"auto","created_at":"2026-04-08 09:12:53","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":646354,"visible":true,"origin":"","legend":"","description":"","filename":"SpringerNaturewithname.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8721596/v1_covered_a25f9d54-aef3-4648-b626-21804a40bf06.pdf"},{"id":104470204,"identity":"516b7255-8fb2-4282-b4bc-3afba1a66530","added_by":"auto","created_at":"2026-03-12 07:15:33","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"supplement","size":691064,"visible":true,"origin":"","legend":"","description":"","filename":"SpringerNaturewithoutname.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8721596/v1/addc1dfd5249085d3f5a25c3.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Noisy Qubits, Hard Problems: A SystematicReview and Taxonomy of Quantum OptimizationBeyond Toy Benchmarks","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Quantum Optimization, Noisy Quantum Devices, NISQ, QAOA, Quantum Annealing, Toy Benchmark, Benchmarking","lastPublishedDoi":"10.21203/rs.3.rs-8721596/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8721596/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Quantum optimization has become a leading application for near-term quantumcomputing, and yet many publications compare algorithms against idealizedassumptions and small toy benchmarks. This limits the interpretability, reproducibility,and practical relevance of reported performance gains, particularlyin the noisy intermediate-scale quantum (NISQ) era. In this work, we presenta systematic literature review that investigate quantum optimization beyondtoy benchmarks. Following established SLR protocols, we analyze the literaturealong multiple methodological dimensions, including algorithmic approach,benchmark realism, encoding strategies, hybrid quantum-classical workflows,hardware and noise modeling, evaluation metrics, and reporting practices. Weintroduce a unified taxonomy that captures the interaction between problemformulation, encoding overhead, noise-aware execution, and hybrid optimizationloops. In addition, we propose a reproducibility checklist and scoring rubric toassess reporting completeness and experimental rigor across studies. Instead ofdeveloping new quantum optimization algorithms or making theoretical quantumadvantage claims, the main contribution of this work is that it providesa methodological analysis on benchmarking realism and encoding or evaluationpractices as well as reproducibility rigor in NISQ-era quantum optimization studies.Our review uncovers a continued chasm between algorithmic innovation andevaluation maturity, with the number of publications and diversity of methodsgrowing without corresponding growth in standardized benchmarks, strongclassical baselines, noise-consistent evaluation, or reproducibility.","manuscriptTitle":"Noisy Qubits, Hard Problems: A SystematicReview and Taxonomy of Quantum OptimizationBeyond Toy Benchmarks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-03-12 07:15:29","doi":"10.21203/rs.3.rs-8721596/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"0507afc3-72d8-4cbc-9f22-d7ec57e146f1","owner":[],"postedDate":"March 12th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-04-05T23:53:48+00:00","versionOfRecord":[],"versionCreatedAt":"2026-03-12 07:15:29","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8721596","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8721596","identity":"rs-8721596","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0