A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

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

doi:10.1145/3564246.3585234

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

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

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

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 language	American English
Title of host publication	STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Editors	Barna Saha, Rocco A. Servedio
Publisher	Association for Computing Machinery
Pages	945-957
Number of pages	13
ISBN (Electronic)	9781450399135
DOIs	https://doi.org/10.1145/3564246.3585234
State	Published - 2 Jun 2023
Event	55th Annual ACM Symposium on Theory of Computing, STOC 2023 - Orlando, United States Duration: 20 Jun 2023 → 23 Jun 2023

Publication series

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

Conference

Conference	55th Annual ACM Symposium on Theory of Computing, STOC 2023
Country/Territory	United States
City	Orlando
Period	20/06/23 → 23/06/23

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.

Keywords

Quantum supremacy
Random circuit sampling

Access to Document

10.1145/3564246.3585234

Cite this

Aharonov, D., Gao, X., Landau, Z., Liu, Y., & Vazirani, U. (2023). A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. In B. Saha, & R. A. Servedio (Eds.), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 945-957). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/3564246.3585234

@inproceedings{0778151705ac4937bca87e34cbd65ba0,

title = "A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling",

abstract = "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.",

keywords = "Quantum supremacy, Random circuit sampling",

author = "Dorit Aharonov and Xun Gao and Zeph Landau and Yunchao Liu and Umesh Vazirani",

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: {\textcopyright} 2023 Owner/Author.; 55th Annual ACM Symposium on Theory of Computing, STOC 2023 ; Conference date: 20-06-2023 Through 23-06-2023",

year = "2023",

month = jun,

day = "2",

doi = "10.1145/3564246.3585234",

language = "American English",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "945--957",

editor = "Barna Saha and Servedio, {Rocco A.}",

booktitle = "STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing",

}

Aharonov, D, Gao, X, Landau, Z, Liu, Y & Vazirani, U 2023, A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. in B Saha & RA Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 945-957, 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, United States, 20/06/23. https://doi.org/10.1145/3564246.3585234

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. / Aharonov, Dorit; Gao, Xun; Landau, Zeph et al.
STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. ed. / Barna Saha; Rocco A. Servedio. Association for Computing Machinery, 2023. p. 945-957 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

AU - Aharonov, Dorit

AU - Gao, Xun

AU - Landau, Zeph

AU - Liu, Yunchao

AU - Vazirani, Umesh

N1 - 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.

PY - 2023/6/2

Y1 - 2023/6/2

N2 - 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.

AB - 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.

KW - Quantum supremacy

KW - Random circuit sampling

UR - http://www.scopus.com/inward/record.url?scp=85163062679&partnerID=8YFLogxK

U2 - 10.1145/3564246.3585234

DO - 10.1145/3564246.3585234

M3 - Conference contribution

AN - SCOPUS:85163062679

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 945

EP - 957

BT - STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing

A2 - Saha, Barna

A2 - Servedio, Rocco A.

PB - Association for Computing Machinery

T2 - 55th Annual ACM Symposium on Theory of Computing, STOC 2023

Y2 - 20 June 2023 through 23 June 2023

ER -

Aharonov D, Gao X, Landau Z, Liu Y, Vazirani U. A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. In Saha B, Servedio RA, editors, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery. 2023. p. 945-957. (Proceedings of the Annual ACM Symposium on Theory of Computing). doi: 10.1145/3564246.3585234

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this