Towards a benchmark for quantum computers based on an iterated post-selective protocol

Towards a benchmark for quantum computers based on an iterated post-selective protocol | 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 Towards a benchmark for quantum computers based on an iterated post-selective protocol Adrian Ortega, Orsolya Kálmán, Tamás Kiss This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6306157/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 12 You are reading this latest preprint version Abstract Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task of matching an unknown quantum state to a reference state. We propose to employ the quantum state matching protocol for the purpose of testing and benchmarking quantum computers. In particular, we implement this scheme on freely available IBM superconducting quantum computers. By comparing measured values with the theoretical conditional probability of the single, final post-selected qubit, which is easy to calculate classically, we define a benchmark metric. Additionally, the standard deviation of the experimental results from their average serves as a secondary benchmark metric, characterizing fluctuations in the given device. A peculiar feature of the considered protocol is that there is a phase parameter of the initially prepared state, on which the resulting conditional probability should not depend. A careful analysis of the measured values indicates that its dependence on the initial phase can reveal useful information about coherent gate errors of the quantum device. Quantum Computation Benchmarking Superconducting qubits Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 04 Jan, 2026 Reviews received at journal 11 Dec, 2025 Reviewers agreed at journal 04 Nov, 2025 Reviews received at journal 21 Oct, 2025 Reviewers agreed at journal 20 Sep, 2025 Reviewers agreed at journal 05 Aug, 2025 Reviews received at journal 23 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers invited by journal 08 Jun, 2025 Editor assigned by journal 27 Mar, 2025 Submission checks completed at journal 27 Mar, 2025 First submitted to journal 25 Mar, 2025 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-6306157","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":468486317,"identity":"813ee440-49da-460c-aaa4-d09c98ae0eaf","order_by":0,"name":"Adrian Ortega","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABVklEQVRIie2RP0vDQBiHLwTa5Wo3SUlpv0JCISItyQdxecvBZUmnQsDtQDiXgmvFwc/gN4gEzBICbpGKNHTNkC7SpdT8QZpEQUfBPNwd3O94uPfuRaih4Q+i5GsL4WPUZnmSjQzxBwXSiZ3fKeioSFBOvipnkvm83tlv/e4dEzaXu4l+c7uJkp09uThpu24i8LHOTn2lpJwvrbm6COZYenVE1QdKlis66i0COuOYUkngJmEyhXJhoUWlDgeMQmj1GLgErUBDHe7OuIQ1JPA0kYlTU3r7VBkWyoEMX7x3Yc8PmTJKCmXKKor5JGe3KIXi6EqINbHDnUxR0sJcvX6LH4ujfgBYDadXKqMEVN+ay/2AFG+BwIRW7S2eGUWxDcYgJI8Rm+jGwPMetrGtz+6v0x9L7LHRla3yj6Wd+9wKecGVsvNGTXm9M+11ZWvUz79JGhoaGv4ZH5tRfDldPH6qAAAAAElFTkSuQmCC","orcid":"","institution":"Universidad de Guadalajara","correspondingAuthor":true,"prefix":"","firstName":"Adrian","middleName":"","lastName":"Ortega","suffix":""},{"id":468486318,"identity":"a8ca9f58-fc72-468a-8f90-de70782fcde8","order_by":1,"name":"Orsolya Kálmán","email":"","orcid":"","institution":"HUN-REN Wigner RCP","correspondingAuthor":false,"prefix":"","firstName":"Orsolya","middleName":"","lastName":"Kálmán","suffix":""},{"id":468486320,"identity":"eee5b159-3cf1-4256-a33f-1b1d9e7e9534","order_by":2,"name":"Tamás Kiss","email":"","orcid":"","institution":"HUN-REN Wigner RCP","correspondingAuthor":false,"prefix":"","firstName":"Tamás","middleName":"","lastName":"Kiss","suffix":""}],"badges":[],"createdAt":"2025-03-25 18:08:08","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6306157/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6306157/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":84381414,"identity":"89f96d94-cc53-4f17-9dbf-2ec0820d1b42","added_by":"auto","created_at":"2025-06-11 09:21:12","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":783734,"visible":true,"origin":"","legend":"","description":"","filename":"submissionquantinfoproc.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6306157/v1_covered_797afe84-3ddf-44eb-a0eb-702b4e421acd.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Towards a benchmark for quantum computers based on an iterated post-selective protocol","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"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":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Quantum Computation, Benchmarking, Superconducting qubits","lastPublishedDoi":"10.21203/rs.3.rs-6306157/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6306157/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task of matching an unknown quantum state to a reference state. We propose to employ the quantum state matching protocol for the purpose of testing and benchmarking quantum computers. In particular, we implement this scheme on freely available IBM superconducting quantum computers. By comparing measured values with the theoretical conditional probability of the single, final post-selected qubit, which is easy to calculate classically, we define a benchmark metric. Additionally, the standard deviation of the experimental results from their average serves as a secondary benchmark metric, characterizing fluctuations in the given device. A peculiar feature of the considered protocol is that there is a phase parameter of the initially prepared state, on which the resulting conditional probability should not depend. A careful analysis of the measured values indicates that its dependence on the initial phase can reveal useful information about coherent gate errors of the quantum device.","manuscriptTitle":"Towards a benchmark for quantum computers based on an iterated post-selective protocol","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-11 09:13:04","doi":"10.21203/rs.3.rs-6306157/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2026-01-05T01:49:06+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-12-12T01:16:17+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"67489481291267999529988466912335040547","date":"2025-11-04T16:18:58+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-21T14:03:35+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"222307720225620007976673514481565929178","date":"2025-09-20T16:31:36+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"189569880981393672410002797183347245503","date":"2025-08-05T21:00:21+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-23T13:56:47+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"169044011518888851559216769099816341529","date":"2025-06-09T08:58:48+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-06-09T03:42:01+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-03-27T14:24:14+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-03-27T14:23:34+00:00","index":"","fulltext":""},{"type":"submitted","content":"Quantum Information Processing","date":"2025-03-25T17:54:16+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"ca8de8f0-e9b8-4130-b9c9-3e8598c2bab5","owner":[],"postedDate":"June 11th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-04-24T15:54:14+00:00","versionOfRecord":[],"versionCreatedAt":"2025-06-11 09:13:04","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6306157","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6306157","identity":"rs-6306157","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}