An Upper Bound on the Threshold Quantum Decoherence Rate
量子物理
2007-05-23 v1
摘要
Let 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 that tolerates random noise independently occurring on all wires at the constant rate . Recent fundamental results showing the principal fact give estimates like , whereas the only upper bound known before is . In this note we improve the latter bound to , under the assumption . 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 , in which case we have .
引用
@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}
}
备注
9 pages