{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T05:33:08Z","timestamp":1784871188195,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":24,"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":"Simons Institute for the Theory of Computing"},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["PHY-1733907, 2016245"],"award-info":[{"award-number":["PHY-1733907, 2016245"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Vannevar Bush faculty fellowship","award":["N00014-17-1-3025"],"award-info":[{"award-number":["N00014-17-1-3025"]}]},{"DOI":"10.13039\/100004358","name":"Samsung","doi-asserted-by":"publisher","award":["The Computational Power of Sampling on Quantum Computers"],"award-info":[{"award-number":["The Computational Power of Sampling on Quantum Computers"]}],"id":[{"id":"10.13039\/100004358","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.3451060","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1357-1369","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem"],"prefix":"10.1145","author":[{"given":"Andr\u00e1s","family":"Gily\u00e9n","sequence":"first","affiliation":[{"name":"California Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew B.","family":"Hastings","sequence":"additional","affiliation":[{"name":"Microsoft Quantum, USA \/ Microsoft Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Umesh","family":"Vazirani","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}],"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","DOI":"10.1137\/S0097539705447323"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384252"},{"key":"e_1_3_2_1_3_1","volume-title":"An Elementary Proof of the Quantum Adiabatic Theorem","author":"Ambainis Andris","year":"2004","unstructured":"Andris Ambainis and Oded Regev. 2004. An Elementary Proof of the Quantum Adiabatic Theorem. 2004. arxiv:quant-ph\/0411152"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2021.6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00066"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.54"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-04-20-254"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/08072689X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-009-0930-1"},{"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.1137\/16M1087072"},{"key":"e_1_3_2_1_12_1","volume-title":"Childs and Daochen Wang","author":"Andrew","year":"2020","unstructured":"Andrew M. Childs and Daochen Wang. 2020. Can graph properties have exponential quantum speedup? 2020. arxiv:2001.10520"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC12.11-12"},{"key":"e_1_3_2_1_14_1","volume-title":"Quantum computation by adiabatic evolution","author":"Farhi Edward","year":"2000","unstructured":"Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. 2000. Quantum computation by adiabatic evolution. 2000. arxiv:quant-ph\/0001106"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780646"},{"key":"e_1_3_2_1_16_1","volume-title":"Guang Hao Low, and Nathan Wiebe","author":"Gily\u00e9n Andr\u00e1s","year":"2018","unstructured":"Andr\u00e1s Gily\u00e9n, Yuan Su, Guang Hao Low, and Nathan Wiebe. 2018. Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics [Full version]. arxiv:1806.01838"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316366"},{"key":"e_1_3_2_1_18_1","unstructured":"Andr\u00e1s Gily\u00e9n and Umesh Vazirani. 2020. (Sub)Exponential advantage of adiabatic quantum computation with no sign problem. 2020. arxiv:2011.09495"},{"key":"e_1_3_2_1_19_1","volume-title":"The Power of Adiabatic Quantum Computation with No Sign Problem","author":"Hastings Matthew B.","year":"2020","unstructured":"Matthew B. Hastings. 2020. The Power of Adiabatic Quantum Computation with No Sign Problem. 2020. arxiv:2005.03791"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC13.11-12"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-11-11-361"},{"key":"e_1_3_2_1_22_1","volume-title":"Chuang","author":"Low Guang Hao","year":"2017","unstructured":"Guang Hao Low and Isaac L. Chuang. 2017. Hamiltonian Simulation by Uniform Spectral Amplification. 2017. arxiv:1707.05391"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.050501"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.53"}],"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.3451060","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451060","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":24,"alternative-id":["10.1145\/3406325.3451060","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451060","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"}}]}}