Quantcast
  • Register
PhysicsOverflow is a next-generation academic platform for physicists and astronomers, including a community peer review system and a postgraduate-level discussion forum analogous to MathOverflow.

Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.

Please help promote PhysicsOverflow ads elsewhere if you like it.

News

New features!

Please do help out in categorising submissions. Submit a paper to PhysicsOverflow!

... see more

Tools for paper authors

Submit paper
Claim Paper Authorship

Tools for SE users

Search User
Reclaim SE Account
Request Account Merger
Nativise imported posts
Claim post (deleted users)
Import SE post

Users whose questions have been imported from Physics Stack Exchange, Theoretical Physics Stack Exchange, or any other Stack Exchange site are kindly requested to reclaim their account and not to register as a new user.

Public \(\beta\) tools

Report a bug with a feature
Request a new functionality
404 page design
Send feedback

Attributions

(propose a free ad)

Site Statistics

123 submissions , 104 unreviewed
3,547 questions , 1,198 unanswered
4,549 answers , 19,357 comments
1,470 users with positive rep
410 active unimported users
More ...

Depolarizing threshold for CSS codes

+ 8 like - 0 dislike
15 views

Many years ago, when CSS codes were first invented, the error threshold of p=0.11 was found when bit and phase flips are independent. Has a threshold yet been found for the case of depolarizing noise?

This post has been migrated from (A51.SE)
asked Dec 16, 2011 in Theoretical Physics by James (120 points) [ no revision ]

3 Answers

+ 8 like - 0 dislike

I don't think the maximum threshold over all codes is known, but thresholds above 15% have been shown for specific codes. See, for example, arXiv:0905.0531 (p=0.155), Phys Rev Lett 104 050504 (p=0.164), arXiv:1006.1362 (p=0.152) and arXiv:quant-ph/0606126 (p=0.188).

This post has been migrated from (A51.SE)
answered Dec 17, 2011 by Joe Fitzsimons (3,555 points) [ no revision ]
@AshleyStephens: Great edit! Perhaps it should have been an answer it it's own right.

This post has been migrated from (A51.SE)
+ 7 like - 0 dislike

Are you asking about the threshold for minimum distance or for channel capacity? The distinction is whether you want to fix all errors in $p n$ or fewer qubits, or just random errors on $pn$ or fewer qubits. From the way you worded your question, I am assuming you want to fix a random error on $pn$ qubits.

If you choose a random CSS code, and correct it by finding the smallest number of errors total which agree with the syndrome, I believe that asymptotically it should work up to the point where $$ H_2(p) + p\, \log_2 3 = 1, $$ where $H_2(p)$ is the binary entropy function. This gives an error rate of $p=0.189\,$. This is the same rate you get for a random stabilizer code.

The way to see this is to count the number of likely errors with error rate $pn$, and then take the log of this to figure out how many bits need to be in the syndrome to correct them. Unless there is some dependence among the syndrome bits when you restrict to likely errors, this gives the result above. And with random CSS codes, you can show that there is no such dependence.

This might seem to be incompatible with the $p=0.11$ result for independent errors, but it's not. In the case where the bit errors and the phase errors are independent, stabilizer codes can work for a rate of $p= 0.11$ bit errors and $p=0.11$ phase errors, which works out to a rate of $p=0.208$ total errors.

This post has been migrated from (A51.SE)
answered Dec 19, 2011 by Peter Shor (780 points) [ no revision ]
+ 4 like - 0 dislike

The threshold for depolarizing noise is not known. It is known that the natural way of choosing a random CSS or random stabilizer code does not achieve the thresold. The latest reference I am aware of is quant-ph/0604107 by Smith and Smolin, which extends previous work on degenerate codes by Shor and others. By using a random CSS code concatenated on top of multiple layers of repetition codes, they apparently show a threshold of 19.086% compared to 18.93% from the hashing bound (explained in Peter's answer).

(This answer is based on quickly skimming the Smith-Smolin paper, so I may have missed some subtlety.)

This post has been migrated from (A51.SE)
answered Dec 23, 2011 by Anonymous (40 points) [ no revision ]
Thanks for your answers. So what exactly is this hashing bound of 0.189, and why can the codes described above beat it? For the case of independent bit and phase flips I suppose that the corresponding bound is H(p_x) + H(p_z) = 1 for p_x the probability of a bit flip on each qubit and p_z for a phase flip. This gives the value of 0.11 when p_x=p_z. Could there be a code like the above that could beat this bound, or is this really the best any code can do?

This post has been migrated from (A51.SE)
I don't think you've missed anything, and I also don't know of any later references that improve this threshold.

This post has been migrated from (A51.SE)

Your answer

Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead.
To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL.
Please consult the FAQ for as to how to format your post.
This is the answer box; if you want to write a comment instead, please use the 'add comment' button.
Live preview (may slow down editor)   Preview
Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:
p$\hbar\varnothing$sicsOverflow
Then drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds).
To avoid this verification in future, please log in or register.




user contributions licensed under cc by-sa 3.0 with attribution required

Your rights
...