PDQP/qpoly = ALL

Shtetl-Optimized 2018-05-19

Summary:

I’ve put up a new paper.  Unusually for me these days, it’s a very short and simple one (8 pages)—I should do more like this!  Here’s the abstract: 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 […]

Link:

https://www.scottaaronson.com/blog/?p=3816

From feeds:

Online Mathematical Communication » Shtetl-Optimized

Tags:

Authors:

Scott

Date tagged:

05/19/2018, 08:47

Date published:

05/19/2018, 08:45