{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:49:46Z","timestamp":1781077786507,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NWO","award":["639.023.812"],"award-info":[{"award-number":["639.023.812"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451040","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1303-1316","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["k-forrelation optimally separates Quantum and classical query complexity"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"CWI, Netherlands \/ Eindhoven University of Technology, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Makrand","family":"Sinha","sequence":"additional","affiliation":[{"name":"CWI, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Scott Aaronson. 2010. BQP and the Polynomial Hierarchy. STOC \u201910. Pages 141\u2013150. isbn:9781450300506 https:\/\/doi.org\/10.1145\/1806689.1806711 10.1145\/1806689.1806711","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\/2897518.2897644"},{"key":"e_1_3_2_1_4_1","volume-title":"October, 2020.","author":"Aaronson Scott","year":"2020","unstructured":"Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, and Avishay Tal. 2020. Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem. October, 2020."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106234"},{"key":"e_1_3_2_1_6_1","volume-title":"August, 2020.","author":"Bansal Nikhil","year":"2020","unstructured":"Nikhil Bansal and Makrand Sinha. 2020. k-Forrelation Optimally Separates Quantum and Classical Query Complexity. August, 2020."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0978-1"},{"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.1137\/S0097539704442416"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.35"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384230"},{"key":"e_1_3_2_1_15_1","volume-title":"June, 2019.","author":"Eldan Ronen","year":"2019","unstructured":"Ronen Eldan and Assaf Naor. 2019. Krivine diffusions attain the Goemans-Williamson approximation ratio. June, 2019."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897545"},{"key":"e_1_3_2_1_17_1","volume-title":"July, 2020.","author":"Girish Uma","year":"2020","unstructured":"Uma Girish, Ran Raz, and Wei Zhan. 2020. Lower Bounds for XOR of Forrelations. July, 2020."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"Lov K. Grover. 1996. A Fast Quantum Mechanical Algorithm for Database Search. STOC \u201996. Pages 212\u2013219. isbn:0897917855 https:\/\/doi.org\/10.1145\/237814.237866 10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1961-0132852-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993642"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316315"},{"key":"e_1_3_2_1_24_1","volume-title":"November, 2020.","author":"Sherstov Alexander A.","year":"2020","unstructured":"Alexander A. Sherstov, Andrey A. Storozhenko, and Pei Wu. 2020. An Optimal Separation of Randomized and Quantum Query Complexity. November, 2020."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00030"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15202-3"},{"key":"e_1_3_2_1_29_1","volume-title":"July, 2020.","author":"Wu Xinyu","year":"2020","unstructured":"Xinyu Wu. 2020. A stochastic calculus approach to the oracle separation of BQP and PH. July, 2020."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451040","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":29,"alternative-id":["10.1145\/3406325.3451040","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451040","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}