Unreleased Anthropic model reportedly proves 18-year-old quantum conjecture

What's going on

A striking claim is making the rounds on Reddit. An unreleased Anthropic AI model reportedly found a proof of the Aaronson-Ambainis conjecture in just three days. This conjecture from theoretical computer science has been open for about 18 years. The claim comes from researchers at an organization called Physical Superintelligence. They say the proof sets a fundamental limit on how much faster quantum computers can be than conventional computers on certain problems.

The sources we have are very thin: two posts in the r/singularity subreddit that consist mostly of headlines. One is titled "A proof of the Aaronson-Ambainis conjecture." They don't say what the model is called or how the proof works. They also don't say whether mathematicians have checked it or what role humans played. Everything else in this article is background to put the claim in context.

What the Aaronson-Ambainis conjecture says

The conjecture is named after computer scientists Scott Aaronson and Andris Ambainis, who stated it in the late 2000s. It belongs to quantum complexity theory, the field that studies which tasks quantum computers can fundamentally solve faster than ordinary computers.

One basic question is where a quantum computer's advantage actually comes from. Well-known examples like Shor's algorithm for factoring large numbers exploit a special structure in the problem, such as a hidden periodicity, meaning a repeating pattern. The conjecture looks at the opposite case. If there's no such structure and the quantum algorithm has to work well on practically all possible inputs, it probably doesn't deliver a huge, exponential advantage. A classical computer could then simulate it on most inputs with reasonable extra effort.

Mathematically, the conjecture is a statement about certain polynomials, expressions built from variables that only take the values 0 and 1. It says that in every such bounded, low-degree polynomial, at least one variable must have a noticeable influence on the result. It would follow that quantum algorithms for unstructured problems can be simulated classically. That's probably what the researchers mean by a "fundamental limit on quantum speedups." This explanation is our own reading and doesn't appear in the sources.

Why the result would matter

If the claim holds up, it would be remarkable for two reasons:

• For science: The conjecture has long been considered one of the better-known open problems in its field, and many researchers have contributed partial results. A full proof would pin down more precisely where quantum computers fundamentally can't help.
• For AI development: In recent years, language models have increasingly helped with math competition problems and individual research questions. Independently finding a proof of a well-known, long-open conjecture in just three days would be a clear step beyond that.

What's still unclear

You should treat this with caution. Several points remain unresolved:

• No independent review: A mathematical proof only counts as settled once experts have checked it thoroughly. Famous problems keep attracting proofs that later turn out to be flawed. It's also unknown whether the proof was formally verified in a proof assistant, meaning checked step by step by software.
• No confirmation from Anthropic: The sources include no statement from the company and don't name the model.
• Unclear split between humans and AI: We don't know whether the model found the proof on its own or whether researchers guided it closely, supplied intermediate steps and fixed mistakes. It's also unclear what "three days" actually means.
• Little-known source: The posts give no information about Physical Superintelligence.

The bigger picture

The news fits a clear trend. AI labs increasingly want to position their models as tools for real research, not just as chat assistants. A proof of the Aaronson-Ambainis conjecture would be a strong example. The problem is precisely stated and well known among experts, and the proof can be checked. That's exactly why verification matters now. Until there's a peer-reviewed publication, a formal verification or confirmation from recognized experts, this remains an interesting but unproven claim. We'll be watching to see whether quantum complexity researchers weigh in.