A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, Umesh Vazirani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


We give a polynomial time classical algorithm for sampling from the output distribution of a noisy random quantum circuit in the regime of anti-concentration to within inverse polynomial total variation distance. The algorithm is based on a quantum analog of noise induced low degree approximations of Boolean functions, which takes the form of the truncation of a Feynman path integral in the Pauli basis.

Original languageAmerican English
Title of host publicationSTOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing
EditorsBarna Saha, Rocco A. Servedio
PublisherAssociation for Computing Machinery
Number of pages13
ISBN (Electronic)9781450399135
StatePublished - 2 Jun 2023
Event55th Annual ACM Symposium on Theory of Computing, STOC 2023 - Orlando, United States
Duration: 20 Jun 202323 Jun 2023

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Conference55th Annual ACM Symposium on Theory of Computing, STOC 2023
Country/TerritoryUnited States

Bibliographical note

Funding Information:
We thank Scott Aaronson, Sergio Boixo, Adam Bouland, and Bill Fefferman for helpful discussions and feedback on the manuscript. We would also like to thank the Simons Institute for the Theory of Computing and the NSF Workshop on Quantum Advantage and Next Steps, where part of this work was done. D.A. is supported by ISF grant number 0399494-1721/17, by Simons grant number 385590, and by Quantum ISF grant number 2137/19. X.G. is supported by the Postdoctoral Fellowship in Quantum Science of the MPHQ, the Templeton Religion Trust Grant No. TRT 0159, and by the Army Research O ce under Grant No. W911NF1910302 and MURI Grant No. W911NF2010082. Z.L., Y.L. and U.V. are supported by Vannevar Bush faculty fellowship N00014-17-1-3025, MURI Grant FA9550-18-1-0161, DOE NQISRC Quantum Systems Accelerator grant FP00010905, and NSF QLCI Grant No. 2016245. Y.L. is also supported by NSF award DMR-1747426.

Publisher Copyright:
© 2023 Owner/Author.


  • Quantum supremacy
  • Random circuit sampling


Dive into the research topics of 'A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling'. Together they form a unique fingerprint.

Cite this