Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 3 figures

Scientific paper

We prove new upper bounds on the tolerable level of noise in a quantum circuit. We consider circuits consisting of unitary k-qubit gates each of whose input wires is subject to depolarizing noise of strength p, as well as arbitrary one-qubit gates that are essentially noise-free. We assume that the output of the circuit is the result of measuring some designated qubit in the final state. Our main result is that for p>1-\Theta(1/\sqrt{k}), the output of any such circuit of large enough depth is essentially independent of its input, thereby making the circuit useless. For the important special case of k=2, our bound is p>35.7%. Moreover, if the only allowed gate on more than one qubit is the two-qubit CNOT gate, then our bound becomes 29.3%. These bounds on p are notably better than previous bounds, yet are incomparable because of the somewhat different circuit model that we are using. Our main technique is the use of a Pauli basis decomposition, which we believe should lead to further progress in deriving such bounds.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-625609

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.