{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:49:44Z","timestamp":1781077784798,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Simons Institute for the Theory of Computing, University of California Berkeley","award":["Simons Collaboration on Algorithms and Geometry, Simons Investigator Award, Simons-Berkeley Postdoctoral Fellowship"],"award-info":[{"award-number":["Simons Collaboration on Algorithms and Geometry, Simons Investigator Award, Simons-Berkeley Postdoctoral Fellowship"]}]},{"name":"IBM","award":["IBM PhD Fellowship"],"award-info":[{"award-number":["IBM PhD Fellowship"]}]},{"name":"NSF (National Science Foundation)","award":["CCF-1714779, CCF-200746, CCF-2145474"],"award-info":[{"award-number":["CCF-1714779, CCF-200746, CCF-2145474"]}]},{"name":"Alfred P. Sloan Foundation","award":["Sloan Research Fellowship"],"award-info":[{"award-number":["Sloan Research Fellowship"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649621","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1488-1497","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The Power of Adaptivity in Quantum Query Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3055-9406","authenticated-orcid":false,"given":"Uma","family":"Girish","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5702-2049","authenticated-orcid":false,"given":"Makrand","family":"Sinha","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0375-6554","authenticated-orcid":false,"given":"Avishay","family":"Tal","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5894-822X","authenticated-orcid":false,"given":"Kewen","family":"Wu","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746547"},{"key":"e_1_3_2_1_2_1","first-page":"2020","volume-title":"Chic. J. Theor. Comput. Sci.","author":"Agrawal Rohit","year":"2020","unstructured":"Rohit Agrawal. 2020. Coin Theorems and the Fourier Expansion. Chic. J. Theor. Comput. Sci., 2020 (2020), http:\/\/cjtcs.cs.uchicago.edu\/articles\/2020\/4\/contents.html"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-014-0083-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585153"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451040"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_3_2_1_7_1","unstructured":"Sergey Bravyi David Gosset Daniel Grier and Luke Schaeffer. 2022. Classical algorithms for Forrelation. CoRR arXiv:2102.06963. arxiv:2102.06963"},{"key":"e_1_3_2_1_8_1","volume-title":"Lower Bounds for Parallel Quantum Counting. CoRR, abs\/1910.04555","author":"Burchard Paul","year":"2019","unstructured":"Paul Burchard. 2019. Lower Bounds for Parallel Quantum Counting. CoRR, abs\/1910.04555 (2019), arXiv:1910.04555. arxiv:1910.04555"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2021.10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4086\/TOC.2019.V015A010"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2019.22"},{"key":"e_1_3_2_1_12_1","volume-title":"Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization. IACR Cryptol. ePrint Arch","author":"Chia Nai-Hui","year":"1911","unstructured":"Nai-Hui Chia and Shih-Han Hung. 2023. Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization. IACR Cryptol. ePrint Arch., 1911. https:\/\/eprint.iacr.org\/2023\/1911"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892140"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384269"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519981"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-022-00232-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00047"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2311.16057"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2021.39"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ISAAC.2022.6"},{"key":"e_1_3_2_1_23_1","volume-title":"Tight bounds on the Fourier growth of bounded functions on the hypercube. CoRR, abs\/2107.06309","author":"Iyer Siddharth","year":"2021","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. CoRR, abs\/2107.06309 (2021), arXiv:2107.06309. arxiv:2107.06309"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36206-1_20"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00453-016-0206-Z"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380786"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JCSS.2009.10.007"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585225"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Yishay Mansour. 1992. An O(n^ log log n) Learning Algorithm for DNF Under the Uniform Distribution. 53\u201361. https:\/\/doi.org\/10.1145\/130385.130391 10.1145\/130385.130391","DOI":"10.1145\/130385.130391"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2010.09.009"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799355053"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_65"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3530258"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2308.06572"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_45"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1468943"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-12689-9_124"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4086\/TOC.2017.V013A012"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2017.15"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00030"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743486"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30440-3_428"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.60.2746"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649621","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:47Z","timestamp":1750178207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":47,"alternative-id":["10.1145\/3618260.3649621","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649621","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}