HackerPapers

arXiv:0802.1464quant-ph

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

Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

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-Θ(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.

arXiv comments
14 pages, 3 figures
Journal reference
DOI
Subjects
quant-phQuantum Physics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jan 2014 to Jan 2014.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Both NSA and GCHQ have quite the history of co-opting smart mathematicians to create secret theoretical advances in cryptography and cryptanalysis, which could well be relevant given a quantum computer with the following three properties: * Fully general. By this I mean capable…

      topynateView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.