@inproceedings{12cbcdb4742041a2831ad3f2bfa46226,

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 = "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 = "https://doi.org/10.1145/3564246.3585234",

language = "American English",

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

pages = "945--957",

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

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

}