BQP_p = PP for integer p > 2
Abstract
There's something really strange about quantum mechanics. It's not just that cats can be dead and alive at the same time, and that entanglement seems to violate the principle of locality; quantum mechanics seems to be what Aaronson calls "an island in theoryspace", because even slight perturbations to the theory of quantum mechanics seem to generate absurdities. In [Aar 04] and [Aar 05], he explores these perturbations and the corresponding absurdities in the context of computation. In particular, he shows that a quantum theory where the measurement probabilities are computed using p-norm instead of the standard 2-norm has the effect of blowing up the class BQP (the class of problems that can be efficiently solved on a quantum computer) to at least PP (the class of problems that can be solved in probabilistic polynomial time). He showed that PP \subseteq BQP_p \subseteq PSPACE for all constants p != 2, and that BQP_p = PP for even integers p > 2. Here, we show that this equality holds for all integers p > 2.
Keywords
Cite
@article{arxiv.1106.0572,
title = {BQP_p = PP for integer p > 2},
author = {Joseph Bebel and Henry Yuen},
journal= {arXiv preprint arXiv:1106.0572},
year = {2011}
}
Comments
This paper has been withdrawn by the authors due to the fact that strong error reduction for BQP_p problems is significantly more subtle than demonstrated, which compromises the main result