Verifiable multi-party delegated universal quantum computation against malicious participants

preprint OA: closed
Full text JSON View at publisher
Full text 12,472 characters · extracted from preprint-html · click to expand
Verifiable multi-party delegated universal quantum computation against malicious participants | 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 Verifiable multi-party delegated universal quantum computation against malicious participants Zimeng Yuan, Jing Li, Chun Long, Fan Yang, Yuhao Fu, Xingbo Pan This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7062010/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 5 You are reading this latest preprint version Abstract Delegated quantum computation (DQC) has emerged as a significant research focus to expedite the practical application of quantum advantage. Since substantial progress has been made in single-client DQC, extending these developments to multi-client settings naturally leads to the concept of multi-party delegated quantum computation (MPDQC). Existing MPDQC protocols predominantly rely on the prepare-and-send mode, while neglecting the receive-and-measure mode which is experimentally more practical. A key challenge hindering the adoption of the receive-and-measure mode in the multi-client scenario is the difficulty in verifying the local measurements of clients. In this paper, we address this obstacle and propose a verifiable MPDQC scheme tailored for multi-client settings. To enable federated computation among multiple clients, we construct a multi-client hypergraph state as the foundational resource state for MPDQC. Concurrently, we introduce a Pauli measurement verification protocol enabling the verification of client behavior within the multi-client framework, leveraging assistance from the quantum server. Building upon these advancements, we present a verifiable multiparty delegated universal quantum computation (MPDUQC) protocol and demonstrate its blindness and verifiability against malicious participants. Our work effectively bridges the gap for MPDQC protocols operating in the receive-and-measure paradigm. Multi-party delegated quantum computation Blind quantum computation Quantum verification Quantum hypergraph state Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviewers agreed at journal 18 Feb, 2026 Reviewers invited by journal 03 Feb, 2026 Editor assigned by journal 10 Jul, 2025 Submission checks completed at journal 10 Jul, 2025 First submitted to journal 07 Jul, 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-7062010","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":585230804,"identity":"910b8cd2-1a9a-4f48-9349-c43865cb5b52","order_by":0,"name":"Zimeng Yuan","email":"","orcid":"","institution":"University of Chinese Academy of Sciences","correspondingAuthor":false,"prefix":"","firstName":"Zimeng","middleName":"","lastName":"Yuan","suffix":""},{"id":585230805,"identity":"8c317e42-70c1-4bc7-a284-d44e4cf05f9c","order_by":1,"name":"Jing Li","email":"","orcid":"","institution":"Chinese Academy of Sciences","correspondingAuthor":false,"prefix":"","firstName":"Jing","middleName":"","lastName":"Li","suffix":""},{"id":585230806,"identity":"a85583c1-6f78-4899-9271-bedcc51c425d","order_by":2,"name":"Chun Long","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAsElEQVRIiWNgGAWjYPACCQZ+IHmANC2SDSRqYWAwIFo9/+zmbRI/d1jkGR8/e/DADwa7PMIuunOsTLL3jESx2Zm8hIM9DMnFhK25kWMmwdsmkbjtBo/BYaB3EhsI6ZAHapH8C9SyeQaxWgyAWqRBtmyQIFaL4Y20YmvZNoliiTM5Bgd7DJIJa5G7kbzx5tu2ujz+9jPGH35U2BHWAnIbiEhAYpOmZRSMglEwCkYBFgAAuT08d+OkvAgAAAAASUVORK5CYII=","orcid":"","institution":"University of Chinese Academy of Sciences","correspondingAuthor":true,"prefix":"","firstName":"Chun","middleName":"","lastName":"Long","suffix":""},{"id":585230807,"identity":"35601fd0-3d5c-4eda-9946-031a555c7a6a","order_by":3,"name":"Fan Yang","email":"","orcid":"","institution":"Chinese Academy of Sciences","correspondingAuthor":false,"prefix":"","firstName":"Fan","middleName":"","lastName":"Yang","suffix":""},{"id":585230808,"identity":"73cc2d71-7f13-4c49-8e9e-c7fca9f0ad95","order_by":4,"name":"Yuhao Fu","email":"","orcid":"","institution":"Chinese Academy of Sciences","correspondingAuthor":false,"prefix":"","firstName":"Yuhao","middleName":"","lastName":"Fu","suffix":""},{"id":585230809,"identity":"c0d70f7c-a97d-4e40-be66-295b3d9bb37e","order_by":5,"name":"Xingbo Pan","email":"","orcid":"","institution":"Tsinghua University","correspondingAuthor":false,"prefix":"","firstName":"Xingbo","middleName":"","lastName":"Pan","suffix":""}],"badges":[],"createdAt":"2025-07-07 06:38:40","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7062010/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7062010/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":102295592,"identity":"bf02b968-f8d0-4eb1-8ba9-6fae80f8d206","added_by":"auto","created_at":"2026-02-10 10:12:58","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":435881,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7062010/v1_covered_c3257668-dedd-417c-ac7a-f88b9090d214.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Verifiable multi-party delegated universal quantum computation against malicious participants","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":"Multi-party delegated quantum computation, Blind quantum computation, Quantum verification, Quantum hypergraph state","lastPublishedDoi":"10.21203/rs.3.rs-7062010/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7062010/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eDelegated quantum computation (DQC) has emerged as a significant research focus to expedite the practical application of quantum advantage. Since substantial progress has been made in single-client DQC, extending these developments to multi-client settings naturally leads to the concept of multi-party delegated quantum computation (MPDQC). Existing MPDQC protocols predominantly rely on the prepare-and-send mode, while neglecting the receive-and-measure mode which is experimentally more practical. A key challenge hindering the adoption of the receive-and-measure mode in the multi-client scenario is the difficulty in verifying the local measurements of clients. In this paper, we address this obstacle and propose a verifiable MPDQC scheme tailored for multi-client settings. To enable federated computation among multiple clients, we construct a multi-client hypergraph state as the foundational resource state for MPDQC. Concurrently, we introduce a Pauli measurement verification protocol enabling the verification of client behavior within the multi-client framework, leveraging assistance from the quantum server. Building upon these advancements, we present a verifiable multiparty delegated universal quantum computation (MPDUQC) protocol and demonstrate its blindness and verifiability against malicious participants. Our work effectively bridges the gap for MPDQC protocols operating in the receive-and-measure paradigm.\u003c/p\u003e","manuscriptTitle":"Verifiable multi-party delegated universal quantum computation against malicious participants","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-02-05 19:55:13","doi":"10.21203/rs.3.rs-7062010/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"reviewerAgreed","content":"88196953835164091867366919611630187034","date":"2026-02-18T17:43:34+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-03T17:58:39+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-07-11T00:57:37+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-07-11T00:57:21+00:00","index":"","fulltext":""},{"type":"submitted","content":"Quantum Information Processing","date":"2025-07-07T06:34:53+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":"cccdf5f5-c2ea-48e1-b8ec-518966dd8f45","owner":[],"postedDate":"February 5th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-02-05T19:55:13+00:00","versionOfRecord":[],"versionCreatedAt":"2026-02-05 19:55:13","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7062010","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7062010","identity":"rs-7062010","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