2000 character limit reached
Fast classical simulation of evidence for the utility of quantum computing before fault tolerance
Published 28 Jun 2023 in quant-ph | (2306.16372v1)
Abstract: We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor [Nature 618, 500 (2023)]. Our classical simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, as well as faster than the estimated quantum hardware runtime without classical processing, and are in good agreement with the zero-noise extrapolated experimental results.
- S. Bravyi and D. Gosset, Phys. Rev. Lett. 116, 250501 (2016).
- H. Qassim, J. J. Wallman, and J. Emerson, Quantum 3, 170 (2019).
- T. Begušić, K. Hejazi, and G. K.-L. Chan, “Simulating quantum circuit expectation values by Clifford perturbation theory,” (2023), arXiv:2306.04797 [quant-ph] .
- J. Gray and S. Kourtis, Quantum 5, 410 (2021).
- J. Gray and G. K.-L. Chan, “Hyper-optimized compressed contraction of tensor networks with arbitrary geometry,” (2022), arXiv:2206.07044 [quant-ph] .
- K. Temme, S. Bravyi, and J. M. Gambetta, Phys. Rev. Lett. 119, 180509 (2017).
- J. Tindall, M. Fishman, M. Stoudenmire, and D. Sels, “Efficient tensor network simulation of IBM’s kicked Ising experiment,” (2023), arXiv:2306.14887 [quant-ph] .
- M. P. Zaletel and F. Pollmann, Phys. Rev. Lett. 124, 037201 (2020).
- I. Kuprov, N. Wagner-Rundell, and P. Hore, Journal of Magnetic Resonance 189, 241 (2007).
- T. Rakovszky, C. von Keyserlingk, and F. Pollmann, Physical Review B 105, 075131 (2022).
- Qiskit contributors, “Qiskit: An open-source framework for quantum computing,” (2023).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.