HackerPapers

arXiv:1910.09534quant-ph

Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits

Edwin Pednault, John A. Gunnels, Giacomo Nannicini, Lior Horesh, Robert Wisnieff

Abstract

In a recent paper, we showed that secondary storage can extend the range of quantum circuits that can be practically simulated with classical algorithms. Here we refine those techniques and apply them to the simulation of Sycamore circuits with 53 and 54 qubits, with the entanglement pattern ABCDCDAB that has proven difficult to classically simulate with other approaches. Our analysis shows that on the Summit supercomputer at Oak Ridge National Laboratories, such circuits can be simulated with high fidelity to arbitrary depth in a matter of days, outputting all the amplitudes.

arXiv comments
Added full listing of the tensor operations for reproducibility; fixed some typos
Journal reference
DOI
Subjects
quant-phQuantum Physics

On Hacker News

Linked by 4 identifiable commenters in 4 comments across 4 threads, from Oct 2019 to Dec 2024. Found in 1 HN submission from Oct 2019 to Oct 2019. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments4 threads

  1. The case against Google's claims of "quantum supremacy" 1 comment

    • > If I take the Willow announcement at face value (in particular, the QEC claims) [...] Considering that Google's 2019 claim of quantum supremacy was, at the very least, severely overestimated (https://doi.org/10.48550/arXiv.1910.09534) I would wait a little bit before making…

      peraView on HNParent context

  2. Strong quantum computational advantage using a superconducting quantum processor 1 comment

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

      throw149102View on HNParent context

  3. Physicists challenge Google’s ‘quantum advantage’ 1 comment

    • The Quantum Computer scientists Scott Aaronson and Gil Kalai have casted doubt on this result[1][2]. Also good to note is that Kalai casted doubt on the original Google supremacy result. There are now classical algorithms 6 orders of magnitude faster than the Google quantum…

      ethnView on HNParent context

  4. IBM casts doubt on Google's claims of quantum supremacy 1 comment

    • If a worst case to simulate on a classical computer is 2.5 days (per IBM's blog) then they should either: 1. Actually preform the experiment per their approach, compare the results, and provide tangible proof in the coming days. or 2. Retract their claims. In either case…

      d0neView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.