{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,2]],"date-time":"2026-09-02T02:39:10Z","timestamp":1788316750339,"version":"build-2803163510"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T00:00:00Z","timestamp":1640044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Vannevar Bush Fellowship"},{"DOI":"10.13039\/100000005","name":"US Department of Defense","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Simons Investigator Award"},{"name":"Simons \u201cIt from Qubit\u201d collaboration"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2021,12,31]]},"abstract":"<jats:p>\n            I offer a case that quantum query complexity still has loads of enticing and fundamental open problems\u2014from relativized\n            <jats:monospace>QMA<\/jats:monospace>\n            versus\n            <jats:monospace>QCMA<\/jats:monospace>\n            and\n            <jats:monospace>BQP<\/jats:monospace>\n            versus\n            <jats:monospace>IP<\/jats:monospace>\n            , to time\/space tradeoffs for collision and element distinctness, to polynomial degree versus quantum query complexity for partial functions, to the Unitary Synthesis Problem and more.\n          <\/jats:p>","DOI":"10.1145\/3488559","type":"journal-article","created":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T16:43:51Z","timestamp":1640105031000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Open Problems Related to Quantum Query Complexity"],"prefix":"10.1145","volume":"2","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"University of Texas, Austin TX"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,12,21]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509999"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.42"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806711"},{"key":"e_1_3_2_5_2","unstructured":"S. Aaronson. 2016. The complexity of quantum states and transformations: From quantum money to black holes. Lecture Notes for the 28th McGill Invitational Workshop on Computational Complexity with guest lectures by A. Bouland and L. Schaeffer. www.scottaaronson.com\/barbados-2016.pdf."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.5"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897644"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451047"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a007"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008735"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491533.2491549"},{"key":"e_1_3_2_12_2","unstructured":"D. Aharonov M. Ben-Or E. Eban and U. Mahadev. 2017. Interactive proofs for quantum computations. Earlier version in ICS\u201910. arXiv:1704.04487."},{"key":"e_1_3_2_13_2","unstructured":"D. Aharonov and T. Naveh. 2002. Quantum NP - a survey. quant-ph\/0210077."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122692"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.006"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447311"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3106234"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451040"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_20_2","unstructured":"S. Ben-David. 2015. A super-grover separation between randomized and quantum query complexities. arXiv:1506.08106."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/261342.261346"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.36"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"al. F. Arute et","year":"2019","unstructured":"F. Arute et al.2019. Quantum supremacy using a programmable superconducting processor. Nature 574 (2019), 505\u2013510. arXiv:1910.11333.","journal-title":"Nature"},{"key":"e_1_3_2_29_2","unstructured":"Y. Wu et al.2021. Strong quantum computational advantage using a superconducting quantum processor. arXiv:2106.14734."},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.01.024"},{"key":"e_1_3_2_31_2","first-page":"1","volume-title":"Mathematical Foundations of Computer Science","author":"Fefferman B.","year":"2018","unstructured":"B. Fefferman and S. Kimmel. 2018. Quantum vs. classical proofs and subset verification. In Mathematical Foundations of Computer Science. 1\u201322. arXiv:1510.06750."},{"key":"e_1_3_2_32_2","unstructured":"S. Fenner and Y. Zhang. 2003. A note on the classical lower bound for a quantum walk algorithm. quant-ph\/0312230v1."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90199-8"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"issue":"85","key":"e_1_3_2_35_2","article-title":"Quantum computation vs. Firewalls","author":"Harlow D.","year":"2013","unstructured":"D. Harlow and P. Hayden. 2013. Quantum computation vs. Firewalls. J. High Energy Phys.85 (2013). arXiv:1301.4504.","journal-title":"J. High Energy Phys."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-019-03382-y"},{"issue":"3","key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"949","DOI":"10.4007\/annals.2019.190.3.6","article-title":"Induced subgraphs of hypercubes and a proof of the sensitivity conjecture","volume":"190","author":"Huang H.","year":"2019","unstructured":"H. Huang. 2019. Induced subgraphs of hypercubes and a proof of the sensitivity conjecture. Ann. Math. 190, 3 (2019), 949\u2013955. arXiv:1907.00847.","journal-title":"Ann. Math."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1137\/05063235X"},{"key":"e_1_3_2_39_2","first-page":"1","volume-title":"Proc. Innovations in Theoretical Computer Science (ITCS\u201921)","author":"Kretschmer W.","year":"2021","unstructured":"W. Kretschmer. 2021. The quantum supremacy tsirelson inequality. In Proc. Innovations in Theoretical Computer Science (ITCS\u201921). 1\u201313. arXiv:2008.08721."},{"issue":"15","key":"e_1_3_2_40_2","article-title":"Quantum sampling problems, bosonsampling, and quantum supremacy","volume":"3","author":"Lund A. P.","year":"2017","unstructured":"A. P. Lund, M. J. Bremner, and T. C. Ralph. 2017. Quantum sampling problems, bosonsampling, and quantum supremacy. Npj Quantum Inf. 3, 15 (2017). arXiv:1702.03061.","journal-title":"Npj Quantum Inf."},{"key":"e_1_3_2_41_2","unstructured":"A. Lutomirski. 2011. Component mixers and a hardness result for counterfeiting quantum money. arXiv:1107.0321."},{"key":"e_1_3_2_42_2","first-page":"259","volume-title":"Proc. IEEE FOCS","author":"Mahadev U.","year":"2018","unstructured":"U. Mahadev. 2018. Classical verification of quantum computations. In Proc. IEEE FOCS. 259\u2013267. arXiv:1804.01082."},{"key":"e_1_3_2_43_2","doi-asserted-by":"crossref","unstructured":"J. Preskill. 2018. Quantum computing in the NISQ era and beyond. arXiv:1801.00862.","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316315"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133080"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451019"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365701"},{"key":"e_1_3_2_50_2","first-page":"228","volume-title":"Proc. IEEE FOCS","author":"Tal A.","year":"2020","unstructured":"A. Tal. 2020. Towards optimal separations between quantum and randomized query complexities. In Proc. IEEE FOCS. 228\u2013239. arXiv:1912.12561."}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488559","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:50Z","timestamp":1750191530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,21]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12,31]]}},"alternative-id":["10.1145\/3488559"],"URL":"https:\/\/doi.org\/10.1145\/3488559","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,21]]},"assertion":[{"value":"2021-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}