Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.11924

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

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
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

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. 2024-12-16. Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor. https://arxiv.org/abs/2412.11924

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