{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:04:47Z","timestamp":1777287887036,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384269","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"889-901","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Computations with greater Quantum depth are strictly more powerful (relative to an oracle)"],"prefix":"10.1145","author":[{"given":"Matthew","family":"Coudron","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada \/ University of Maryland, USA \/ NIST, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanketh","family":"Menda","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Scott Aaronson. 2005. Ten Semi-Grand Challenges for Quantum Computing Theory. https:\/\/web.archive.org\/web\/20191018200612\/https:\/\/www.scottaaronson.com\/writings\/qchallenge.html  Scott Aaronson. 2005. Ten Semi-Grand Challenges for Quantum Computing Theory. https:\/\/web.archive.org\/web\/20191018200612\/https:\/\/www.scottaaronson.com\/writings\/qchallenge.html"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806711"},{"key":"e_1_3_2_1_3_1","unstructured":"Scott Aaronson. 2011. Projects aplenty. Shtetl-Optimized. https:\/\/web.archive.org\/web\/20170731000837\/https:\/\/www.scottaaronson.com\/blog\/?p=663  Scott Aaronson. 2011. Projects aplenty. Shtetl-Optimized. https:\/\/web.archive.org\/web\/20170731000837\/https:\/\/www.scottaaronson.com\/blog\/?p=663"},{"key":"e_1_3_2_1_4_1","unstructured":"Scott Aaronson. 2014. Oracular separations between poly- and log-depth quantum circuits. Theoretical Computer Science Stack Exchange. https:\/\/cstheory.stackexchange.com\/q\/25145  Scott Aaronson. 2014. Oracular separations between poly- and log-depth quantum circuits. Theoretical Computer Science Stack Exchange. https:\/\/cstheory.stackexchange.com\/q\/25145"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050902"},{"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":"Nai-Hui Chia Kai-Min Chung and Ching-Yi Lai. 2019. On the Need for Large Quantum Depth. arxiv:1909.10303.  Nai-Hui Chia Kai-Min Chung and Ching-Yi Lai. 2019. On the Need for Large Quantum Depth. arxiv:1909.10303."},{"key":"e_1_3_2_1_8_1","unstructured":"Nai-Hui Chia Kai-Min Chung and Ching-Yi Lai. 2019. Personal Communication.  Nai-Hui Chia Kai-Min Chung and Ching-Yi Lai. 2019. Personal Communication."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892140"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80041-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Matthew Coudron and Sanketh Menda. 2019. Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). arxiv:1909.10503. Full version of this conference proceedings.  Matthew Coudron and Sanketh Menda. 2019. Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). arxiv:1909.10503. Full version of this conference proceedings.","DOI":"10.1145\/3357713.3384269"},{"key":"e_1_3_2_1_13_1","volume-title":"Fenner and Yong Zhang","author":"Stephen","year":"2003","unstructured":"Stephen A. Fenner and Yong Zhang . 2003 . A note on the classical lower bound for a quantum walk algorithm. arxiv:arXiv:quant-ph\/0312230. Stephen A. Fenner and Yong Zhang. 2003. A note on the classical lower bound for a quantum walk algorithm. arxiv:arXiv:quant-ph\/0312230."},{"key":"e_1_3_2_1_14_1","first-page":"137","article-title":"An introduction to measurement based quantum computation","volume":"199","author":"Jozsa Richard","year":"2006","unstructured":"Richard Jozsa . 2006 . An introduction to measurement based quantum computation . NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-From Theory to Experiment , 199 (2006), 137 \u2013 158 . arxiv:quant-ph\/0508124. Richard Jozsa. 2006. An introduction to measurement based quantum computation. NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-From Theory to Experiment, 199 (2006), 137\u2013158. arxiv:quant-ph\/0508124.","journal-title":"NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-From Theory to Experiment"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30440-3_428"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998037.1998053"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":17,"alternative-id":["10.1145\/3357713.3384269","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384269","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}