{"paper":{"title":"Strong quantum computational advantage using a superconducting quantum processor","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao-Yang Lu, Cha Zhang, Cheng Guo, Cheng-Zhi Peng, Chen Zha, Chong Ying, Chu Guo, Chun Lin, Dachao Wu, Dan Qiao, Daojin Fan, Fusheng Chen, Futian Liang, Haibin Zhang, Han Zhao, Haoran Qian, Hao Rong, He-Liang Huang, Hong Su, Hui Deng, Jiale Yu, Jianghan Yin, Jian-Wei Pan, Jin Lin, Kaili Zhang, Kai Yan, Lianchen Han, Liangyuan Wang, Liang Zhou, Lihua Sun, Linyin Hong, Liping Li, Ming-Cheng Chen, Ming Gong, Na Li, Qingling Zhu, Shaojun Guo, Shaowei Li, Shiyu Wang, Sirui Cao, Tung-Hsun Chung, Wan-Su Bao, Weifeng Yang, Xiaobo Zhu, Xiawei Chen, Yajie Du, Yangsen Ye, Yang Yang, Yiming Zhang, Yong-Heng Huo, Youwei Zhao, Yuan Li, Yulin Wu, Yu Xu","submitted_at":"2021-06-28T14:06:07Z","abstract_excerpt":"Scaling up to a large number of qubits with high-precision control is essential in the demonstrations of quantum computational advantage to exponentially outpace the classical hardware and algorithmic improvements. Here, we develop a two-dimensional programmable superconducting quantum processor, \\textit{Zuchongzhi}, which is composed of 66 functional qubits in a tunable coupling architecture. To characterize the performance of the whole system, we perform random quantum circuits sampling for benchmarking, up to a system size of 56 qubits and 20 cycles. The computational cost of the classical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14734","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.14734/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}