Sampling random quantum circuits: a pedestrian's guide · HackerPapers discussions

Sampling random quantum circuits: a pedestrian's guide — mentioned by mikewarot

Mon, 03 Jul 2023 03:18:42 GMT

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

Paper and discussion history. A mention is not an endorsement.

Sampling random quantum circuits: a pedestrian's guide — mentioned by robthebrew

Thu, 08 Jul 2021 07:50:38 GMT

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.

Paper and discussion history. A mention is not an endorsement.

Sampling random quantum circuits: a pedestrian's guide — mentioned by throw149102

Wed, 07 Jul 2021 21:27:36 GMT

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 w/ RAM rather than just RAM alone. For example, take this line from IBM's refutation of Google's Quantum Supremacy experiment: "64 PiB of disk space are required for 53-qubit circuits, and 128 PiB for 54-qubit circuits. Both fit within the…

Paper and discussion history. A mention is not an endorsement.