{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:13:01Z","timestamp":1778731981830,"version":"3.51.4"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation of Singapore","doi-asserted-by":"crossref","award":["NRF2020-NRF-ISF004-3528"],"award-info":[{"award-number":["NRF2020-NRF-ISF004-3528"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["11747601 and 11975294"],"award-info":[{"award-number":["11747601 and 11975294"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2024,12,31]]},"abstract":"<jats:p>Efficient simulation of quantum circuits has become indispensable with the rapid development of quantum hardware. The primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows larger in current quantum devices, traditional state-vector-based quantum circuit simulation methods prove inadequate due to the overwhelming size of the Hilbert space and extensive entanglement. Consequently, brutal force tensor network simulation algorithms become the only viable solution in such scenarios. The two main challenges faced in tensor network simulation algorithms are optimal contraction path finding and efficient execution on modern computing devices, with the latter determining the actual efficiency. In this study, we investigate the optimization of such tensor network simulations on modern GPUs and propose general optimization strategies from two aspects: computational efficiency and accuracy. First, we propose to transform critical Einstein summation operations into GEMM operations, leveraging the specific features of tensor network simulations to amplify the efficiency of GPUs. Second, by analyzing the data characteristics of quantum circuits, we employ extended precision to ensure the accuracy of simulation results and mixed precision to fully exploit the potential of GPUs, resulting in faster and more precise simulations. Our numerical experiments demonstrate that our approach can achieve a 3.96\u00d7 reduction in verification time for random quantum circuit samples in the 18-cycle case of Sycamore, with sustained performance exceeding 21 TFLOPS on one A100. This method can be easily extended to the 20-cycle case, maintaining the same performance, accelerating by 12.5\u00d7 compared to the state-of-the-art CPU-based results and 4.48\u20136.78\u00d7 compared to the state-of-the-art GPU-based results reported in the literature. Furthermore, the strategies presented in this article hold general applicability for accelerating problems that can be tackled by contracting tensor networks such as graphical models and combinatorial optimizations.<\/jats:p>","DOI":"10.1145\/3696465","type":"journal-article","created":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T10:49:31Z","timestamp":1727088571000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern GPUs"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1850-6520","authenticated-orcid":false,"given":"Feng","family":"Pan","sequence":"first","affiliation":[{"name":"Institute of Theoretical Physics Chinese Academy of Sciences, Haidian-qu, China and Centre for Quantum Technologies, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1166-4243","authenticated-orcid":false,"given":"Hanfeng","family":"Gu","sequence":"additional","affiliation":[{"name":"NVIDIA, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4492-6803","authenticated-orcid":false,"given":"Lvlin","family":"Kuang","sequence":"additional","affiliation":[{"name":"NVIDIA, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3808-4708","authenticated-orcid":false,"given":"Bing","family":"Liu","sequence":"additional","affiliation":[{"name":"NVIDIA, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8496-2730","authenticated-orcid":false,"given":"Pan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Theoretical Physics Chinese Academy of Sciences, Haidian-qu, China, University of the Chinese Academy of Sciences Hangzhou Institute for Advanced Study, Hangzhou, China and International center for Theoretical physics Asia-Pacific, Beijing\/Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,13]]},"reference":[{"key":"e_1_3_3_2_2","first-page":"333","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing","author":"Aaronson Scott","year":"2011","unstructured":"Scott Aaronson and Alex Arkhipov. 2011. The computational complexity of linear optics. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing. 333\u2013342. DOI:10.4086\/toc.2013.v009a004"},{"key":"e_1_3_3_3_2","unstructured":"Scott Aaronson and Lijie Chen. 2016. Complexity-theoretic foundations of quantum supremacy experiments. arxiv:1612.05903 [quant-ph]."},{"key":"e_1_3_3_4_2","article-title":"Certified randomness from quantum supremacy","author":"Aaronson Scott","year":"2023","unstructured":"Scott Aaronson and Shih-Han Hung. 2023. Certified randomness from quantum supremacy. arXiv:2303.01625","journal-title":"arXiv:2303.01625"},{"key":"e_1_3_3_5_2","doi-asserted-by":"crossref","unstructured":"Dorit Aharonov Xun Gao Zeph Landau Yunchao Liu and Umesh Vazirani. 2022. A polynomial-time classical algorithm for noisy random circuit sampling. arxiv:arXiv:2211.03999","DOI":"10.1145\/3564246.3585234"},{"issue":"3","key":"e_1_3_3_6_2","doi-asserted-by":"crossref","first-page":"030503","DOI":"10.1103\/PhysRevLett.121.030503","article-title":"Using Gaussian Boson sampling to find dense subgraphs","volume":"121","author":"Arrazola Juan Miguel","year":"2018","unstructured":"Juan Miguel Arrazola and Thomas R. Bromley. 2018. Using Gaussian Boson sampling to find dense subgraphs. Phys. Rev. Lett. 121, 3 (2018), 030503.","journal-title":"Phys. Rev. Lett."},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_3_8_2","article-title":"Spoofing linear cross-entropy benchmarking in shallow quantum circuits","author":"Barak Boaz","year":"2020","unstructured":"Boaz Barak, Chi-Ning Chou, and Xun Gao. 2020. Spoofing linear cross-entropy benchmarking in shallow quantum circuits. Retrieved from https:\/\/arxiv.org\/abs\/2005.02421","journal-title":"R"},{"key":"e_1_3_3_9_2","article-title":"On certified randomness from quantum advantage experiments","author":"Bassirian Roozbeh","year":"2021","unstructured":"Roozbeh Bassirian, Adam Bouland, Bill Fefferman, Sam Gunn, and Avishay Tal. 2021. On certified randomness from quantum advantage experiments. arXiv preprint arXiv:2111.14846","journal-title":"arXiv preprint arXiv:2111.14846"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-018-0124-x"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.90.032326"},{"key":"e_1_3_3_12_2","unstructured":"Jianxin Chen Fang Zhang Cupjin Huang Michael Newman and Yaoyun Shi. 2018. Classical simulation of intermediate-size quantum circuits. arxiv:1805.01450 [quant-ph]."},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.3.023005"},{"issue":"2","key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MM.2021.3061394","article-title":"Nvidia A100 Tensor Core GPU: Performance and innovation","volume":"41","author":"Choquette Jack","year":"2021","unstructured":"Jack Choquette, Wishwesh Gandhi, Olivier Giroux, Nick Stam, and Ronny Krashinsky. 2021. Nvidia A100 Tensor Core GPU: Performance and innovation. IEEE Micro 41, 2 (2021), 29\u201335.","journal-title":"IEEE Micro"},{"issue":"2","key":"e_1_3_3_15_2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/MCSE.2022.3163817","article-title":"Nvidia Hopper GPU and Grace CPU highlights","volume":"24","author":"Elster Anne C.","year":"2022","unstructured":"Anne C. Elster and Tor A. Haugdahl. 2022. Nvidia Hopper GPU and Grace CPU highlights. Comput. Sci. Eng. 24, 2 (2022), 95\u2013100.","journal-title":"Comput. Sci. Eng."},{"key":"e_1_3_3_16_2","article-title":"A quantum approximate optimization algorithm","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","journal-title":"arXiv preprint arXiv:1411.4028"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02650179"},{"key":"e_1_3_3_18_2","unstructured":"Xun Gao Marcin Kalinowski Chi-Ning Chou Mikhail D. Lukin Boaz Barak and Soonwon Choi. 2021. Limitations of linear cross-entropy as a measure for quantum advantage. arxiv:2112.01657 [cond-mat physics:quant-ph]."},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-03-15-410"},{"key":"e_1_3_3_20_2","first-page":"212","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"Grover Lov K.","year":"1996","unstructured":"Lov K. Grover. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. 212\u2013219."},{"key":"e_1_3_3_21_2","volume-title":"Sycamore Verification","author":"Gu Hanfeng","year":"2023","unstructured":"Hanfeng Gu. 2023. Sycamore Verification. Retrieved from https:\/\/github.com\/Hanfeng23\/Sycamore_verification"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.170501"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-021-00119-7"},{"key":"e_1_3_3_24_2","article-title":"cutt: A high-performance tensor transpose library for CUDA compatible GPUs","author":"Hynninen Antti-Pekka","year":"2017","unstructured":"Antti-Pekka Hynninen and Dmitry I. Lyakh. 2017. cutt: A high-performance tensor transpose library for CUDA compatible GPUs. arXiv preprint arXiv:1705.01598","journal-title":"arXiv preprint arXiv:1705.01598"},{"key":"e_1_3_3_25_2","unstructured":"Gleb Kalachev Pavel Panteleev and Man-Hong Yung. 2021. Recursive multi-tensor contraction for XEB verification of quantum circuits. arxiv:2108.05665 [quant-ph]."},{"key":"e_1_3_3_26_2","unstructured":"Gleb Kalachev Pavel Panteleev PengFei Zhou and Man-Hong Yung. 2021. Classical sampling of random quantum circuits with bounded fidelity. arxiv:2112.15083 [quant-ph]."},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.21468\/SciPostPhys.7.5.060"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","unstructured":"Jin-Guo Liu Xun Gao Madelyn Cain Mikhail D. Lukin and Sheng-Tao Wang. 2022. Computing solution space properties of combinatorial optimization problems via generic tensor networks. DOI:10.48550\/ARXIV.2205.03718","DOI":"10.48550\/ARXIV.2205.03718"},{"key":"e_1_3_3_29_2","unstructured":"Yong Liu Yaojian Chen Chu Guo Jiawei Song Xinmin Shi Lin Gan Wenzhao Wu Wei Wu Haohuan Fu Xin Liu Dexun Chen Guangwen Yang and Jiangang Gao. 2022. Validating quantum-supremacy experiments with exact and fast tensor network contraction. arxiv:arXiv:2212.04749"},{"key":"e_1_3_3_30_2","first-page":"1","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Liu Yong (Alexander)","year":"2021","unstructured":"Yong (Alexander) Liu, Xin (Lucy) Liu, Fang (Nancy) Li, Haohuan Fu, Yuling Yang, Jiawei Song, Pengpeng Zhao, Zhen Wang, Dajia Peng, Huarong Chen, Chu Guo, Heliang Huang, Wenzhao Wu, and Dexun Chen. 2021. Closing the \u201cquantum supremacy\u201d gap: Achieving real-time simulation of a random quantum circuit using a new Sunway supercomputer. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM, 1\u201312. DOI:10.1145\/3458817.3487399"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-04725-x"},{"key":"e_1_3_3_32_2","first-page":"522","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW\u201918)","author":"Markidis Stefano","year":"2018","unstructured":"Stefano Markidis, Steven Wei Der Chien, Erwin Laure, Ivy Bo Peng, and Jeffrey S. Vetter. 2018. Nvidia tensor core programmability, performance & precision. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW\u201918). IEEE, 522\u2013531."},{"key":"e_1_3_3_33_2","unstructured":"Igor L. Markov Aneeqa Fatima Sergei V. Isakov and Sergio Boixo. 2018. Quantum supremacy is both closer and farther than it appears. arxiv:1807.10749 [quant-ph]."},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/050644756"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.5061\/dryad.k6t1rj8"},{"key":"e_1_3_3_36_2","volume-title":"CUTLASS 2.8","year":"2019","unstructured":"NVIDIA. 2019. CUTLASS 2.8. Retrieved from https:\/\/github.com\/NVIDIA\/cutlass\/discussions\/385"},{"key":"e_1_3_3_37_2","volume-title":"NVIDIA DGX A100 System Architecture","year":"2020","unstructured":"NVIDIA. 2020. NVIDIA DGX A100 System Architecture. Retrieved from https:\/\/images.nvidia.com\/aem-dam\/en-zz\/Solutions\/data-center\/dgx-a100\/dgxa100-system-architecture-white-paper.pdf"},{"key":"e_1_3_3_38_2","article-title":"CUBLAS LIBRARY user guide v12.1","year":"2023","unstructured":"NVIDIA. 2023. CUBLAS LIBRARY user guide v12.1. CUDA Toolkit Documentation. Retrieved from https:\/\/docs.nvidia.com\/cuda\/cublas\/index.html","journal-title":"CUDA Toolkit Documentation"},{"key":"e_1_3_3_39_2","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"10:1\u201310:19","volume-title":"Proceedings of the 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC\u201919)","volume":"135","author":"O\u2019Gorman Bryan","year":"2019","unstructured":"Bryan O\u2019Gorman. 2019. Parameterization of tensor network contraction. In Proceedings of the 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC\u201919)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 135), Wim van Dam and Laura Man\u010dinska (Eds.). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 10:1\u201310:19. DOI:10.4230\/LIPIcs.TQC.2019.10"},{"key":"e_1_3_3_40_2","article-title":"Quantum circuit simulation by SGEMM emulation on tensor cores and automatic precision selection","author":"Ootomo Hiryuki","year":"2023","unstructured":"Hiryuki Ootomo, Hidetaka Manabe, Kenji Harada, and Rio Yokota. 2023. Quantum circuit simulation by SGEMM emulation on tensor cores and automatic precision selection. arXiv preprint arXiv:2303.08989","journal-title":"arXiv preprint arXiv:2303.08989"},{"issue":"4","key":"e_1_3_3_41_2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1177\/10943420221090256","article-title":"Recovering single precision accuracy from Tensor Cores while surpassing the FP32 theoretical peak performance","volume":"36","author":"Ootomo Hiroyuki","year":"2022","unstructured":"Hiroyuki Ootomo and Rio Yokota. 2022. Recovering single precision accuracy from Tensor Cores while surpassing the FP32 theoretical peak performance. Int. J. High Perform. Comput. Applic. 36, 4 (2022), 475\u2013491.","journal-title":"Int. J. High Perform. Comput. Applic."},{"key":"e_1_3_3_42_2","volume-title":"artensor","author":"Pan Feng","year":"2023","unstructured":"Feng Pan. 2023. artensor. Retrieved from https:\/\/github.com\/Fanerst\/artensor"},{"issue":"9","key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"090502","DOI":"10.1103\/PhysRevLett.129.090502","article-title":"Solving the sampling problem of the Sycamore quantum circuits","volume":"129","author":"Pan Feng","year":"2022","unstructured":"Feng Pan, Keyang Chen, and Pan Zhang. 2022. Solving the sampling problem of the Sycamore quantum circuits. Phys. Rev. Lett. 129, 9 (2022), 090502.","journal-title":"Phys. Rev. Lett."},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.128.030501"},{"issue":"1","key":"e_1_3_3_45_2","doi-asserted-by":"crossref","first-page":"4213","DOI":"10.1038\/ncomms5213","article-title":"A variational eigenvalue solver on a photonic quantum processor","volume":"5","author":"Peruzzo Alberto","year":"2014","unstructured":"Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Al\u00e1n Aspuru-Guzik, and Jeremy L. O\u2019Brien. 2014. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 1 (2014), 4213.","journal-title":"Nat. Commun."},{"issue":"2","key":"e_1_3_3_46_2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1103\/PhysRev.104.483","article-title":"Fluctuations of nuclear reaction widths","volume":"104","author":"Porter Charles E.","year":"1956","unstructured":"Charles E. Porter and Robert G. Thomas. 1956. Fluctuations of nuclear reaction widths. Phys. Rev. 104, 2 (1956), 483.","journal-title":"Phys. Rev."},{"key":"e_1_3_3_47_2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum computing in the NISQ era and beyond","volume":"2","author":"Preskill John","year":"2018","unstructured":"John Preskill. 2018. Quantum computing in the NISQ era and beyond. Quantum 2 (2018), 79.","journal-title":"Quantum"},{"key":"e_1_3_3_48_2","unstructured":"Elina Robeva and Anna Seigal. 2017. Duality of graphical models and tensor networks. arxiv:1710.01437 [quant-ph stat]."},{"key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science","author":"Shor Peter W.","year":"1994","unstructured":"Peter W. Shor. 1994. Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE, 124\u2013134."},{"key":"e_1_3_3_50_2","volume-title":"High-performance Tensor Operations: Tensor Transpositions, Spin Summations, and Tensor Contractions","author":"Springer Paul","year":"2019","unstructured":"Paul Springer, Paolo Bientinesi, and Gerhard Wellein. 2019. High-performance Tensor Operations: Tensor Transpositions, Spin Summations, and Tensor Contractions. Technical Report. Fachgruppe Informatik."},{"key":"e_1_3_3_51_2","volume-title":"Proceedings of the NVIDIA GPU Technology Conference","author":"Springer Paul","year":"2019","unstructured":"Paul Springer and Chen-Han Yu. 2019. cuTENSOR: High-performance CUDA tensor primitives. In Proceedings of the NVIDIA GPU Technology Conference."},{"key":"e_1_3_3_52_2","first-page":"578","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201918)","author":"Vedurada Jyothi","year":"2018","unstructured":"Jyothi Vedurada, Arjun Suresh, Aravind Sukumaran Rajam, Jinsung Kim, Changwan Hong, Ajay Panyala, Sriram Krishnamoorthy, V. Krishna Nandivada, Rohit Kumar Srivastava, and P. Sadayappan. 2018. TTLG\u2014An efficient tensor transposition library for GPUs. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201918). IEEE, 578\u2013588."},{"issue":"18","key":"e_1_3_3_53_2","doi-asserted-by":"crossref","first-page":"180501","DOI":"10.1103\/PhysRevLett.127.180501","article-title":"Strong quantum computational advantage using a superconducting quantum processor","volume":"127","year":"2021","unstructured":"Yulin Wu, Wan-Su Bao, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, Cheng Guo, Chu Guo, Shaojun Guo, Lianchen Han, Linyin Hong, He-Liang Huang, Yong-Heng Huo, Liping Li, Na Li, Shaowei Li, Yuan Li, Futian Liang, Chun Lin, Jin Lin, Haoran Qian, Dan Qiao, Hao Rong, Hong Su, Lihua Sun, Liangyuan Wang, Shiyu Wang, Dachao Wu, Yu Xu, Kai Yan, Weifeng Yang, Yang Yang, Yangsen Ye, Jianghan Yin, Chong Ying, Jiale Yu, Chen Zha, Cha Zhang, Haibin Zhang, Kaili Zhang, Yiming Zhang, Han Zhao, Youwei Zhao, Liang Zhou, Qingling Zhu, Chao-Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, and Jian-Wei Pan. 2021. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett. 127, 18 (2021), 180501.","journal-title":"Phys. Rev. Lett."},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.abe8770"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.041038"},{"issue":"3","key":"e_1_3_3_56_2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.scib.2021.10.017","article-title":"Quantum computational advantage via 60-Qubit 24-Cycle Random Circuit Sampling","volume":"67","year":"2022","unstructured":"Qingling Zhu, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, Cheng Guo, Chu Guo, Shaojun Guo, Lianchen Han, Linyin Hong, He-Liang Huang, Yong-Heng Huo, Liping Li, Na Li, Shaowei Li, Yuan Li, Futian Liang, Chun Lin, Jin Lin, Haoran Qian, Dan Qiao, Hao Rong, Hong Su, Lihua Sun, Liangyuan Wang, Shiyu Wang, Dachao Wu, Yulin Wu, Yu Xu, Kai Yan, Weifeng Yang, Yang Yang, Yangsen Ye, Jianghan Yin, Chong Ying, Jiale Yu, Chen Zha, Cha Zhang, Haibin Zhang, Kaili Zhang, Yiming Zhang, Han Zhao, Youwei Zhao, Liang Zhou, Chao-Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, and Jian-Wei Pan. 2022. Quantum computational advantage via 60-Qubit 24-Cycle Random Circuit Sampling. Sci. Bull. 67, 3 (2022), 240\u2013245.","journal-title":"Sci. Bull."}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:14Z","timestamp":1750295414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,13]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12,31]]}},"alternative-id":["10.1145\/3696465"],"URL":"https:\/\/doi.org\/10.1145\/3696465","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,13]]},"assertion":[{"value":"2023-10-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-31","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}