An Upper Bound on the Threshold Quantum Decoherence Rate

Abstract

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 ≤ 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≥ 10-6-10-4, whereas the only upper bound known before is η0≤ 0.74. In this note we improve the latter bound to η0≤ 1/2, under the assumption QP⊂eq QNC1. 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≤ 1-1/k.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…