TL;DR
Prime made for students and young adults
- Fast, free delivery for dorm and study essentials
- Prime Video and Amazon Music included
- Member-only deals
A paper by David Turturean of Physical Superintelligence says it proves the Aaronson-Ambainis conjecture, an open question dating to 2008 about quantum advantages on random inputs. The result is formalized in Lean and limits the number of input queries needed in a specific computational model; it does not settle total computing time or which quantum applications will be useful.
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 computers can achieve exponential advantages on most randomly generated inputs without relying on special structure. The work, which PSI says was found with help from an AI research system and formalized in the Lean proof assistant, establishes a limit on input queries in a particular model—not on quantum computing’s total running time.
The result concerns query complexity: how many times an algorithm must access the input data, rather than how many total computational steps it takes. For yes-or-no problems, the paper says a classical algorithm can approximate a quantum algorithm’s probability of answering yes on all but a chosen small fraction of uniformly random inputs, using a number of queries that grows as a fixed power of the quantum algorithm’s query count when accuracy and the exceptional fraction are fixed.
PSI said in an accompanying blog post that its internally developed research system, using instances of a non-public Anthropic model, found a complete proof during the third day of a run. The paper says its main theorem and formulation of the conjecture were formalized in Lean and checked by Lean’s kernel, which verifies the logical steps. The source account also says researchers reviewed the work; the supplied material does not identify those reviewers or describe the review process in detail.
The theorem places a bound on how much an algorithm can gain from quantum access to data when most inputs are random. It does not say that classical computers can efficiently reproduce every quantum computation, nor does it rule out advantages for inputs with useful structure. The result is therefore a specific theoretical statement about information access, not a general verdict on the speed or commercial prospects of quantum machines.
A Bound on Random-Input Advantages
The proof gives researchers a more precise boundary for one prominent question in quantum computing: whether enormous quantum gains can arise even when a problem has no exploitable pattern. Under the paper’s query-model assumptions, the answer is constrained for most uniformly random inputs. That directs attention toward problems with mathematical or physical structure that quantum algorithms can use, while leaving open what advantages particular applications may deliver.
The distinction matters because a query bound counts input reads, not total computation. An algorithm might use few queries but still require substantial processing, and the theorem does not compare the full running times of classical and quantum machines. It strengthens a theoretical framework for evaluating potential speedups, but does not establish that any specific quantum application will be useful in practice.
Popular right now
Dreame L50 Ultra Robot Vacuum and Mop Combo
Bose QuietComfort Wireless Noise-Cancelling Headphones, Cypress Green
KitchenAid Artisan 5-Qt Tilt-Head Stand Mixer – Almond Cream (KSM150PS)
As an affiliate, we earn on qualifying purchases.
From the 2008 Conjecture to Lean
The conjecture is named for Scott Aaronson and Andris Ambainis, and the paper traces its origins to a 2008 lecture by Aaronson. The question connects quantum query algorithms to mathematical statements 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 input queries.
Quantum algorithms can exploit relationships among data rather than simply reading values one at a time. Shor’s factoring algorithm, introduced in 1994, is a well-known example: it uses quantum computation to find the period of a repeating mathematical function, a structure that supports a route to factoring large numbers faster than any known classical method. The conjecture asks how far such advantages extend when favorable structure is absent.
In the query model, a classical algorithm requests values at selected input positions. A quantum query can act on a superposition of positions, but does not reveal every value at once; the algorithm uses quantum interference to extract information. This model allows a focused comparison of information access, while leaving other costs outside the theorem.
“The research system found a complete proof during the third day of a run.”
— Physical Superintelligence, in its accompanying blog post
Limits the Theorem Does Not Resolve
The result does not establish a general limit on total computing time, because query complexity counts input accesses rather than every operation needed to compute an answer. It also does not determine whether any specific quantum application will produce a practical speedup, or how large such a speedup would be outside the model studied.
The supplied report does not provide details about the researchers who reviewed the paper, independent assessments of the proof, or the AI system’s specific contributions to the derivation. Lean’s kernel checking supports the formalized argument, but the available material does not describe the scope of the formalization or any remaining steps checked outside it.
Further Bounds and Independent Review
The immediate next step is for other researchers to examine the paper’s proof and its formalization, particularly the relation between the theorem’s assumptions and the broader conjecture. The source material does not give a schedule for peer review or identify a publication venue, so the timing and form of further evaluation are unclear.
Researchers may also seek stronger mathematical bounds and investigate what the query result implies for specific structured problems. Such work would address questions the theorem leaves open: how input access relates to full computation, and which applications can turn a theoretical quantum advantage into a useful one.
Key Questions
What is the Aaronson-Ambainis conjecture?
It is a conjecture, dating to 2008, about whether quantum algorithms can gain exponential advantages on most random inputs without relying on special structure. The paper by David Turturean reports a proof within a commonly used query-complexity framework.
What does the proof establish?
For yes-or-no computations, it says a classical algorithm can approximate a quantum algorithm’s probability of answering yes on all but a chosen small fraction of uniformly random inputs, with a query count that grows as a fixed power of the quantum query count when accuracy and the exception allowance are fixed.
Does this mean quantum computers have no speed advantage?
No. The result concerns input queries, not total running time, and does not rule out advantages on problems with useful structure. It also does not evaluate the practical performance of particular quantum applications.
How was AI involved?
PSI says an internally developed 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 main theorem was formalized in Lean and checked by its kernel. The supplied material does not detail the system’s precise contributions.
Has the proof been independently reviewed?
The source account says researchers reviewed the work, but does not name them or describe the review. The paper’s formalization was checked by Lean’s kernel; the supplied material does not state whether the paper has completed peer review or been published in a journal.
Source: thequantuminsider.com
