activity
20212025
most citedStrong quantum computational advantage using a superconducting quantum processor

1.1k citations · 1.2k across the 4 of their papers we have counts for

collaborators
Showing quant-phShow all

6 papers · 1 filter

quant-ph20254 cited

Calibrating quantum gates up to 52 qubits in a superconducting processor

Daojin Fan, Guoding Liu, Shaowei Li +18

Benchmarking large-scale quantum gates, typically involving multiple native two-qubit and singlequbit gates, is crucial in quantum computing. Global fidelity, encompassing informat…

quant-ph2025

Generation of 95-qubit genuine entanglement and verification of symmetry-protected topological phases

Tao Jiang, Jianbin Cai, Junxiang Huang +152

Symmetry-protected topological (SPT) phases are fundamental features of cluster states, serving as key resources for measurement-based quantum computation (MBQC). Generating large-…

quant-ph20241 cited

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

Dongxin Gao, Daojin Fan, Chen Zha +151

In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer pro…

quant-ph202114 cited

Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling

Qingling Zhu, Sirui Cao, Fusheng Chen +50

To ensure a long-term quantum computational advantage, the quantum hardware should be upgraded to withstand the competition of continuously improved classical algorithms and hardwa…

quant-ph20211.1k cited

Strong quantum computational advantage using a superconducting quantum processor

Yulin Wu, Wan-Su Bao, Sirui Cao +51

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 hard…

quant-ph2021

Quantum walks on a programmable two-dimensional 62-qubit superconducting processor

Ming Gong, Shiyu Wang, Chen Zha +33

Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal…