An Upper Bound on the Threshold Quantum Decoherence Rate
Abstract
Description
Let $η_0$ be the supremum of those $η$ for which every poly-size quantum circuit can be simulated by another poly-size quantum circuit with gates of fan-in $\leq 2$ that tolerates random noise independently occurring on all wires at the constant rate $η$. Recent fundamental results showing the principal fact $η_0>0$ give estimates like $η_0\geq 10^{-6}-10^{-4}$, whereas the only upper bound known before is $η_0\leq 0.74$.
In this note we improve the latter bound to $η_0\leq 1/2$, under the assumption $QP\not\subseteq QNC^1$. More generally, we show that if the decoherence rate $η$ is greater than 1/2, then we can not even store a single qubit for more than logarithmic time. Our bound also generalizes to the simulating circuits allowing gates of any (constant) fan-in $k$, in which case we have $η_0\leq 1-1/k$.
9 pages
9 pages