4 ms·
Strange timing given the claim was in 2019, guess this post was generated because of Willow. Google claims to have proved its supremacy with new quantum comput
by gnabgib 2y ago
Strange timing given the claim was in 2019, guess this post was generated because of Willow.
Google claims to have proved its supremacy with new quantum computer (256 points, 1 year ago, 229 comments) https://news.ycombinator.com/item?id=36567839 https://news.ycombinator.com/item?id=36567839
Quantum computers: amazing progress, but probably false supremacy claims (126 points, 5 years ago, 73 comments) https://news.ycombinator.com/item?id=21167368 https://news.ycombinator.com/item?id=21167368
Google Achieves Quantum Supremacy. Is Encryption Safe? (38 points, 5 years ago, 21 comments) https://news.ycombinator.com/item?id=21100983 https://news.ycombinator.com/item?id=21100983
Google claims to have reached quantum supremacy (114 points, 5 years ago, 21 comments) https://news.ycombinator.com/item?id=21029598 https://news.ycombinator.com/item?id=21029598
Google Engineers Think This 72-Qubit Processor Can Achieve Quantum Supremacy (91 points, 7 years ago, 42 comments) https://news.ycombinator.com/item?id=16543876 https://news.ycombinator.com/item?id=16543876
Google plans to reach a Quantum Computing milestone before the year is out (147 points, 8 years ago, 49 comments) https://news.ycombinator.com/item?id=14171992 https://news.ycombinator.com/item?id=14171992
- bawolff 2y agoThey added a paragraph at the end to address the new experiment. Still nothing really new here. I'm doubtful anything will convince the author short of shor's algorithm actually factoring large numbers.
- thesz 2y agohttps://eprint.iacr.org/2015/1018.pdf https://eprint.iacr.org/2015/1018.pdf As pointed out in [57], there has never been a genuine implementation of Shor’s algorithm. The only numbers ever to have been factored by that type of algorithm are 15 and 21, and those factorizations used a simplified version of Shor’s algorithm that requires one to know the factorization in advance.
- adastra22 2y agoWhat’s the point of quoting this?
- thesz 2y agoTo me it was eye opening on how skewed is the presentation of these quantum computing number factoring advances. It is completely in line of the "The Case Against..."
- adastra22 2y agoNo one is claiming number factoring advances. That would require much longer lived qubits entanglement than is currently possible. The tech is clearly advancing forward though.
- bawolff 2y agoThat feels like a straw man. Nobody was claiming otherwise.
- rcxdude 2y agoIt feels more like the time to develop the tech has outlived the hype cycle around the tech, perhaps moreso than usual. That doesn't mean it isn't going anywhere, just that it's still slow (and in fact, after the hype cycle, the average press release is more likely to be substantive than during it, even if it's still incremental). (From my reading/understanding of it, for a while there's been little point in trying to make a quantum computer big enough to do such work, because the individual parts would not work well enough for it to have any chance of success, while this result primarily is showing that they're now at the cusp of the predicted tipping point where the qubits have a low enough error rate that building a larger system out of them has a hope of working. That's the big news in google's recent announcement, not them pushing up the numbers in this somewhat contrived benchmark)
- sampo 2y ago> What’s the point of quoting this? To remind us of the large difference between the public image vs the reality of quantum computing. Expectation: From the news, people are getting a feeling that quantum computing revolution is almost behind the corner, and current cryptosystems will soon become irrelevant. People are (here, in Hacker News) asking "is our society ready for this", "what could I do if I had this chip at home", "existing cryptography technology is in danger", "is it time to 100x key length on browsers". Reality: Using Shor's algorithm to factor 15 = 5×3 is still far beyond the reach of current quantum computers. We can factor 15 = 5×3 and even 21 = 7×3 if we cheat by eliminating those branches from the calculation that are not on the happy path the correct answer.
- drpossum 2y agoA big part of all these discussions is "why should you trust any computational result you can't verify?"
- evandrofisico 2y agoA big problem in science in general is reproducibility. There are thousands of papers being published every month with peer review, which prunes out the most obvious errors, but the whole system is built on trust. Very few labs around the world are tasked with testing results instead of trying to produce new science, and in this specific case, only google has access to the device being built and the computation tested by them impossible to verify with classic computers, unlike Shor's algorithm which is trivial to test with known primes.
- bawolff 2y agoBecause you can verify it part of the way there. The point is to ensure that researchers are actually doing what they think they are doing and not deluding themselves. Its not meant to prevent outright fraud.
- deleted 2y ago[deleted]
- thesz 2y agoYes, it contains "I) Update (Dec. 10): The Wind in the Willow"
- sampo 2y ago> Strange timing given the claim was in 2019 In 2024 Google used 67 quantum bits to solve the same/similar random circuit sampling benchmark, that they used 53 bits in 2019. The discussion from 2019 on what is the relevance (if any) of solving random circuit simulation problems, is equally valid today. Maybe in 2030 Google or someone will use 200 or 400 bits to solve an even bigger instance of the random circuit simulation benchmark problem, and then we get to have this same discussion once again.