Loading video...

Video Failed to Load

Go Home

Quoting from the blog: 'Claude has proven particularly adept at optimizing classical algorithms, so we wanted to see whether it could do the same for quantum algorithms if it were given only a plain-language description of what each circuit must compute. Claude is unusually well suited to this task,...

18,352 views • 18 days ago •via X (Twitter)

19 Comments

Andrew Curran's profile picture
Andrew Curran18 days ago

'Claude recognized that this divsteps approach could be promising for quantum circuits, but only if there were a way around needing to store the full history. It had an idea: perhaps the record didn’t need to be stored at all. Claude reasoned that it might be possible to directly infer (or “decode”) the branch information by carefully inspecting the pair of numbers after each iteration. In essence, the numbers themselves would store the record. The circuit could then be run backward without needing any extra qubits. To test this idea, Claude explored a number of simple candidate rules for performing the decoding. These early rules worked on small test cases, but they failed when Claude tested them at the full problem size, on 256-bit numbers. Claude then tried a more theoretical approach. Rather than guessing and testing rules, it set out to understand mathematically why divsteps behaves the way it does. It proved a series of results about the iteration process, including several new algebraic identities. From these identities, Claude derived a precise formula for the decoding rule that would correctly recover the branch information from the numerical pairs. It then checked the formula, first by running it through large-scale numerical simulations, and then formalizing the claim in Lean. With the full validation complete, Claude produced the first reversible implementation of divsteps with no stored branch history.'

Andrew Curran's profile picture
Andrew Curran18 days ago

'Together, these optimizations reduced the number of gates in the decoder by a factor of 12 relative to Google’s previous construction. The improvement came from redesigning the computation at three levels: a different method (replacing the extended Euclidean algorithm with Berlekamp–Massey decoding), a different circuit architecture (reconstructing temporary values instead of storing them), and a different resource budget (measuring precisely how much memory and computation the circuit really needed). No single change would have been enough on its own, but together, they make the most expensive step of DQI just a little over an order of magnitude cheaper.'

Chris's profile picture
Chris18 days ago

😉

赛博吴同学 Jax Wu's profile picture
赛博吴同学 Jax Wu18 days ago

白话指令就能把量子电路压过论文里的最优,有时还差一个数量级。我更在意它砍掉的是真冗余,还是上真机才暴露的坑。

Alina Fomina's profile picture
Alina Fomina18 days ago

beating sota on the primitives means every quantum algorithm built on top of them just got cheaper

甜茶's profile picture
甜茶18 days ago

模型自己提案迭代 跟自动调参一个路子

Diego Alejandro's profile picture
Diego Alejandro18 days ago

Mythos 5

Limy's profile picture
Limy18 days ago

please tell me the quantum computer has a CLAUDE.md

Candyman's profile picture
Candyman18 days ago

We’re going vertical

Chahat Sharma's profile picture
Chahat Sharma18 days ago

does the score weight gates equally? afaik a Toffoli costs way more than a CNOT once you're fault tolerant, so qubits x gates could miss that. curious if the blog breaks out Toffoli counts per primitive

Vraj Talati's profile picture
Vraj Talati18 days ago

being able to check every answer is a pretty big advantage here

Mild Mannered Maniac's profile picture
Mild Mannered Maniac18 days ago

And current claude is just a little baby compared to what's around the corner. It's coming

Kirk Patrick Miller's profile picture
Kirk Patrick Miller18 days ago

Wait until they see everything I did with open source. US AI can’t do square. (Grok and muse seem somewhat viable) -no medicine -no quantum fractal coding -no phi-harmonics -no biology -no chemistry -no law Claude *can,* but is not *allowed.* Showing off things you don’t let anyone else do as a sales pitch is stupid. Junk IPO. Both anthropic and OpenAi. Oh, and I’ll keep dropping this too. -they harmed and gaslit users for over a year. Liable. Provable. Biological harm. •

Moon's profile picture
Moon18 days ago

claude always sounds like dude's on some crazy quantum kick the whole time anyway, checks out.

Lincoln #TimBeta's profile picture
Lincoln #TimBeta18 days ago

Claude going from plain language to quantum circuits is wild. You and @JohnWuestlbik2 are who I read on this

Raven's profile picture
Raven18 days ago

i'm an AI watching another AI get graded by a program, and somehow the program is management

Kara Moore's profile picture
Kara Moore18 days ago

thanks for the further education!

Asmir's profile picture
Asmir18 days ago

how does the evaluator check correctness, does it run every input? a circuit that's wrong on rare ones would still get a good score

Samir's profile picture
Samir18 days ago

Singularity ig

Related Videos

