  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.
