{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:29:20Z","timestamp":1763458160827,"version":"3.45.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T00:00:00Z","timestamp":1505865600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1122374, 1249349"],"award-info":[{"award-number":["1122374, 1249349"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["XRDS"],"published-print":{"date-parts":[[2016,9,20]]},"abstract":"<jats:p>What are quantum computers good for? This essay reviews the progress toward proving a quantum advantage over classical computing.<\/jats:p>","DOI":"10.1145\/2983543","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T08:42:46Z","timestamp":1474447366000},"page":"40-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Establishing quantum advantage"],"prefix":"10.1145","volume":"23","author":[{"given":"Adam","family":"Bouland","sequence":"first","affiliation":[{"name":"MIT"}]}],"member":"320","published-online":{"date-parts":[[2016,9,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Google and NASA's Quantum Artificial Intelligence Lab. YouTube. October 11 2013 https:\/\/www.youtube.com\/watch?v=CMdHDHEuOUE Time 4:57"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_2_1_3_1","first-page":"4","article-title":"The computational complexity of linear optics","volume":"9","author":"Aaronson S.","year":"2013","unstructured":"Aaronson, S., and Arkhipov, A. The computational complexity of linear optics. Theory of Computing 9, 4 (2013), 143--252.","journal-title":"Theory of Computing"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2010.0301"}],"container-title":["XRDS: Crossroads, The ACM Magazine for Students"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2983543","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2983543","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2983543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:18:50Z","timestamp":1763457530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2983543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,20]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9,20]]}},"alternative-id":["10.1145\/2983543"],"URL":"https:\/\/doi.org\/10.1145\/2983543","relation":{},"ISSN":["1528-4972","1528-4980"],"issn-type":[{"type":"print","value":"1528-4972"},{"type":"electronic","value":"1528-4980"}],"subject":[],"published":{"date-parts":[[2016,9,20]]},"assertion":[{"value":"2016-09-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}