-
Amazon's self publishing service
-
Here we study the performance of a concatenated error-detection code in a system that permits only nearest-neighbor interactions in one dimension. We make use of a new message-passing scheme which maximizes the number of errors that can be reliably corrected by the code. Our numerical results indicate that arbitrarily accurate universal quantum computation is possible if the probability of failure of each elementary physical operation is below approximately 10^{-5}. This threshold is three orders of magnitude lower than the highest known.
- Log in to post comments
More like this
One of the coauthors on the paper which I claimed was shoddy has written a comment in the original post. Which merits more commenting! But why comment in the comment section when you can write a whole blog post replying!
The paper in question is 0804.3076, and the commenter is George Viamontes:…
Quantum error correction and quantum hard drives in four dimension. Part IV of my attempt to explain one of my main research interests in quantum computing:
Prior parts: Part I, Part II, Part III.
Quantum Error Correction
Classical error correction worked by encoding classical information across…
A Simple Introduction to Quantum Groups « XOR's Hammer
(tags: quantum groups)
Backreaction: Corot-Exo-7b: A Venus in another World
the discovery of an Earth-like planet around a Sun-like star in the constellation of Monoceros, at a distance of about 450 light years.
(tags: planets astronomy…
Okay, well apparently the paper arXiv:0804.3076 which I mentioned in the last post is being picked up by other bloggers (see here and here as well as here) as a legitimate criticism of quantum computing. So before anymore jump on this bad wagon let me explain exactly what is wrong with this paper…
That's a cool way to publish your lecture notes!