English

An Upper Bound on the Threshold Quantum Decoherence Rate

Quantum Physics 2007-05-23 v1

Abstract

Let η0\eta_0 be the supremum of those η\eta for which every poly-size quantum circuit can be simulated by another poly-size quantum circuit with gates of fan-in 2\leq 2 that tolerates random noise independently occurring on all wires at the constant rate η\eta. Recent fundamental results showing the principal fact η0>0\eta_0>0 give estimates like η0106104\eta_0\geq 10^{-6}-10^{-4}, whereas the only upper bound known before is η00.74\eta_0\leq 0.74. In this note we improve the latter bound to η01/2\eta_0\leq 1/2, under the assumption QP⊈QNC1QP\not\subseteq QNC^1. More generally, we show that if the decoherence rate η\eta 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 kk, in which case we have η011/k\eta_0\leq 1-1/k.

Keywords

Cite

@article{arxiv.quant-ph/0310136,
  title  = {An Upper Bound on the Threshold Quantum Decoherence Rate},
  author = {Alexander A. Razborov},
  journal= {arXiv preprint arXiv:quant-ph/0310136},
  year   = {2007}
}

Comments

9 pages