New answers tagged quantum-computing
4
Well one piece of evidence against PP being in BQP is that PP contains QMA, which is the NP equivalent of BQP.
2
I don't think you have to do iterations over $r'$ for checking. In fact, performing iterations would lead to $O(L^4)$ complexity instead of $O(L^3)$ as claimed in the textbook. So how do we know which convergent of the continued fraction is the one we are looking for? The way is as follows.
First, I'll post some facts in number theory here.
Fact 1. Let $ \...
0
If it should prove useful, this is a derivation of the inequality
$$
\frac{1}{n} \| \Phi_0 - \Phi_1 \|_{\Diamond} \leq
\| J(\Phi_0) - J(\Phi_1) \|_1
$$
in John Watrous' answer. We will make use of the (basis-dependent) operator-vector correspondence denoted as $\operatorname{Vec}$: for any operator $A:M_n(\mathbb{C}) \to M_{n'}(\mathbb{C})$, we define a ...
4
I emailed the author.
He replied "yes that paper is wrong!".
He has lost the passwords to remove it from the web.
2
Yes, it seems to be available on this link.
Top 50 recent answers are included
