QuantumComputing
Post #7330 · source on Telegram
Google AI Announces Quantum Computing Breakthrough: 13,000x Faster Than Classical
Description
A screenshot of a tweet from @GoogleAI (verified) announcing a major quantum computing breakthrough. The text states that for the first time in history, teams at @GoogleQuantumAI demonstrated a quantum computer can successfully run a verifiable algorithm 13,000x faster than leading classical supercomputers. It references building on 2019's quantum supremacy proof and 2024's Willow chip solving quantum error correction. The post positions this as a step toward practical quantum computing for medicine and materials science
More like this
More like this in QuantumComputing →
Use J and K for navigation
Comments
25Comment deleted
13,000x faster is impressive until you realize the verifiable algorithm was probably 'generate a random number' -- the one thing quantum computers have always been overqualified for
OpenAI drops a new JavaScript framework, and the world loses its mind. Google casually hints at breaking modern cryptography, and the only people who notice are three physicists and everyone who has to update their threat models
Great - now we can run Hello World in 3.7 yoctoseconds, as long as the dilution fridge doesn’t need a reboot
13,000x faster sounds impressive until you realize it still can't compile your node_modules folder before the heat death of the universe
When your quantum computer is 13,000x faster but still can't decide if the bug is in superposition or just your code
Willow's error correction breakthrough: finally, qubits that stay stable longer than a junior dev's feature branch
Cool - 13,000x faster on a “verifiable algorithm”; wake me when the error rate and cooling budget are 13,000x smaller
Wake me up when it runs Doom Comment deleted
+nft Comment deleted
+AR/VR Comment deleted
+yet another variation of a butthole as a logo Comment deleted
Can this quantum computer show a videos of cute cats to us? 😻 Comment deleted
ok but can you f*ck it tho? Comment deleted
Ok, now let's find at least one useful verifiable algorithm. Comment deleted
The only useful quantum computers are annealers, for the next decade at least Comment deleted
short variational algorithms look promising on discrete qubit machines Comment deleted
They are good at optimization problems on a scale most people don’t need Comment deleted
Googles big quantum result last time was “look guys we have real random numbers” which is babbys first quantum demo Comment deleted
Now they say they have some echo wave modelling thing, which is cute but again, too niche to be meaningful Comment deleted
most likely photonic implementations are the only ones that will have a significant speedup long term Comment deleted
I know some folks at a photonics company and they do have some progress but again the qubit count is really low and will be for a long time Comment deleted
Josephson junctions remain the best, most proven mechanism for a qubit Comment deleted
I have always wanted an optical computer, I wonder is anyone is still working on optical classical compute Comment deleted
fault tolerant optical quantum computer Comment deleted
you have a very distant vision Comment deleted