TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Google claims breakthrough in quantum computer error correction

128 pointsby aarghhover 2 years ago

11 comments

texaslonghorn5over 2 years ago
<a href="https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;s41586-022-05434-1" rel="nofollow">https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;s41586-022-05434-1</a><p><a href="https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;d41586-022-04532-4" rel="nofollow">https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;d41586-022-04532-4</a><p>The FT article is a bit fluffy. here are links to the paper and briefing in Nature.
评论 #34899200 未加载
sebzim4500over 2 years ago
Like all claimed QC breakthroughs, best to wait for Scott Aaronson&#x27;s response on his blog.
评论 #34899081 未加载
评论 #34899776 未加载
abdullahkhalidsover 2 years ago
Let me break this down.<p>* In an error correction code, you encode a logical bit&#x2F;qubit into a set of physical bits&#x2F;qubits.<p>* Error correcting codes come in families, parameterized by integer distance d. Incrementing d, leads to a code with more physical bits&#x2F;qubits, n, but also the ability to correct errors on a larger number of bits&#x2F;qubits, j.<p>* If the error probability on each qubit is p, then on a code of size n, there will be on average n*p errors. It should be immediately clear that if p is small, then n*p&lt;j and the code can correct errors that occur, but if p is large then n*p&gt;j and there will be errors that the code can&#x27;t correct.<p>* If the code corrects any physical errors that do occur, then there won&#x27;t be a logical error (value of logical bit&#x2F;qubit unchanged), otherwise there will be a logical error. In summary, given a p, you have to pick the right sized code from your family so that n*p&lt;j, and you don&#x27;t incur any logical errors.<p>* Another way of saying the same thing is that if p in your hardware becomes small enough, then as you increase your distance d, your logical error rate will go down.<p>These guys are claiming that their p is small enough that the distance 5 code has a smaller logical error rate then the distance 3 code, which is indeed a breakthrough (if correct). No one has done something like this before to my knowledge.<p># Criticism<p>* The results are limited to storage errors. All they are doing is initializing the logical qubit in some initial state and repeatedly doing error-correction on it, to simulate a qubit at rest while the computation is happening elsewhere on some hypothetical other logical qubits. They have not attempted to do any experiments with applying gates to the qubits. Those will likely yield a much larger error rate. In particular, they are only testing a single logical qubit here, but the interesting gates would be two-qubit gates between two logical qubits, which are necessary to do any non-trivial computation.<p>* The experiment is limited to 25 cycles of error-detection. This means that their experiment shows that their device could hypothetically implement a depth ~25 circuit. As you might realize, useful circuits have depth many orders of magnitude larger, so this continues to be toy device.<p>The above is what immediately springs to mind, but I am sure the actual experts will soon chime in. My subjective opinion is that the technical achievements of just running the experiment are very impressive. This is a long journey to useful QCs, but this is nice milestone along the way.
评论 #34903626 未加载
throw_pm23over 2 years ago
In 15 years as a TCS researcher I have followed one heuristic: if something has the word &quot;quantum&quot; in it, I ignore (articles, surveys, conference talks, projects, etc.).<p>This is more from personal ignorance&#x2F;laziness and convenience than strong conviction: you cannot follow all areas, you have to make some choices how you spend your time, and this is one particular area that is easy to delimit. (EDIT: and if it does turn out to be a dead-end, I can be glad I made the right call.)<p>At times this policy has been quite hard to follow, and I may reconsider it sometime, but so far it has served me well.
评论 #34900516 未加载
评论 #34900680 未加载
评论 #34900882 未加载
评论 #34907824 未加载
评论 #34899897 未加载
DebtDeflationover 2 years ago
Can it factor 21 without resorting to tricks like precompilation?
评论 #34899545 未加载
f0e4c2f7over 2 years ago
A topic I&#x27;ve been interested in lately is quantum machine learning[0]. Qubits as neurons make sense as a natural architecture to me. Though, as I understand we are still somewhat early in terms of the number of available qubits being useful.<p>While reading about the actual advantages of quantum machine learning over classical machine learning something that came up was a type of error correction you can do in quantum computing that would make backpropagation faster.<p>Does anyone who understands this better know if this breakthrough might theoretically apply for that application (in the future, with more qubits of course)?<p>[0] <a href="https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Quantum_machine_learning" rel="nofollow">https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Quantum_machine_learning</a>
alphabettingover 2 years ago
Official video on the announcement <a href="https:&#x2F;&#x2F;youtu.be&#x2F;_ugJLuJ1_gM" rel="nofollow">https:&#x2F;&#x2F;youtu.be&#x2F;_ugJLuJ1_gM</a>
wwarnerover 2 years ago
Maybe I missed it, but the ft article claimed the improved error rate was due to improved cooling and better components rather that through better error correction. That’s not what the title says…
meltynessover 2 years ago
Science! <a href="https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;s41586-022-05434-1" rel="nofollow">https:&#x2F;&#x2F;www.nature.com&#x2F;articles&#x2F;s41586-022-05434-1</a>
ur-whaleover 2 years ago
<a href="https:&#x2F;&#x2F;archive.is&#x2F;nwLix" rel="nofollow">https:&#x2F;&#x2F;archive.is&#x2F;nwLix</a>
mikeceover 2 years ago
Claim != Proof
评论 #34898575 未加载
评论 #34901923 未加载
评论 #34899061 未加载