{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:48:48Z","timestamp":1767847728384,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":23,"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"}],"funder":[{"name":"Academia Sinica Career Development Award,","award":["Grant 23-17 MOST QC project"],"award-info":[{"award-number":["Grant 23-17 MOST QC project"]}]},{"name":"YoungScholar Fellowship Program by Ministry of Science and Tech-nology in Taiwan,","award":["Grant MOST 108-2636-E-009-004"],"award-info":[{"award-number":["Grant MOST 108-2636-E-009-004"]}]},{"name":"MOST QC project,","award":["Grant MOST 107-2627-E-002-002"],"award-info":[{"award-number":["Grant MOST 107-2627-E-002-002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384291","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"902-915","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["On the need for large Quantum depth"],"prefix":"10.1145","author":[{"given":"Nai-Hui","family":"Chia","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taiwan"}]},{"given":"Ching-Yi","family":"Lai","sequence":"additional","affiliation":[{"name":"National Chiao Tung University, Taiwan"}]}],"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. ( 2005 ). https:\/\/www.scottaaronson.com\/writings\/qchallenge.html  Scott Aaronson. 2005. Ten Semi-Grand Challenges for Quantum Computing Theory. ( 2005 ). 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. https:\/\/www.scottaaronson.com\/blog\/ ?p= 663. ( 2011 ).  Scott Aaronson. 2011. Projects aplenty. https:\/\/www.scottaaronson.com\/blog\/ ?p= 663. ( 2011 )."},{"key":"e_1_3_2_1_4_1","unstructured":"Scott Aaronson. 2019. Personal communication. ( 2019 ).  Scott Aaronson. 2019. Personal communication. ( 2019 )."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3135595.3135617"},{"key":"e_1_3_2_1_6_1","unstructured":"Andris Ambainis Mike Hamburg and Dominique Unruh. 2018. Quantum security proofs using semi-classical oracles. IACR Cryptology ePrint Archive 2018 ( 2018 ) 904.  Andris Ambainis Mike Hamburg and Dominique Unruh. 2018. Quantum security proofs using semi-classical oracles. IACR Cryptology ePrint Archive 2018 ( 2018 ) 904."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Frank Arute Kunal Arya Ryan Babbush Dave Bacon Joseph C. Bardin Rami Barends Rupak Biswas Sergio Boixo Fernando G. S. L. Brandao David A. Buell Brian Burkett Yu Chen Zijun Chen Ben Chiaro Roberto Collins William Courtney Andrew Dunsworth Edward Farhi Brooks Foxen Austin Fowler Craig Gidney Marissa Giustina Rob Graf Keith Guerin Steve Habegger Matthew P. Harrigan Michael J. Hartmann Alan Ho Markus Hofmann Trent Huang Travis S. Humble Sergei V. Isakov Evan Jefrey Zhang Jiang Dvir Kafri Kostyantyn Kechedzhi Julian Kelly Paul V. Klimov Sergey Knysh Alexander Korotkov Fedor Kostritsa David Landhuis Mike Lindmark Erik Lucero Dmitry Lyakh Salvatore Mandr\u00e0 Jarrod R. McClean Matthew McEwen Anthony Megrant Xiao Mi Kristel Michielsen Masoud Mohseni Josh Mutus Ofer Naaman Matthew Neeley Charles Neill Murphy Yuezhen Niu Eric Ostby Andre Petukhov John C. Platt Chris Quintana Eleanor G. Riefel Pedram Roushan Nicholas C. Rubin Daniel Sank Kevin J. Satzinger Vadim Smelyanskiy Kevin J. Sung Matthew D. Trevithick Amit Vainsencher Benjamin Villalonga Theodore White Z. Jamie Yao Ping Yeh Adam Zalcman Hartmut Neven and John M. Martinis. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574 7779 ( 2019 ) 505-510.  Frank Arute Kunal Arya Ryan Babbush Dave Bacon Joseph C. Bardin Rami Barends Rupak Biswas Sergio Boixo Fernando G. S. L. Brandao David A. Buell Brian Burkett Yu Chen Zijun Chen Ben Chiaro Roberto Collins William Courtney Andrew Dunsworth Edward Farhi Brooks Foxen Austin Fowler Craig Gidney Marissa Giustina Rob Graf Keith Guerin Steve Habegger Matthew P. Harrigan Michael J. Hartmann Alan Ho Markus Hofmann Trent Huang Travis S. Humble Sergei V. Isakov Evan Jefrey Zhang Jiang Dvir Kafri Kostyantyn Kechedzhi Julian Kelly Paul V. Klimov Sergey Knysh Alexander Korotkov Fedor Kostritsa David Landhuis Mike Lindmark Erik Lucero Dmitry Lyakh Salvatore Mandr\u00e0 Jarrod R. McClean Matthew McEwen Anthony Megrant Xiao Mi Kristel Michielsen Masoud Mohseni Josh Mutus Ofer Naaman Matthew Neeley Charles Neill Murphy Yuezhen Niu Eric Ostby Andre Petukhov John C. Platt Chris Quintana Eleanor G. Riefel Pedram Roushan Nicholas C. Rubin Daniel Sank Kevin J. Satzinger Vadim Smelyanskiy Kevin J. Sung Matthew D. Trevithick Amit Vainsencher Benjamin Villalonga Theodore White Z. Jamie Yao Ping Yeh Adam Zalcman Hartmut Neven and John M. Martinis. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574 7779 ( 2019 ) 505-510.","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_2_1_8_1","volume-title":"Omer Paneth, and Alon Rosen.","author":"Bitansky Nir","year":"2014","unstructured":"Nir Bitansky , Ran Canetti , Henry Cohn , Shafi Goldwasser , Yael Tauman Kalai , Omer Paneth, and Alon Rosen. 2014 . The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. In Advances in Cryptology-CRYPTO 2014, Juan A. Garay and Rosario Gennaro (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 71-89. Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, and Alon Rosen. 2014. The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. In Advances in Cryptology-CRYPTO 2014, Juan A. Garay and Rosario Gennaro (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 71-89."},{"key":"e_1_3_2_1_9_1","volume-title":"On the Need for Large Quantum Depth. ( 2019 ). arXiv:arXiv","author":"Chia Nai-Hui","year":"1909","unstructured":"Nai-Hui Chia , Kai-Min Chung , and Ching-Yi Lai . 2019. On the Need for Large Quantum Depth. ( 2019 ). arXiv:arXiv : 1909 .10303 Nai-Hui Chia, Kai-Min Chung, and Ching-Yi Lai. 2019. On the Need for Large Quantum Depth. ( 2019 ). arXiv:arXiv: 1909.10303"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892140"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_9"},{"key":"e_1_3_2_1_13_1","volume-title":"Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). ( 2019 ). arXiv:arXiv","author":"Coudron Matthew","year":"1909","unstructured":"Matthew Coudron and Sanketh Menda . 2019. Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). ( 2019 ). arXiv:arXiv : 1909 .10503 Matthew Coudron and Sanketh Menda. 2019. Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle). ( 2019 ). arXiv:arXiv: 1909.10503"},{"key":"e_1_3_2_1_14_1","unstructured":"Matthew Coudron and Sanketh Menda. 2019. Personal communication. ( 2019 ).  Matthew Coudron and Sanketh Menda. 2019. Personal communication. ( 2019 )."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Peter Hoyer and Robert Spalek. 2005. Quantum Fan-out is Powerful. Theory of Computing 1 ( 01 2005 ) 81-103.  Peter Hoyer and Robert Spalek. 2005. Quantum Fan-out is Powerful. Theory of Computing 1 ( 01 2005 ) 81-103.","DOI":"10.4086\/toc.2005.v001a005"},{"key":"e_1_3_2_1_16_1","unstructured":"IBM. 2017. IBM Announces Advances to IBM Quantum Systems & Ecosystem. ( 2017 ). https:\/\/www-03.ibm.com\/press\/us\/en\/pressrelease\/53374.wss  IBM. 2017. IBM Announces Advances to IBM Quantum Systems & Ecosystem. ( 2017 ). https:\/\/www-03.ibm.com\/press\/us\/en\/pressrelease\/53374.wss"},{"key":"e_1_3_2_1_17_1","unstructured":"Richard Jozsa. 2005. An introduction to measurement based quantum computation. Quantum Information Processing 199 (09 2005 ).  Richard Jozsa. 2005. An introduction to measurement based quantum computation. Quantum Information Processing 199 (09 2005 )."},{"key":"e_1_3_2_1_18_1","unstructured":"Julian Kelly. 2018. A Preview of Bristlecone Google's New Quantum Processor. https:\/\/ai.googleblog.com\/ 2018 \/03\/a-preview-of-bristlecone-googlesnew.html. ( 2018 ).  Julian Kelly. 2018. A Preview of Bristlecone Google's New Quantum Processor. https:\/\/ai.googleblog.com\/ 2018 \/03\/a-preview-of-bristlecone-googlesnew.html. ( 2018 )."},{"key":"e_1_3_2_1_19_1","unstructured":"Cristopher Moore and Martin Nilsson. 1998. Parallel Quantum Computation and Quantum Codes. ( 1998 ). arXiv:arXiv:quant-ph\/9808027  Cristopher Moore and Martin Nilsson. 1998. Parallel Quantum Computation and Quantum Codes. ( 1998 ). arXiv:arXiv:quant-ph\/9808027"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365701"},{"key":"e_1_3_2_1_21_1","volume-title":"DiVincenzo","author":"Terhal Barbara M.","year":"2004","unstructured":"Barbara M. Terhal and David P . DiVincenzo . 2004 . Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games. Quantum Information & Computation 4, 2 ( 2004 ), 134-145. http:\/\/dblp.uni-trier.de\/db\/ journals\/qic\/qic4.html#TerhalD04 Barbara M. Terhal and David P. DiVincenzo. 2004. Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games. Quantum Information & Computation 4, 2 ( 2004 ), 134-145. http:\/\/dblp.uni-trier.de\/db\/ journals\/qic\/qic4.html#TerhalD04"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_12"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2817206"}],"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.3384291","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384291","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.3384291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":23,"alternative-id":["10.1145\/3357713.3384291","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384291","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"}}]}}