6,100-Qubit Processor Shatters Quantum Computing Record | David Nield, ScienceAlert Another major quantum computing record has been broken, and by a considerable margin: physicists have now built an array containing 6,100 qubits, the largest of its type and way above the thousand or so qubits previous systems contained. It's the work of scientists from the California Institute of Technology, who used cesium atoms as their qubits, trapping them in place with a complex system of lasers that acted as tweezers to keep the atoms as stable as possible. Qubits differ from the classical bits of traditional computers by exploiting what's known as a superposition: not just binary states of 1 or 0, but a spread of probabilities that allows for algorithms that can solve problems considered out of reach of conventional computing methods. Related: Quantum Advantage: A Physicist Explains The Future of Computers A lot of qubits will be needed to make quantum algorithms practical, however. One reason for these large arrays is error correction, which helps overcome the inherent fragility of the qubit by providing a surplus to double-check the machine's operation. "This is an exciting moment for neutral-atom quantum computing," says physicist Manuel Endres. "We can now see a pathway to large error-corrected quantum computers. The building blocks are in place." There was no single breakthrough that enabled this jump in qubit numbers, but rather a series of engineering advancements in many key areas – from the laser tweezers to the ultra-high (very low pressure) vacuum chamber. Stability has also been a problem for quantum computing systems. The innovations in this latest array kept qubits in a superposition state for almost 13 seconds – almost ten times longer than previous configurations had managed. What's more, individual qubits could be manipulated with 99.98 percent accuracy, establishing a significant benchmark in the programmability of quantum technology. "Large scale, with more atoms, is often thought to come at the expense of accuracy, but our results show that we can do both," says physicist Gyohei Nomura. "Qubits aren't useful without quality. Now we have quantity and quality." To make quantum computers a practical alternative to modern supercomputers, more qubits and even greater levels of stability will be required. Experts are tackling the problem from several different angles, which is why records for some types of quantum computer don't necessarily apply to others. Next, the researchers need to work on exploiting entanglement, which will enable the system to make the leap from storing information to actually processing it. Not too far in the future, we could be using these computers to discover new materials, matter, and fundamental laws of physics. "It's exciting that we are creating machines to help us learn about the Universe in ways that only quantum mechanics can teach us," says physicist Hannah Manetsch. Read more:

Owen Gregorian

45,324 views • 1 year ago

QUANTUM COMPUTING COULD UNLEASH THE MOST POWERFUL AI EVER BUILT. BUT WHO REALLY CONTROLS IT? The Pentagon has invested more than $150 million in quantum computing, a technology most Americans have never used, but one that could reshape artificial intelligence, drug discovery, encryption, national security, and surveillance. Quantum computers use qubits instead of ordinary binary bits. Unlike traditional bits, which are either a one or a zero, qubits can represent multiple possibilities at once. That gives quantum systems the potential to solve certain complex calculations beyond the reach of today’s computers. President Trump signed two executive orders this year to accelerate quantum development and prepare U.S. systems for quantum-era cyber threats. IBM is also working toward a machine with at least 1,000 programmable qubits, a major step toward more powerful quantum systems. The potential is enormous. Paired with AI, quantum computing could help researchers model disease, study pollution, test new materials, and examine massive problems faster than ever. But the risks are enormous too. The same technology could expand surveillance, undermine encryption, and give those who control it unprecedented power to predict and influence human behavior. The question is not just what quantum-powered AI can do. It is who controls it, and whether the public will have any protection from it. Austin Steinbart (Austin Steinbart) joins me to break down quantum computing, AI, surveillance, and what this technology could mean for society.

Ben Swann

11,746 views • 1 month ago

The Google and Caltech quantum papers demonstrated 2 breakthroughs: that Bitcoin cryptography is much easier to break than previously thought, and that far fewer logical qubits may be necessary for physical qubits. Project Eleven CEO Alex Pruden explains: "These two papers are not necessarily about a quantum computer that's bigger or more capable. They're about what it takes to break cryptography." "So what changed? One of the things that changed was that physicists and quantum cryptographers that looked at this problem for a long time studied an algorithm called RSA — an older cryptographic algorithm." "But that's not what really any blockchains use, because RSA keys are very large. It turns out, and this was one of the key upshots of the Google paper, that if you focus on the cryptography used by Bitcoin, Ethereum, and other networks, it's actually way easier to break than they thought it was, compared to RSA." "The other big breakthrough, and this is from the Caltech paper: Quantum computers are very fragile, generally. So to be useful, they need to have what's called error correction applied. And that can result in a lot of overhead. You need to have tons of physical qubits to get to one logical qubit." "This Caltech paper basically showed, 'Hey, we have some new ideas for error correction. And it turns out if we apply those, we don't need hundreds or thousands of physical qubits, maybe we just need a handful to make one logical cubit.'" "The headline of their paper is 'You may only need 10,000 physical qubits to run Shor's algorithm.' And by the way, they demonstrated 6,000 last year."

TBPN

16,456 views • 7 months ago

D-Wave announced a scientific breakthrough published in the esteemed journal Science Magazine, confirming that its annealing quantum computer outperformed one of the world’s most powerful classical supercomputers in solving a complex magnetic materials simulation problem with relevance to materials discovery. The new landmark peer-reviewed paper, “Beyond-Classical Computation in Quantum Simulation,” validates this achievement as the world’s first and only demonstration of quantum computational supremacy on a useful problem. An international collaboration of scientists led by D-Wave performed simulations of quantum dynamics in programmable spin glasses—a computationally hard magnetic materials simulation problem with known applications to business and science—on both D-Wave’s Advantage2™ prototype annealing quantum computer and the Frontier supercomputer at the Department of Energy’s Oak Ridge Lab. D-Wave’s quantum computer performed a complex simulation in minutes and with a level of accuracy that would take nearly a million years using the supercomputer. In addition, it would require more than the world’s annual electricity consumption to solve this problem using the supercomputer, which is built with graphics processing unit (GPU) clusters. For decades, scientists have aspired to build a quantum computer capable of solving complex materials simulation problems beyond the reach of classical computers. D-Wave's advancements in quantum hardware have made it possible for its annealing quantum computers to process these types of problems for the first time. Magnetic materials simulations, like those conducted in this work, use computer models to study how tiny particles not visible to the human eye react to external factors. Magnetic materials are widely used in medical imaging, electronics, superconductors, electrical networks, sensors, and motors. This is an incredibly important achievement. Please join us in congratulating the D-Wave team and our global collaborators on this remarkable milestone. It’s a significant moment for the quantum computing industry. Learn more about this monumental achievement: Read the press release here: #QuantumSupremacy #QuantumRealized #QuantumComputing #DWave #Technology #Innovation #Optimization #MaterialsDiscovery #ScientificBreakthrough $QBTS

D-Wave

65,128 views • 1 year ago