Fast classical simulation of Harvard/QuEra IQP circuits
Dmitri Maslov, Sergey Bravyi, Felix Tripier, Andrii Maksymov, and Joe, Latone

TL;DR
This paper presents a highly efficient classical simulation algorithm for Harvard/QuEra IQP circuits, significantly outperforming previous methods and enabling simulation of larger quantum circuits up to 96 qubits.
Contribution
The authors introduce a novel classical simulation algorithm for IQP circuits that is faster and scales better than prior approaches, allowing simulation of larger quantum systems.
Findings
Simulates 48-qubit IQP circuits in 0.0026 seconds per amplitude
Successfully simulates up to 96-qubit IQP circuits within seconds
Estimates 192-qubit simulation feasible with Tensor Processing Units
Abstract
Establishing an advantage for (white-box) computations by a quantum computer against its classical counterpart is currently a key goal for the quantum computation community. A quantum advantage is achieved once a certain computational capability of a quantum computer is so complex that it can no longer be reproduced by classical means, and as such, the quantum advantage can be seen as a continued negotiation between classical simulations and quantum computational experiments. A recent publication (Bluvstein et al., Nature 626:58-65, 2024) introduces a type of Instantaneous Quantum Polynomial-Time (IQP) computation complemented by a -qubit (logical) experimental demonstration using quantum hardware. The authors state that the ``simulation of such logical circuits is challenging'' and project the simulation time to grow rapidly with the number of CNOT layers added, see Figure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
