“I wouldn't trust the claim it can't be simulated; right after google declared quantum supremacy another group noticed that the classical solution was actually much faster than google said (and that's before any real optimization work gets started). https://arxiv.org/abs/2110.14502 Also as pointed out, these aren't full qubits, nor does any doubling mean …”
Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
We develop a high-performance tensor-based simulator for random quantum circuits(RQCs) on the new Sunway supercomputer. Our major innovations include: (1) a near-optimal slicing scheme, and a path-optimization strategy that considers both complexity and compute density; (2) a three-level parallelization scheme that scales to about 42 million cores; (3) a fused permutation and multiplication design that improves the compute efficiency for a wide range of tensor contraction scenarios; and (4) a mixed-precision scheme to further improve the performance. Our simulator effectively expands the scope of simulatable RQCs to include the 10*10(qubits)*(1+40+1)(depth) circuit, with a sustained performance of 1.2 Eflops (single-precision), or 4.4 Eflops (mixed-precision)as a new milestone for classical simulation of quantum circuits; and reduces the simulation sampling time of Google Sycamore to 304 seconds, from the previously claimed 10,000 years.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“First I heard of these exascale computers was when a Chinese group published[1] a pre-print in which they classically replicated the Google quantum supremacy result in about 300s. The Google team estimated that a supercomputer (Summit) would take 10e3 years to do the task, which apparently really got to the classical HPC community. [1] https://arxiv.org/…”
- Closing the “Quantum Supremacy” Gap ↗ktnc985 · 2021-10-29 · 1 分