PDQP/qpoly = ALL
Quantum Physics
2018-05-23 v1 Computational Complexity
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 time, even though neither enhancement yields extravagant power by itself. This complements a related result due to Raz. The proof uses locally decodable codes.
Cite
@article{arxiv.1805.08577,
title = {PDQP/qpoly = ALL},
author = {Scott Aaronson},
journal= {arXiv preprint arXiv:1805.08577},
year = {2018}
}
Comments
9 pages, an easy read