24

It is well established that there exists a noise threshold for quantum computation, such that below this threshold, the computation can be encoded in such a way that it yields the correct result with bounded probability (with at most polynomial computational overhead). This threshold depends on the encoding used and the exact nature of the noise, and it is the case that results from simulation often give thresholds much higher than what can be proved for adversarial noise models.

So my question is simply what is the highest lower bound that has been proved for independent stochastic noise?

The noise model I am referring to is the one dealt with in quant-ph/0504218, where Aliferis, Gottesman and Preskill prove a lower bound $2.73 \times 10^{-5}$. Note, however, I do not care which type of encoding is used, and it need not be restricted to the code considered in that paper. The highest I'm aware of is $1.94 \times 10^{-4}$ due to Aliferis and Cross (quant-ph/0610063). Has this value been improved upon since then?

Joe Fitzsimons
  • 13,675
  • 47
  • 91
  • Do you want a numerical or analytical value? – Matty Hoban Nov 02 '11 at 10:31
  • I'm happy with either as long as it is actually a proven lower bound, without making further assumptions on the noise other than the maximum probability of error. – Joe Fitzsimons Nov 02 '11 at 10:38
  • 2
    Great question: also known as the 1 Million Dollar question in quantum computing. I know that there can be serious improvements when one assumes a specific "architecture" in the sense that how easy or hard it is to interact distant qubits (architecture is different from the error model) For example, see here. I think the [PhD thesis of Bryan Eastin] (http://arxiv.org/abs/0710.2560) could be a good starting point to have a look at. –  Nov 02 '11 at 13:39
  • @Kaveh_kh: thanks for the link. In case it isn't clear from the question, I mean the best known threshold. – Joe Fitzsimons Nov 02 '11 at 13:47
  • @Joe, a comparably well-posed question, having both practical and fundamental implications in simulation science, is "What quantum computer architecture has the lowest proved lower bound for independent stochastic noise, such that PTIME simulation of the (noisy) computation process is possible for all error rates above the bound?" Perhaps Joe Fitzsimons might consider adjoining some version of this question to the original question? – John Sidles Nov 02 '11 at 17:31
  • @JohnSidles: That is indeed an interesting question (though I assume you want the lowest upper bound on the noise rather than a lower bound). May I suggest you ask it as a separate question? The reason I suggest that rather than amending this one is that I specifically want an answer to this question as it relates to a problem I'm working on. – Joe Fitzsimons Nov 02 '11 at 17:41
  • @JoeFitzsimons, good suggestion ... I'll go ahead and post it as a question after seeing what answers you get ... an meanwhile I'll be thinking of the most natural permutation/definition of "lowest/highest lower/upper simulable error rate" (right now it seems "lowest lower" is the interesting case). – John Sidles Nov 02 '11 at 19:32
  • @JohnSidles: Is it? Surely 0 is a lower bound on the lowest level of noise above which the system is classically simulable, but it is not interesting because it is too low. – Joe Fitzsimons Nov 02 '11 at 19:41
  • I had in mind to study the class of (error-corrected) quantum computers; each member of that class having some lowest-but-nonzero error rate for which it could be classically simulated; thus a particularly interesting case is the lowest-of-the-low-but-nonzero simulable error values. To say it in a concisely confusing way, I reckon we'd be looking for the lowest upper-bound on the lowest lower-bound of simulable error rates. – John Sidles Nov 02 '11 at 20:29
  • let us continue this discussion in chat – Joe Fitzsimons Nov 03 '11 at 06:36

2 Answers2

15

The highest threshold lower bound for for independent stochastic noise of which I am aware is $1.04 \times 10^{-3}$ by Aliferis, Gottesman and Preskill (quant-ph/0703264). They analyze Knill's teleportation-based scheme with postselection.

If you are willing to consider independent depolarizing noise, then I know of two slightly higher lower bounds: $1.25\times 10^{-3}$ by Aliferis and Preskill (arXiv:0809.5063) and $1.32 \times 10^{-3}$ by myself and Ben Reichardt (arXiv:1106.2190).

Adam Paetznick
  • 640
  • 4
  • 8
  • Depolarizing noise is a little less general than what I was looking for. The paper by Aliferis, Gottesman and Preskill you mention seems to be the answer to my question. Weirdly, now that you mention it and summarize the paper, it seems that I did see that paper when it came out, but it had drifted from my memory. Thanks, your answer is extremely helpful! – Joe Fitzsimons Nov 02 '11 at 18:41
6

The best that I am aware of is in the surface code proposal due to Fowler et al (arXiv:0803.0272), where it is shown that they achieve a bound of 0.75%.

Chris Granade
  • 326
  • 2
  • 4