{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T12:03:47Z","timestamp":1766232227031,"version":"3.48.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"name":"NSF award","award":["FET-2243659"],"award-info":[{"award-number":["FET-2243659"]}]},{"name":"Google Scholar Award, and DOE award","award":["DE-SC0024301"],"award-info":[{"award-number":["DE-SC0024301"]}]},{"name":"US National Science Foundation QLCI program","award":["OMA-2016245"],"award-info":[{"award-number":["OMA-2016245"]}]},{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"crossref","award":["CCF-2054758 (CAREER) and CCF-2224131"],"award-info":[{"award-number":["CCF-2054758 (CAREER) and CCF-2224131"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62332009, 12347104"],"award-info":[{"award-number":["62332009, 12347104"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Quantum Science and Technology-National Science and Technology Major Project","award":["2021ZD0302901"],"award-info":[{"award-number":["2021ZD0302901"]}]},{"name":"NSFC\/RGC Joint Research Scheme","award":["12461160276"],"award-info":[{"award-number":["12461160276"]}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20243060"],"award-info":[{"award-number":["BK20243060"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>\n                    In recent years, achieving verifiable quantum advantage on a NISQ device has emerged as an important open problem in quantum information. The sampling-based quantum advantages are not known to have efficient verification methods. This article investigates the verification of quantum advantage from a cryptographic perspective. We establish a strong connection between the verifiability of quantum advantage and cryptographic and complexity primitives, including efficiently samplable, statistically far but computationally indistinguishable pairs of (mixed) quantum states (\n                    <jats:sans-serif>EFI<\/jats:sans-serif>\n                    ), pseudorandom states (\n                    <jats:sans-serif>PRS<\/jats:sans-serif>\n                    ), and variants of minimum circuit size problems (\n                    <jats:sans-serif>MCSP<\/jats:sans-serif>\n                    ). Specifically, we prove that a) a sampling-based quantum advantage is either verifiable or can be used to build\n                    <jats:sans-serif>EFI<\/jats:sans-serif>\n                    and even\n                    <jats:sans-serif>PRS<\/jats:sans-serif>\n                    and b) polynomial-time algorithms for a variant of\n                    <jats:sans-serif>MCSP<\/jats:sans-serif>\n                    would imply efficient verification of quantum advantages. Our work shows that the quest for verifiable quantum advantages may lead to applications of quantum cryptography, and the construction of quantum primitives can provide new insights into the verifiability of quantum advantages.\n                  <\/jats:p>","DOI":"10.1145\/3773903","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T11:25:15Z","timestamp":1761650715000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Cryptographic Perspective on the Verifiability of Quantum Advantage"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4138-7956","authenticated-orcid":false,"given":"Nai-Hui","family":"Chia","sequence":"first","affiliation":[{"name":"Computer Science Department, Rice University","place":["Houston, United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1934-3391","authenticated-orcid":false,"given":"Honghao","family":"Fu","sequence":"additional","affiliation":[{"name":"Concordia Institute of Information Systems Engineering, Concordia University","place":["Montreal, Canada"]},{"name":"CSAIL, MIT","place":["Montreal, Canada"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3098-6451","authenticated-orcid":false,"given":"Fang","family":"Song","sequence":"additional","affiliation":[{"name":"Computer Science Department, Portland State University","place":["Portland, United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4104-2069","authenticated-orcid":false,"given":"Penghui","family":"Yao","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University","place":["Nanjing, China"]},{"name":"Hefei National Laboratory","place":["Nanjing, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a004"},{"key":"e_1_3_2_3_2","volume-title":"15th Innovations in Theoretical Computer Science Conference (ITCS 2024)","author":"Aaronson Scott","year":"2024","unstructured":"Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh Vazirani, Chenyi Zhang, and Zixin Zhou. 2024. Quantum pseudoentanglement. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_4_2","volume-title":"Proceedings of the 32nd Computational Complexity Conference (CCC \u201917)","author":"Aaronson Scott","year":"2017","unstructured":"Scott Aaronson and Lijie Chen. 2017. Complexity-theoretic foundations of quantum supremacy experiments. In Proceedings of the 32nd Computational Complexity Conference (CCC \u201917). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, DEU, Article 22, 67 pages."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2020.v016a011"},{"key":"e_1_3_2_6_2","first-page":"453","volume-title":"Innovations in Computer Science - ICS 2010","author":"Aharonov Dorit","year":"2010","unstructured":"Dorit Aharonov, Michael Ben-Or, and Elad Eban. 2010. Interactive proofs for quantum computations. In Innovations in Computer Science - ICS 2010, Andrew Chi-Chih Yao (Ed.). Tsinghua University Press, 453\u2013469. Retrieved from http:\/\/conference.iiis.tsinghua.edu.cn\/ICS2010\/content\/papers\/35.html"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585234"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64381-2_6"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91098-2_2"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-018-0124-x"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2023.24"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3441309"},{"key":"e_1_3_2_13_2","volume-title":"15th Conference on the Theory of Quantum Computation, Communication and Cryptography","author":"Brakerski Zvika","year":"2020","unstructured":"Zvika Brakerski, Venkata Koppula, Umesh Vazirani, and Thomas Vidick. 2020. Simpler proofs of quantumness. In 15th Conference on the Theory of Quantum Computation, Communication and Cryptography."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_10"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_15"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-016-2706-8"},{"key":"e_1_3_2_17_2","unstructured":"Michael J. Bremner Bin Cheng and Zhengfeng Ji. 2023. IQP sampling and verifiable quantum advantage: Stabilizer scheme and classical security. arXiv:2308.07152. Retrieved from https:\/\/arxiv.org\/abs\/2308.07152"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.36"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_17"},{"key":"e_1_3_2_20_2","volume-title":"13th Innovations in Theoretical Computer Science Conference (ITCS 2022)","author":"Chia Nai-Hui","year":"2022","unstructured":"Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, and Ruizhe Zhang. 2022. Quantum meets the minimum circuit size problem. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68394-7_8"},{"key":"e_1_3_2_22_2","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv:1411.4028. Retrieved from https:\/\/arxiv.org\/abs\/1411.4028"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-06-30-753"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.5.010334"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90010-U"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.95.035001"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.122.210502"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_5"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-022-01643-7"},{"key":"e_1_3_2_31_2","volume-title":"16th Conference on the Theory of Quantum Computation, Communication and Cryptography","author":"Kretschmer William","year":"2021","unstructured":"William Kretschmer. 2021. Quantum pseudorandomness and classical complexity. In 16th Conference on the Theory of Quantum Computation, Communication and Cryptography."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585225"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1015957395"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/20m1371828"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.128.030501"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195134"},{"key":"e_1_3_2_38_2","unstructured":"Dan Shepherd and Michael J Bremner. 2008. Instantaneous quantum computation. arXiv:0809.0847. Retrieved from https:\/\/arxiv.org\/abs\/0809.0847"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3773903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T11:59:02Z","timestamp":1766231942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3773903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,20]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3773903"],"URL":"https:\/\/doi.org\/10.1145\/3773903","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"type":"print","value":"2643-6809"},{"type":"electronic","value":"2643-6817"}],"subject":[],"published":{"date-parts":[[2025,12,20]]},"assertion":[{"value":"2024-12-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-14","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}