按年被提到
20202021 · 2 次2026
物理与量子›量子计算·arXiv:2007.07872 · quant-ph

Sampling random quantum circuits: a pedestrian's guide

Sean Mullane · 2020
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 3 人首次 2021-07-07 · 最近 2023-07-03
3不同的人
2活跃月份
3讨论串
4被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Recent experiments completed by collaborating research groups from Google, NASA Ames, UC Santa Barbara, and others provided compelling evidence that quantum supremacy has finally been achieved on a superconducting quantum processor. The theoretical basis for these experiments depends on sampling the output distributions of random quantum circuits; unfortunately, understanding how this theoretical basis can be used to define quantum supremacy is an extremely difficult task. Anyone attempting to understand how this sampling task relates to quantum supremacy must study concepts from random matrix theory, mathematical analysis, quantum chaos, computational complexity, and probability theory. Resources connecting these concepts in the context of quantum supremacy are scattered and often difficult to find. This article is an attempt to alleviate this difficulty in those who wish to understand the theoretical basis of Google's quantum supremacy experiments, by carefully walking through a derivation of their precise mathematical definition of quantum supremacy. It's designed for advanced undergraduate or graduate students who want more information than can be provided in popular science articles, but who might not know where to begin when tackling the many research papers related to quantum supremacy.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论throw149102 · 2021-07

“My understanding is that this simulation of random quantum circuits is already known to be hard in a theoretical sense[1], and there is no argument that a classical computer could compete with a quantum computer much bigger than 50-60ish qubits. And that arguments against those previous papers has more to do with classical optimizations such as using disk…”

Strong quantum computational advantage using a superconducting quantum processor原评论 ↗
评论robthebrew · 2021-07

“If, like me, you are wondering what the calculation was, here is a dummies' guide: https://arxiv.org/pdf/2007.07872.pdf It still makes no sense to me, but might help others.”

China takes quantum supremacy lead.This QC is 60k times faster than supercomp原评论 ↗
评论mikewarot · 2023-07

“The cited paper[1] references "random circuit sampling" which is defined in [2] which then gets so heavy into abstract math, and I give up. Can someone explain this in terms an EE or programmer can understand? [1] https://arxiv.org/abs/2304.11119 [2] https://arxiv.org/abs/2007.07872”

Google’s quantum computer instantly makes calculations that take rivals 47 years原评论 ↗