Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.03494 v2 pith:7XCA3NJH submitted 2021-09-08 quant-ph

classification quant-ph
keywords quantumsamplingtextitzuchongzhiadvantagecircuitcomputationalrandom
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

To ensure a long-term quantum computational advantage, the quantum hardware should be upgraded to withstand the competition of continuously improved classical algorithms and hardwares. Here, we demonstrate a superconducting quantum computing systems \textit{Zuchongzhi} 2.1, which has 66 qubits in a two-dimensional array in a tunable coupler architecture. The readout fidelity of \textit{Zuchongzhi} 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, with a system scale of up to 60 qubits and 24 cycles. The achieved sampling task is about 6 orders of magnitude more difficult than that of Sycamore [Nature \textbf{574}, 505 (2019)] in the classic simulation, and 3 orders of magnitude more difficult than the sampling task on \textit{Zuchongzhi} 2.0 [arXiv:2106.14734 (2021)]. The time consumption of classically simulating random circuit sampling experiment using state-of-the-art classical algorithm and supercomputer is extended to tens of thousands of years (about $4.8\times 10^4$ years), while \textit{Zuchongzhi} 2.1 only takes about 4.2 hours, thereby significantly enhancing the quantum computational advantage.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Left-Deep Join Order Selection with Higher-Order Unconstrained Binary Optimization on Quantum Computers

    quant-ph 2025-02 reject novelty 6.0 of 10

    A HUBO-based encoding of left-deep join order selection claims DP-equivalent optimality and greedy-level guarantees with fewer variables, but the formal proof and validity constraints are incomplete.

  2. Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits

    quant-ph 2025-10 conditional novelty 5.0 of 10

    A tensor-network-accelerated Markov sampler exactly samples ideal and noisy shallow QAOA circuits up to 476 qubits.

Pith tools