Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor

• URL: http://arxiv.org/abs/2412.11924v1
• Date: Mon, 16 Dec 2024 16:11:26 GMT
• Title: Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor
• Authors: Dongxin Gao, Daojin Fan, Chen Zha, Jiahao Bei, Guoqing Cai, Jianbin Cai, Sirui Cao, Xiangdong Zeng, Fusheng Chen, Jiang Chen, Kefu Chen, Xiawei Chen, Xiqing Chen, Zhe Chen, Zhiyuan Chen, Zihua Chen, Wenhao Chu, Hui Deng, Zhibin Deng, Pei Ding, Xun Ding, Zhuzhengqi Ding, Shuai Dong, Yupeng Dong, Bo Fan, Yuanhao Fu, Song Gao, Lei Ge, Ming Gong, Jiacheng Gui, Cheng Guo, Shaojun Guo, Xiaoyang Guo, Tan He, Linyin Hong, Yisen Hu, He-Liang Huang, Yong-Heng Huo, Tao Jiang, Zuokai Jiang, Honghong Jin, Yunxiang Leng, Dayu Li, Dongdong Li, Fangyu Li, Jiaqi Li, Jinjin Li, Junyan Li, Junyun Li, Na Li, Shaowei Li, Wei Li, Yuhuai Li, Yuan Li, Futian Liang, Xuelian Liang, Nanxing Liao, Jin Lin, Weiping Lin, Dailin Liu, Hongxiu Liu, Maliang Liu, Xinyu Liu, Xuemeng Liu, Yancheng Liu, Haoxin Lou, Yuwei Ma, Lingxin Meng, Hao Mou, Kailiang Nan, Binghan Nie, Meijuan Nie, Jie Ning, Le Niu, Wenyi Peng, Haoran Qian, Hao Rong, Tao Rong, Huiyan Shen, Qiong Shen, Hong Su, Feifan Su, Chenyin Sun, Liangchao Sun, Tianzuo Sun, Yingxiu Sun, Yimeng Tan, Jun Tan, Longyue Tang, Wenbing Tu, Cai Wan, Jiafei Wang, Biao Wang, Chang Wang, Chen Wang, Chu Wang, Jian Wang, Liangyuan Wang, Rui Wang, Shengtao Wang, Xinzhe Wang, Zuolin Wei, Jiazhou Wei, Dachao Wu, Gang Wu, Jin Wu, Shengjie Wu, Yulin Wu, Shiyong Xie, Lianjie Xin, Yu Xu, Chun Xue, Kai Yan, Weifeng Yang, Xinpeng Yang, Yang Yang, Yangsen Ye, Zhenping Ye, Chong Ying, Jiale Yu, Qinjing Yu, Wenhu Yu, Shaoyu Zhan, Feifei Zhang, Haibin Zhang, Kaili Zhang, Pan Zhang, Wen Zhang, Yiming Zhang, Yongzhuo Zhang, Lixiang Zhang, Guming Zhao, Peng Zhao, Xianhe Zhao, Xintao Zhao, Youwei Zhao, Zhong Zhao, Luyuan Zheng, Fei Zhou, Liang Zhou, Na Zhou, Naibin Zhou, Shifeng Zhou, Shuang Zhou, Zhengxiao Zhou, Chengjun Zhu, Qingling Zhu, Guihong Zou, Haonan Zou, Qiang Zhang, Chao-Yang Lu, Cheng-Zhi Peng, XiaoBo Zhu, Jian-Wei Pan,
• Abstract summary: Zuchongzhi 3.0 is a superconducting quantum computer prototype, comprising 105 qubits. Experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds.
• Score: 65.64902746326833
• License:
• Abstract: In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer prototype, comprising 105 qubits, achieves high operational fidelities, with single-qubit gates, two-qubit gates, and readout fidelity at 99.90%, 99.62% and 99.18%, respectively. Our experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds. This task is estimated to be infeasible on the most powerful classical supercomputers, Frontier, which would require approximately $6.4\times 10^9$ years to replicate the task. This leap in processing power places the classical simulation cost six orders of magnitude beyond Google's SYC-67 and SYC-70 experiments [Nature 634, 328(2024)], firmly establishing a new benchmark in quantum computational advantage. Our work not only advances the frontiers of quantum computing but also lays the groundwork for a new era where quantum processors play an essential role in tackling sophisticated real-world challenges.

Related papers

• Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer [56.435136806763055]
  IQM Quantum Computers is described covering both the QPU and the rest of the full-stack quantum computer. The focus is on a 20-qubit quantum computer featuring the Garnet QPU and its architecture, which we will scale up to 150 qubits. We present QPU and system-level benchmarks, including a median 2-qubit gate fidelity of 99.5% and genuinely entangling all 20 qubits in a Greenberger-Horne-Zeilinger (GHZ) state.
  arXiv  Detail & Related papers  (2024-08-22T14:26:10Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Deep quantum neural networks equipped with backpropagation on a superconducting processor [7.011044869810729]
  We show the first experimental demonstration of training deep quantum neural networks via the backpropagation algorithm with a six-qubit programmable superconducting processor. In particular, we show that three-layer deep quantum neural networks can be trained efficiently to learn two-qubit quantum channels with a mean fidelity up to 96.2%. Six-layer deep quantum neural networks can be trained in a similar fashion to achieve a mean fidelity up to 94.8% for learning single-qubit quantum channels.
  arXiv  Detail & Related papers  (2022-12-05T19:00:02Z)
• Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer [17.816108993297664]
  A major milestone in the era of noisy intermediate scale quantum computers is textitquantum supremacy [Nature textbf574, 505] claimed on the Sycamore quantum processor of $53$ qubits. This record has been renewed with two recent experiments on the Zuchongzhi $2.0$ ($56$ qubits) and Zuchongzhi $2.1$ ($60$ qubits) quantum processors. Here we report the full-scale simulations of these problems on new generation Sunway supercomputer, based on a customized tensor network contraction algorithm.
  arXiv  Detail & Related papers  (2021-11-01T16:28:51Z)
• Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling [33.18018507595303]
  The readout fidelity of textitZuchongzhi 2.1 is considerably improved to an average of 97.74%. The more powerful quantum processor enables us to achieve larger-scale random quantum circuit sampling.
  arXiv  Detail & Related papers  (2021-09-08T08:34:28Z)
• Quantum design for advanced qubits: plasmonium [4.51227657808872]
  We demonstrate variational quantum eigensolvers to simulate superconducting quantum circuits with varying parameters covering a plasmon-transition regime. We fabricate an advanced post-transmon qubit, "plasmonium", which exhibits high single- and two-qubit gate fidelities. Our work opens the way to designing advanced quantum processors using existing quantum computing resources.
  arXiv  Detail & Related papers  (2021-09-02T14:48:39Z)
• Strong quantum computational advantage using a superconducting quantum processor [33.030717006448526]
  We develop a two-dimensional programmable superconducting quantum processor, textitZuchongzhi, composed of 66 functional qubits in a tunable coupling architecture. Our work establishes an unambiguous quantum computational advantage that is infeasible classical computation in a reasonable amount of time.
  arXiv  Detail & Related papers  (2021-06-28T14:06:07Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.