{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:01:39Z","timestamp":1649192499520},"reference-count":0,"publisher":"Rinton Press","issue":"11&12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["QIC"],"published-print":{"date-parts":[[2018,9]]},"abstract":"<jats:p>We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself. This complements a related result due to Raz. The proof uses locally decodable codes.<\/jats:p>","DOI":"10.26421\/qic18.11-12-1","type":"journal-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T02:05:48Z","timestamp":1613786748000},"page":"901-909","source":"Crossref","is-referenced-by-count":1,"title":["PDQP\/qpoly=ALL"],"prefix":"10.26421","volume":"18","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10955","published-online":{"date-parts":[[2018,9]]},"container-title":["Quantum Information and Computation"],"original-title":[],"deposited":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T02:05:49Z","timestamp":1613786749000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rintonpress.com\/journals\/doi\/QIC18.11-12-1.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":0,"journal-issue":{"issue":"11&12","published-online":{"date-parts":[[2018,9]]},"published-print":{"date-parts":[[2018,9]]}},"URL":"https:\/\/doi.org\/10.26421\/qic18.11-12-1","relation":{},"ISSN":["1533-7146","1533-7146"],"issn-type":[{"value":"1533-7146","type":"print"},{"value":"1533-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}