{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T23:04:32Z","timestamp":1784329472154,"version":"3.55.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100016962","name":"Department of Science and Innovation, South Africa","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016962","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>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).<\/jats:p>","DOI":"10.1007\/s11128-026-05193-2","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T04:50:32Z","timestamp":1779079832000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A verification scheme for universal quantum computers"],"prefix":"10.1007","volume":"25","author":[{"given":"Anirudh","family":"Reddy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alain Giresse","family":"Tene","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Konrad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"5193_CR1","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134, (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"5193_CR2","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201996, pp. 212\u2013219. Association for Computing Machinery, New York (1996)","DOI":"10.1145\/237814.237866"},{"key":"5193_CR3","unstructured":"Jordan, S.: Quantum algorithm zoo: https:\/\/quantumalgorithmzoo.org\/ last ckeck: December.2024, original year: (2011)"},{"key":"5193_CR4","doi-asserted-by":"crossref","unstructured":"Suchara, M., Kubiatowicz, J., Faruque, A., Chong, F.T., Lai, C.-Y., Paz, G.: Qure: the quantum resource estimator toolbox. In: 2013 IEEE 31st International Conference on Computer Design (ICCD), pp. 419\u2013426, (2013)","DOI":"10.1109\/ICCD.2013.6657074"},{"key":"5193_CR5","unstructured":"Preskill, J.: Quantum computing and the entanglement frontier (2012)"},{"key":"5193_CR6","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 333\u2013342 (2011)","DOI":"10.1145\/1993636.1993682"},{"key":"5193_CR7","first-page":"154","volume":"96","author":"L Troyansky","year":"1996","unstructured":"Troyansky, L., Tishby, N.: On the quantum evaluation of the determinant and the permanent of a matrix. Proc. Phys. Comput 96, 154\u2013162 (1996)","journal-title":"Proc. Phys. Comput"},{"key":"5193_CR8","volume":"8","author":"J Bermejo-Vega","year":"2018","unstructured":"Bermejo-Vega, J., Hangleiter, D., Schwarz, M., Raussendorf, R., Eisert, J.: Architectures for quantum simulation showing a quantum speedup. Phys. Rev. X 8, 021010 (2018)","journal-title":"Phys. Rev. X"},{"issue":"6","key":"5193_CR9","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1038\/s41567-018-0124-x","volume":"14","author":"S Boixo","year":"2018","unstructured":"Boixo, S., Isakov, S.V., Smelyanskiy, V.N., Babbush, R., Ding, N., Jiang, Z., Bremner, M.J., Martinis, J.M., Neven, H.: Characterizing quantum supremacy in near-term devices. Nat. Phys. 14(6), 595\u2013600 (2018)","journal-title":"Nat. Phys."},{"issue":"4","key":"5193_CR10","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s00224-018-9872-3","volume":"63","author":"A Gheorghiu","year":"2019","unstructured":"Gheorghiu, A., Kapourniotis, T., Kashefi, E.: Verification of quantum computation: an overview of existing approaches. Theory Comput. Syst. 63(4), 715\u2013808 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"7446","key":"5193_CR11","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1038\/nature12035","volume":"496","author":"BW Reichardt","year":"2013","unstructured":"Reichardt, B.W., Unger, F., Vazirani, U.: Classical command of quantum systems. Nature 496(7446), 456\u2013460 (2013)","journal-title":"Nature"},{"key":"5193_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.040501","volume":"120","author":"JF Fitzsimons","year":"2018","unstructured":"Fitzsimons, J.F., Hajdu\u0161ek, M., Morimae, T.: Post hoc verification of quantum computation. Phys. Rev. Lett. 120, 040501 (2018)","journal-title":"Phys. Rev. Lett."},{"key":"5193_CR13","doi-asserted-by":"crossref","unstructured":"Natarajan, A., Vidick, T.: A quantum linearity test for robustly verifying entanglement. In: STOC 2017, pp. 1003\u20131015, Association for Computing Machinery, New York (2017)","DOI":"10.1145\/3055399.3055468"},{"key":"5193_CR14","unstructured":"Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interactive proofs for quantum computations. arXiv:1704.04487, (2017)"},{"key":"5193_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.012303","volume":"96","author":"JF Fitzsimons","year":"2017","unstructured":"Fitzsimons, J.F., Kashefi, E.: Unconditionally verifiable blind quantum computation. Phys. Rev. A 96, 012303 (2017)","journal-title":"Phys. Rev. A"},{"issue":"11","key":"5193_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a011","volume":"14","author":"A Broadbent","year":"2018","unstructured":"Broadbent, A.: How to verify a quantum computation. Theory Comput. 14(11), 1\u201337 (2018)","journal-title":"Theory Comput."},{"key":"5193_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.115.220502","volume":"115","author":"M Hayashi","year":"2015","unstructured":"Hayashi, M., Morimae, T.: Verifiable measurement-only blind quantum computing with stabilizer testing. Phys. Rev. Lett. 115, 220502 (2015)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"5193_CR18","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/2\/1\/015004","volume":"2","author":"D Hangleiter","year":"2017","unstructured":"Hangleiter, D., Kliesch, M., Schwarz, M., Eisert, J.: Direct certification of a class of quantum simulations. Quantum Sci. Technol. 2(1), 015004 (2017)","journal-title":"Quantum Sci. Technol."},{"issue":"2","key":"5193_CR19","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aa5cff","volume":"19","author":"A Gheorghiu","year":"2017","unstructured":"Gheorghiu, A., Wallden, P., Kashefi, E.: Rigidity of quantum steering and one-sided device-independent verifiable quantum computation. New J. Phys. 19(2), 023043 (2017)","journal-title":"New J. Phys."},{"key":"5193_CR20","unstructured":"Blume-Kohout, R., Proctor, T., Young, K.: Quantum characterization, verification, and validation. arXiv:2503.16383, 3 (2025)"},{"issue":"7779","key":"5193_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J.C., Barends, R., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"key":"5193_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.129.090502","volume":"129","author":"F Pan","year":"2022","unstructured":"Pan, F., Chen, K., Zhang, P.: Solving the sampling problem of the sycamore quantum circuits. Phys. Rev. Lett. 129, 090502 (2022)","journal-title":"Phys. Rev. Lett."},{"key":"5193_CR23","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.22331\/q-2024-05-08-1340","volume":"8","author":"Antonio Anna Mele","year":"2024","unstructured":"Antonio Anna Mele: Introduction to Haar measure tools in quantum information: a beginner\u2019s tutorial. Quantum 8, 1340 (2024)","journal-title":"Quantum"},{"key":"5193_CR24","unstructured":"Mehrani, M., Masoudi, K., Mezher, R., Kashefi, E., Sadhukhan, D.: Restricted randomized benchmarking with universal gates of fixed sequence length. arXiv:2405.05215, (2024)"},{"key":"5193_CR25","doi-asserted-by":"crossref","unstructured":"Schuster, T., Haferkamp, J., Huang, H.-Y.: Random unitaries in extremely low depth. arXiv:2407.07754, (2024)","DOI":"10.1126\/science.adv8590"},{"issue":"3","key":"5193_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.032328","volume":"100","author":"AW Cross","year":"2019","unstructured":"Cross, A.W., Bishop, L.S., Sheldon, S., Nation, P.D., Gambetta, J.M.: Validating quantum computers using randomized model circuits. Phys. Rev. A 100(3), 032328 (2019)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"5193_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022328","volume":"97","author":"H de Guise","year":"2018","unstructured":"de Guise, H., Matteo, D., S\u00e1nchez-Soto, L.L.: Simple factorization of unitary transformations. Phys. Rev. A 97(2), 022328 (2018)","journal-title":"Phys. Rev. A"},{"key":"5193_CR28","doi-asserted-by":"crossref","unstructured":"Meckes, E.S.: The random matrix theory of the classical compact groups. In: Cambridge Tracts in Mathematics. pp. 31\u201359. Cambridge University Press, (2019)","DOI":"10.1017\/9781108303453"},{"key":"5193_CR29","unstructured":"Mezzadri, F.: How to generate random matrices from the classical compact groups. arXiv preprint math-ph\/0609050, (2006)"},{"key":"5193_CR30","unstructured":"McKay, D.C., Hincks, I., Pritchett, E.J., Carroll, M., Govia, L.C.G., Merkel, S.T.: Benchmarking Quantum Processor Performance at Scale. arXiv:2311.05933, (2023)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05193-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05193-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05193-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T23:02:00Z","timestamp":1784329320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05193-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":30,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["5193"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05193-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-8492143\/v1","asserted-by":"object"}]},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,18]]},"assertion":[{"value":"31 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"175"}}