TL;DR
This paper demonstrates that combining quantum advice with non-collapsing measurements grants quantum computers the power to solve any decision problem efficiently, highlighting the potential of combined quantum enhancements.
Contribution
It shows that two hypothetical quantum enhancements together can vastly increase computational power, even though each alone is not sufficient.
Findings
Combined enhancements enable solving all decision problems in polynomial time
Neither quantum advice nor non-collapsing measurements alone are sufficient for this power
Uses locally decodable codes in the proof
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChronic Myeloid Leukemia Treatments