按年被提到
20182018 · 1 次2026
物理与量子›量子计算·arXiv:1807.10749 · quant-ph

Quantum Supremacy Is Both Closer and Farther than It Appears

Igor L. Markov, Aneeqa Fatima, Sergei V. Isakov, Sergio Boixo · 2018
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2018-08-01 · 最近 2019-10-23
2不同的人
2活跃月份
2讨论串
79被引(OpenAlex)
arXiv 摘要(候选层不写导读)

As quantum computers improve in the number of qubits and fidelity, the question of when they surpass state-of-the-art classical computation for a well-defined computational task is attracting much attention. The leading candidate task for this milestone entails sampling from the output distribution defined by a random quantum circuit. We develop a massively-parallel simulation tool Rollright that does not require inter-process communication (IPC) or proprietary hardware. We also develop two ways to trade circuit fidelity for computational speedups, so as to match the fidelity of a given quantum computer --- a task previously thought impossible. We report massive speedups for the sampling task over prior software from Microsoft, IBM, Alibaba and Google, as well as supercomputer and GPU-based simulations. By using publicly available Google Cloud Computing, we price such simulations and enable comparisons by total cost across hardware platforms. We simulate approximate sampling from the output of a circuit with 7x8 qubits and depth 1+40+1 by producing one million bitstring probabilities with fidelity 0.5%, at an estimated cost of $35184. The simulation costs scale linearly with fidelity, and using this scaling we estimate that extending circuit depth to 1+48+1 increases costs to one million dollars. Scaling the simulation to 10M bitstring probabilities needed for sampling 1M bitstrings helps comparing simulation to quantum computers. We describe refinements in benchmarks that slow down leading simulators, halving the circuit depth that can be simulated within the same time.

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

HN 书评

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

“They're using a "clever trick" to approximately evaluate the overall gate from this paper https://arxiv.org/abs/1807.10749 which is computationally cheaper than doing a "brute force" simulation (which scales linearly in the number of gates), but it quickly becomes worse as you increase the number of gates. That's basically what it says. It looks like Mar…”

Quantum Supremacy Using a Programmable Superconducting Processor原评论 ↗
被提交为 story · 1 次