{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:39:48Z","timestamp":1779316788952,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":56,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"AFOSR","award":["FA9550-18-1-0148 and FA9550-21-1-0008"],"award-info":[{"award-number":["FA9550-18-1-0148 and FA9550-21-1-0008"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2044923"],"award-info":[{"award-number":["CCF-2044923"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451051","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1343-1356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Eliminating intermediate measurements in space-bounded Quantum computation"],"prefix":"10.1145","author":[{"given":"Bill","family":"Fefferman","sequence":"first","affiliation":[{"name":"University of Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Remscrim","sequence":"additional","affiliation":[{"name":"University of Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC9.1-2-5"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276708"},{"key":"e_1_3_2_1_3_1","volume-title":"Quantum NP-a survey. arXiv preprint quant-ph\/0210077","author":"Aharonov Dorit","year":"2002","unstructured":"Dorit Aharonov and Tomer Naveh. 2002. Quantum NP-a survey. arXiv preprint quant-ph\/0210077, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1996300100011"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_1_6_1","volume-title":"On computing the determinant in small parallel time using a small number of processors. Information processing letters, 18, 3","author":"Berkowitz Stuart J","year":"1984","unstructured":"Stuart J Berkowitz. 1984. On computing the determinant in small parallel time using a small number of processors. Information processing letters, 18, 3, 1984. Pages 147\u2013150."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591854"},{"key":"e_1_3_2_1_8_1","volume-title":"a, Lior Eldar, and Saeed Mehraban","author":"Enric","year":"2019","unstructured":"Enric Boix-Adser\\`a, Lior Eldar, and Saeed Mehraban. 2019. Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits. arXiv preprint arXiv:1912.03824, 2019."},{"key":"e_1_3_2_1_9_1","first-page":"2011","article-title":"Efficient algorithm for a quantum analogue of 2-SAT","volume":"536","author":"Bravyi Sergey","year":"2011","unstructured":"Sergey Bravyi. 2011. Efficient algorithm for a quantum analogue of 2-SAT. Contemp. Math., 536, 2011. Pages 33\u201348.","journal-title":"Contemp. Math."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Harry Buhrman John Tromp and Paul Vit\u00e1nyi. 2001. Time and space bounds for reversible simulation. In International Colloquium on Automata Languages and Programming. Pages 1017\u20131027.","DOI":"10.1007\/3-540-48224-5_82"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-009-0930-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80041-3"},{"key":"e_1_3_2_1_13_1","volume-title":"Fachbereich Informatik der Humboldt-Universitat zu","author":"Damm C","year":"1991","unstructured":"C Damm. 1991. DET=L(\\#L). Fachbereich Informatik der Humboldt-Universitat zu, Berlin, 1991."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/1521-3978(200009)48:9\/11<771::AID-PROP771>3.0.CO;2-E"},{"key":"e_1_3_2_1_15_1","volume-title":"On approximating the eigenvalues of stochastic matrices in probabilistic logspace. computational complexity, 26, 2","author":"Doron Dean","year":"2017","unstructured":"Dean Doron, Amir Sarid, and Amnon Ta-Shma. 2017. On approximating the eigenvalues of stochastic matrices in probabilistic logspace. computational complexity, 26, 2, 2017. Pages 393\u2013420."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.03.005"},{"key":"e_1_3_2_1_17_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP","author":"Fefferman Bill","year":"2016","unstructured":"Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, and Harumichi Nishimura. 2016. Space-Efficient Error Reduction for Unitary Quantum Computations. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)."},{"key":"e_1_3_2_1_18_1","volume-title":"9th Innovations in Theoretical Computer Science Conference (ITCS","author":"Fefferman Bill","year":"2018","unstructured":"Bill Fefferman and Cedric Yen-Yu Lin. 2018. A Complete Characterization of Unitary Quantum Space. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)."},{"key":"e_1_3_2_1_19_1","volume-title":"Eliminating intermediate measurements in space-bounded quantum computation. arXiv preprint arXiv:2006.03530","author":"Fefferman Bill","year":"2020","unstructured":"Bill Fefferman and Zachary Remscrim. 2020. Eliminating intermediate measurements in space-bounded quantum computation. arXiv preprint arXiv:2006.03530, 2020."},{"key":"e_1_3_2_1_20_1","first-page":"7","article-title":"Simulating physics with computers","volume":"21","author":"Feynman Richard P","year":"1999","unstructured":"Richard P Feynman. 1999. Simulating physics with computers. Int. J. Theor. Phys, 21, 6\/7, 1999.","journal-title":"Int. J. Theor. Phys"},{"key":"e_1_3_2_1_21_1","volume-title":"Quantum logspace algorithm for powering matrices with bounded norm. arXiv preprint arXiv:2006.04880","author":"Girish Uma","year":"2020","unstructured":"Uma Girish, Ran Raz, and Wei Zhan. 2020. Quantum logspace algorithm for powering matrices with bounded norm. arXiv preprint arXiv:2006.04880, 2020."},{"key":"e_1_3_2_1_22_1","volume-title":"Quantum algorithm for linear systems of equations. Physical review letters, 103, 15","author":"Harrow Aram W","year":"2009","unstructured":"Aram W Harrow, Avinatan Hassidim, and Seth Lloyd. 2009. Quantum algorithm for linear systems of equations. Physical review letters, 103, 15, 2009. Pages 150502."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC12.5-6-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2009.0433"},{"key":"e_1_3_2_1_26_1","first-page":"6","article-title":"Quantum computations: algorithms and error correction","volume":"52","author":"Kitaev Aleksei Yur'evich","year":"1997","unstructured":"Aleksei Yur'evich Kitaev. 1997. Quantum computations: algorithms and error correction. Uspekhi Matematicheskikh Nauk, 52, 6, 1997. Pages 53\u2013112.","journal-title":"Uspekhi Matematicheskikh Nauk"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24587-2_21"},{"key":"e_1_3_2_1_28_1","volume-title":"Irreversibility and heat generation in the computing process. IBM journal of research and development, 5, 3","author":"Landauer Rolf","year":"1961","unstructured":"Rolf Landauer. 1961. Irreversibility and heat generation in the computing process. IBM journal of research and development, 5, 3, 1961. Pages 183\u2013191."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1672"},{"key":"e_1_3_2_1_30_1","first-page":"1078","volume-title":"Science","author":"Lloyd Seth","year":"1996","unstructured":"Seth Lloyd. 1996. Universal quantum simulators. Science, 1996. Pages 1073\u20131078."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/866057"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-005-0194-x"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a001"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC9.11-12-8"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Michael A Nielsen and Isaac Chuang. 2002. Quantum computation and quantum information.","DOI":"10.1119\/1.1463744"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305237"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950600538X"},{"key":"e_1_3_2_1_38_1","first-page":"18","volume-title":"47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs). 168","author":"Remscrim Zachary","year":"2020","unstructured":"Zachary Remscrim. 2020. The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs). 168, Pages 139:1\u2013139:18."},{"key":"e_1_3_2_1_39_1","volume-title":"Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines. In 12th Innovations in Theoretical Computer Science Conference (ITCS","author":"Remscrim Zachary","year":"2021","unstructured":"Zachary Remscrim. 2021. Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.032308"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1996.507676"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1616"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001596"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC8.8-9-1"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488720"},{"key":"e_1_3_2_1_47_1","unstructured":"Seinosuke Toda. 1991. Counting problems computationally equivalent to the determinant."},{"key":"e_1_3_2_1_48_1","first-page":"1992","article-title":"Why is Boolean complexity theory difficult","volume":"169","author":"Valiant Leslie G","year":"1992","unstructured":"Leslie G Valiant. 1992. Why is Boolean complexity theory difficult. Boolean Function Complexity, 169, 1992. Pages 84\u201394.","journal-title":"Boolean Function Complexity"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160269"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1655"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1732"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-003-0177-8"},{"key":"e_1_3_2_1_53_1","volume-title":"Encyclopedia of Complexity and System Science","author":"Watrous John","unstructured":"John Watrous. 2009. Encyclopedia of Complexity and System Science, chapter Quantum computational complexity."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/060670997"},{"key":"e_1_3_2_1_55_1","volume-title":"The theory of quantum information","author":"Watrous John","unstructured":"John Watrous. 2018. The theory of quantum information. Cambridge University Press."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18625-5_67"}],"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.3451051","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451051","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451051","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.3451051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":56,"alternative-id":["10.1145\/3406325.3451051","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451051","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"}}]}}