TL;DR
Get business pricing on monitors, keyboards and dev gear
- Business-only prices and quantity discounts
- Tax-exempt purchasing
- Multiple users, one account, clear invoices
A paper by David Turturean of Physical Superintelligence reports a proof of the Aaronson-Ambainis conjecture, an open question dating to 2008. In the query model, it shows that classical algorithms can approximate a quantum algorithm’s yes-or-no outcome probability on most uniformly random inputs with a polynomial, rather than exponential, increase in input reads. The result concerns query counts, not total computing time or the practical value of quantum computers.
A paper by David Turturean of Physical Superintelligence (PSI) reports a proof of the Aaronson-Ambainis conjecture, a question open since 2008 about whether quantum algorithms can achieve exponential advantages on most unstructured inputs. The result is formalized in the Lean proof assistant and, according to PSI, was discovered with help from an AI research system; it narrows claims about quantum speedups to a specific measure of how often an algorithm reads its input.
The theorem addresses yes-or-no computations in the query model, which counts requests for information about an input rather than the full time or resources required to solve a problem. According to the paper, for a quantum algorithm using a given number of input queries, a deterministic classical algorithm can approximate its probability of answering yes on all but a chosen small fraction of uniformly random inputs. For fixed accuracy and a fixed allowance for exceptional inputs, the classical query count grows as a fixed power of the quantum query count, rather than requiring an exponential number of reads.
PSI said its internally developed research system found a complete proof during the third day of a run, using instances of a non-public Anthropic model. The paper says the main theorem and its formulation of the conjecture were formalized in Lean and checked by the proof assistant’s kernel, which verifies the logical steps. PSI’s account describes how the proof was found; the paper’s formalization and checking provide a separate, machine-verifiable record of the mathematical argument.
The result does not show that classical computers can reproduce every quantum computation efficiently. It is about estimating an algorithm’s acceptance probability for most random inputs under a particular framework. The theorem limits the number of input reads required in that setting, but does not bound all computation time, memory use, or other costs. The available source material does not establish that the result has been independently reviewed in a journal.
A Limit on Random-Input Speedups
The proof gives researchers a sharper theoretical boundary for one prominent question in quantum computing: whether an exponential advantage can persist when a problem lacks a special pattern for a quantum algorithm to exploit. Under the theorem’s conditions, most uniformly random inputs do not support such an advantage in query complexity for the yes-or-no tasks covered.
That boundary can help direct quantum algorithm research toward problems with useful mathematical or physical structure. It also puts the result in perspective: quantum advantages remain possible, and the theorem does not identify which real-world applications will benefit. A lower query count is not itself a measure of total runtime, engineering feasibility, or commercial value.
Products Worth Considering
Logitech MX Keys S Combo Wireless Keyboard and Mouse, Graphite
Sonos Era 100 SL Compact Microphone-Free Speaker, Black
Bose SoundLink Plus Portable Bluetooth Speaker, Black
As an affiliate, we earn on qualifying purchases.
From a 2008 Conjecture to Lean
The conjecture is named for Scott Aaronson and Andris Ambainis and is traced in the paper to a 2008 lecture by Aaronson. It links the behavior of quantum algorithms to a mathematical statement about polynomials. Earlier work showed that a quantum algorithm’s probability of answering yes can be represented by a formula whose complexity is limited by the number of times the algorithm accesses its input. The new paper builds on that connection and a sequence of results in mathematics and theoretical computer science.
The query model makes a deliberately narrow comparison. A classical query reads a selected input bit; a quantum query can act on a superposition of positions, with the algorithm using interference to extract information. The model helps compare information access without counting every computational operation. It is not a full account of the resources needed to run either kind of computer.
Quantum algorithms such as Shor’s factoring algorithm, introduced in 1994, illustrate why structure matters. Shor’s method uses periodicity in a mathematical function to factor integers efficiently relative to known classical methods. The Aaronson-Ambainis question asks what can be said when inputs are instead drawn uniformly at random and do not offer comparable favorable structure.
“The research system found a complete proof during the third day of a run.”
— Physical Superintelligence, in its accompanying blog post
Limits of the Theorem and Review
The theorem’s scope is limited to the query model, yes-or-no outputs, and performance on most uniformly random inputs. It does not settle whether particular practical workloads will yield useful quantum speedups, nor does it establish limits on total runtime or other resource costs. The supplied material gives no numerical constants for the polynomial bound, so its practical strength cannot be assessed from that account alone.
PSI says an AI system helped find the proof, but the details of the system and the non-public Anthropic model are not disclosed. The source material says researchers reviewed the work and that Lean checked the formalized result; it does not name the reviewers or report journal publication or independent replication. Those details remain relevant to understanding the proof’s review status and the AI system’s contribution.
Further Bounds and Independent Review
The immediate next steps are closer examination of the paper’s argument, scrutiny of its formalization, and independent assessment of the result by researchers in quantum computing and theoretical computer science. The supplied report does not identify a journal decision, publication timetable, or planned replication, so none can be treated as confirmed.
Further work may seek to strengthen the mathematical bounds or extend the result beyond its present assumptions. For quantum algorithm research, the theorem provides a framework for asking which problems have structure that can support an advantage; it does not, on its own, select applications or predict when useful quantum machines will arrive.
Key Questions
What conjecture does the paper say it proves?
It reports a proof of the Aaronson-Ambainis conjecture, an open question dating to 2008 about quantum advantages on most inputs in a query-model setting.
Does the result show quantum computers have no speed advantage?
No. It concerns input-query counts for certain yes-or-no computations on most uniformly random inputs. It does not rule out quantum advantages on structured problems or settle total runtime.
What role did AI play?
PSI says its research system, using instances of a non-public Anthropic model, found the proof during the third day of a run. The paper reports that the theorem was formalized and checked in Lean. The available account does not give further technical detail about the AI system.
What does Lean verification establish?
The paper says Lean’s kernel checked the formalized logical steps. That is a machine-checkable verification of the formal proof as encoded; it does not by itself resolve questions about the theorem’s scope, practical implications, or the separate history of how the proof was discovered.
Has the proof been independently confirmed or published in a journal?
The source material says researchers reviewed the work and reports Lean verification, but it does not name the reviewers or confirm journal publication or independent replication.
Source: thequantuminsider.com
