A verification scheme for universal quantum computers

A verification scheme for universal quantum computers | 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 A verification scheme for universal quantum computers Anirudh Reddy, Alain Giresse TENE, Thomas Konrad This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8492143/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 6 You are reading this latest preprint version Abstract We present a new verification scheme for universal quantum computers that yields the number of working qubits and measures the noise expected when executing quantum circuits. It is based on detecting the standard deviation of the meta probability distribution of output values for a single qubit probed by random quantum gates involving all the qubits of the quantum computer. This result is generated directly from the output statistics of the quantum computer and thus does not require any assistance from classical computers. With current technology quantum computers with up to 40 qubits could be tested employing this method, but in future, given faster quantum processors, it might be used to demonstrate quantum supremacy. Our results have been successfully demonstrated on a real quantum computer (IBM-Cairo). Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 12 Mar, 2026 Reviewers agreed at journal 08 Mar, 2026 Reviewers invited by journal 04 Feb, 2026 Editor assigned by journal 30 Jan, 2026 Submission checks completed at journal 03 Jan, 2026 First submitted to journal 31 Dec, 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-8492143","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":585740397,"identity":"59435c44-289c-4b92-a039-a1f66a0955e2","order_by":0,"name":"Anirudh Reddy","email":"","orcid":"","institution":"University of KwaZulu-Natal","correspondingAuthor":false,"prefix":"","firstName":"Anirudh","middleName":"","lastName":"Reddy","suffix":""},{"id":585740398,"identity":"2240205f-fe0f-47e8-825e-9e61769d1dfb","order_by":1,"name":"Alain Giresse TENE","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAu0lEQVRIiWNgGAWjYNCCCgYD4hXzgMkzJGthbCNFiz1778EHP+cdNpaf3cD44QdDnTxhW3jOJRv2bjtsxjjnALNkDwObYQNBLRI5ZhK82w7bMEskMEgD+YyEtci/Mf/5d85hGzaJBObfDAwS9kTYwmPGzNtw2IxHIoENaItBImEtZ3KMpWWOpRtLSCS2WfYYJCQT1MLefsbw45saa8P5M5IP3/hRUWdLUAsSAHmchOgZBaNgFIyCUYAHAADIpzF/Sn2m6wAAAABJRU5ErkJggg==","orcid":"","institution":"University of KwaZulu-Natal","correspondingAuthor":true,"prefix":"","firstName":"Alain","middleName":"Giresse","lastName":"TENE","suffix":""},{"id":585740399,"identity":"1c02a244-24e3-4ae3-806c-1142341b52b0","order_by":2,"name":"Thomas Konrad","email":"","orcid":"","institution":"University of KwaZulu-Natal","correspondingAuthor":false,"prefix":"","firstName":"Thomas","middleName":"","lastName":"Konrad","suffix":""}],"badges":[],"createdAt":"2025-12-31 20:38:13","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8492143/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8492143/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":102163728,"identity":"7704de7e-88da-4b70-b25c-f691c9494740","added_by":"auto","created_at":"2026-02-09 01:16:31","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":465437,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptVVQCschemesubmittedversion.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8492143/v1_covered_5f604ea7-424b-43c2-b53f-4f34e5ea009d.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A verification scheme for universal quantum computers","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"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":"","lastPublishedDoi":"10.21203/rs.3.rs-8492143/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8492143/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"We present a new verification scheme for universal quantum computers that yields the number of working qubits and measures the noise expected when executing quantum circuits. It is based on detecting the standard deviation of the meta probability distribution of output values for a single qubit probed by random quantum gates involving all the qubits of the quantum computer. This result is generated directly from the output statistics of the quantum computer and thus does not require any assistance from classical computers. With current technology quantum computers with up to 40 qubits could be tested employing this method, but in future, given faster quantum processors, it might be used to demonstrate quantum supremacy. Our results have been successfully demonstrated on a real quantum computer (IBM-Cairo).","manuscriptTitle":"A verification scheme for universal quantum computers","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-02-09 01:16:12","doi":"10.21203/rs.3.rs-8492143/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-03-12T17:10:55+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"77796852294074303193244733780250417850","date":"2026-03-08T15:07:50+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-04T13:36:39+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-01-30T13:24:09+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-01-03T08:10:13+00:00","index":"","fulltext":""},{"type":"submitted","content":"Quantum Information Processing","date":"2025-12-31T20:35:15+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":"a3c2fd80-2f60-4cb9-b664-e0ee1d0d7da2","owner":[],"postedDate":"February 9th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-04-23T21:53:28+00:00","versionOfRecord":[],"versionCreatedAt":"2026-02-09 01:16:12","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8492143","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8492143","identity":"rs-8492143","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}