{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:46:29Z","timestamp":1787507189251,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1249349"],"award-info":[{"award-number":["1249349"]}]},{"name":"ERC","award":["600700"],"award-info":[{"award-number":["600700"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746547","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T11:35:56Z","timestamp":1433331356000},"page":"307-316","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Forrelation"],"prefix":"10.1145","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andris","family":"Ambainis","sequence":"additional","affiliation":[{"name":"University of Latvia, Riga, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806711"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.06.006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0978-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442416"},{"key":"e_1_3_2_1_6_1","first-page":"145","volume-title":"Proc. FSTTCS","author":"Chakraborty S.","year":"2010","unstructured":"S. Chakraborty , E. Fischer , A. Matsliah , and R. de Wolf . New results on quantum property testing . In Proc. FSTTCS , pages 145 -- 156 , 2010 . arXiv:1005.0523. S. Chakraborty, E. Fischer, A. Matsliah, and R. de Wolf. New results on quantum property testing. In Proc. FSTTCS, pages 145--156, 2010. arXiv:1005.0523."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.04.001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132580"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-012-0043-7"},{"key":"e_1_3_2_1_11_1","volume-title":"A note on the classical lower bound for a quantum walk algorithm. quant-ph\/0312230v1","author":"Fenner S.","year":"2003","unstructured":"S. Fenner and Y. Zhang . A note on the classical lower bound for a quantum walk algorithm. quant-ph\/0312230v1 , 2003 . S. Fenner and Y. Zhang. A note on the classical lower bound for a quantum walk algorithm. quant-ph\/0312230v1, 2003."},{"key":"e_1_3_2_1_12_1","volume-title":"A survey of quantum property testing. arXiv:1310.2035","author":"Montanaro A.","year":"2013","unstructured":"A. Montanaro and R. de Wolf . A survey of quantum property testing. arXiv:1310.2035 , 2013 . A. Montanaro and R. de Wolf. A survey of quantum property testing. arXiv:1310.2035, 2013."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133080"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365701"}],"event":{"name":"STOC '15: Symposium on Theory of Computing","location":"Portland Oregon USA","acronym":"STOC '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:56:03Z","timestamp":1750258563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746547"}},"subtitle":["A Problem that Optimally Separates Quantum from Classical Computing"],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":15,"alternative-id":["10.1145\/2746539.2746547","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746547","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}