Jan Nöller, Nikolai Miklin, Martin Kliesch, Mariami Gachechiladze
{"title":"维度假设下量子门的经典认证","authors":"Jan Nöller, Nikolai Miklin, Martin Kliesch, Mariami Gachechiladze","doi":"10.22331/q-2025-08-08-1825","DOIUrl":null,"url":null,"abstract":"The rapid advancement of quantum hardware necessitates the development of reliable methods to certify its correct functioning. However, existing certification tests fall short, as they either suffer from systematic errors or do not guarantee that only a correctly functioning quantum device can pass the test. We introduce a certification method for quantum gates tailored for a practical server-user scenario, where a classical user tests the results of exact quantum computations performed by a quantum server. This method is free from the systematic state preparation and measurement (SPAM) errors. For single-qubit gates, including those that form a universal set for single-qubit quantum computation, we demonstrate that our approach offers soundness guarantees based solely on the dimension assumption. Additionally, for a highly-relevant phase gate – which corresponds experimentally to a $\\pi/2$-pulse – we prove that the method's sample complexity scales as $\\mathrm{O}(\\varepsilon^{-1})$ relative to the average gate infidelity $\\varepsilon$. By combining the SPAM-error-free and sound notion of certification with practical applicability, our approach paves the way for promising research into efficient and reliable certification methods for full-scale quantum computation.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"57 1","pages":""},"PeriodicalIF":5.1000,"publicationDate":"2025-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Classical certification of quantum gates under the dimension assumption\",\"authors\":\"Jan Nöller, Nikolai Miklin, Martin Kliesch, Mariami Gachechiladze\",\"doi\":\"10.22331/q-2025-08-08-1825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid advancement of quantum hardware necessitates the development of reliable methods to certify its correct functioning. However, existing certification tests fall short, as they either suffer from systematic errors or do not guarantee that only a correctly functioning quantum device can pass the test. We introduce a certification method for quantum gates tailored for a practical server-user scenario, where a classical user tests the results of exact quantum computations performed by a quantum server. This method is free from the systematic state preparation and measurement (SPAM) errors. For single-qubit gates, including those that form a universal set for single-qubit quantum computation, we demonstrate that our approach offers soundness guarantees based solely on the dimension assumption. Additionally, for a highly-relevant phase gate – which corresponds experimentally to a $\\\\pi/2$-pulse – we prove that the method's sample complexity scales as $\\\\mathrm{O}(\\\\varepsilon^{-1})$ relative to the average gate infidelity $\\\\varepsilon$. By combining the SPAM-error-free and sound notion of certification with practical applicability, our approach paves the way for promising research into efficient and reliable certification methods for full-scale quantum computation.\",\"PeriodicalId\":20807,\"journal\":{\"name\":\"Quantum\",\"volume\":\"57 1\",\"pages\":\"\"},\"PeriodicalIF\":5.1000,\"publicationDate\":\"2025-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.22331/q-2025-08-08-1825\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.22331/q-2025-08-08-1825","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
Classical certification of quantum gates under the dimension assumption
The rapid advancement of quantum hardware necessitates the development of reliable methods to certify its correct functioning. However, existing certification tests fall short, as they either suffer from systematic errors or do not guarantee that only a correctly functioning quantum device can pass the test. We introduce a certification method for quantum gates tailored for a practical server-user scenario, where a classical user tests the results of exact quantum computations performed by a quantum server. This method is free from the systematic state preparation and measurement (SPAM) errors. For single-qubit gates, including those that form a universal set for single-qubit quantum computation, we demonstrate that our approach offers soundness guarantees based solely on the dimension assumption. Additionally, for a highly-relevant phase gate – which corresponds experimentally to a $\pi/2$-pulse – we prove that the method's sample complexity scales as $\mathrm{O}(\varepsilon^{-1})$ relative to the average gate infidelity $\varepsilon$. By combining the SPAM-error-free and sound notion of certification with practical applicability, our approach paves the way for promising research into efficient and reliable certification methods for full-scale quantum computation.
QuantumPhysics and Astronomy-Physics and Astronomy (miscellaneous)
CiteScore
9.20
自引率
10.90%
发文量
241
审稿时长
16 weeks
期刊介绍:
Quantum is an open-access peer-reviewed journal for quantum science and related fields. Quantum is non-profit and community-run: an effort by researchers and for researchers to make science more open and publishing more transparent and efficient.