{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:00Z","timestamp":1781031420002,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800750","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"305-313","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fourier Spectrum of Noisy Quantum Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3055-9406","authenticated-orcid":false,"given":"Uma","family":"Girish","sequence":"first","affiliation":[{"name":"Columbia University, New York, USA"},{"name":"University of Toronto, Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806711"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746547"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993682"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055453"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2023.25"},{"key":"e_1_3_2_1_6_1","unstructured":"Srinivasan Arunachalam Uma Girish and Noam Lifshitz. 2023. One Clean Qubit Suffices for Quantum Communication Advantage. arxiv:2310.02406."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451040"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2019.22"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-41217-6"},{"key":"e_1_3_2_1_11_1","unstructured":"Nai-Hui Chia Min-Hsiu Hsieh Shih-Han Hung and En-Jui Kuo. 2024. Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy. arxiv:2405.07137."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.032422"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.042316"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2016.13"},{"key":"e_1_3_2_1_16_1","volume-title":"Impossibility of classically simulating one-clean-qubit model with multiplicative error. Physical review letters, 120, 20","author":"Fujii Keisuke","year":"2018","unstructured":"Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, and Seiichiro Tani. 2018. Impossibility of classically simulating one-clean-qubit model with multiplicative error. Physical review letters, 120, 20 (2018), 200502."},{"key":"e_1_3_2_1_17_1","unstructured":"Alexandru Georghiu. 2025. Verifiable quantum advantage: old and new ideas. Link to recording of talk: https:\/\/youtu.be\/7NqAcaSwKf8?si=2ZBkEkbiVaUMSzMJ"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649621"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2021.39"},{"key":"e_1_3_2_1_20_1","unstructured":"Siddharth Iyer Anup Rao Victor Reis Thomas Rothvoss and Amir Yehudayoff. 2021. Tight bounds on the Fourier growth of bounded functions on the hypercube. arxiv:2107.06309."},{"key":"e_1_3_2_1_21_1","unstructured":"Dale Jacobs and Saeed Mehraban. 2024. The Space Just Above One Clean Qubit. arxiv:2410.08051."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.81.5672"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.040302"},{"key":"e_1_3_2_1_24_1","volume-title":"Hardness of classically simulating the one-clean-qubit model. Physical review letters, 112, 13","author":"Morimae Tomoyuki","year":"2014","unstructured":"Tomoyuki Morimae, Keisuke Fujii, and Joseph F Fitzsimons. 2014. Hardness of classically simulating the one-clean-qubit model. Physical review letters, 112, 13 (2014), 130502."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3530258"},{"key":"e_1_3_2_1_26_1","unstructured":"Daniel James Shepherd. 2010. Quantum Complexity: restrictions on algorithms and architectures. arxiv:1005.1425."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2008.0443"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1468943"},{"key":"e_1_3_2_1_29_1","first-page":"681","article-title":"Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Info","volume":"8","author":"Shor Peter W.","year":"2008","unstructured":"Peter W. Shor and Stephen P. Jordan. 2008. Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Info. Comput., 8, 8 (2008), Sept., 681\u2013714. issn:1533-7146","journal-title":"Comput."},{"key":"e_1_3_2_1_30_1","unstructured":"Noah Shutty. 2025. Simons Institute Summer Cluster on Quantum Computing: Lightning Talks. Link to recording of talk: https:\/\/www.youtube.com\/live\/7F5LBNGDRmk?si=NhPVNL25qGTtcngP&t=2651"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"},{"key":"e_1_3_2_1_32_1","volume-title":"Computational Complexity Conference (LIPIcs","volume":"31","author":"Tal Avishay","year":"2017","unstructured":"Avishay Tal. 2017. Tight Bounds on the Fourier Spectrum of AC0. In Computational Complexity Conference (LIPIcs, Vol. 79). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, DEU. 15:1\u201315:31."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00030"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:59:12Z","timestamp":1781027952000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":33,"alternative-id":["10.1145\/3798129.3800750","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800750","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}