TL;DR
Get the latest gadgets delivered free with Prime
- Fast, free delivery on millions of items
- Prime Video, Amazon Music and more included
- Member-only deals all year
A paper by David Turturean of Physical Superintelligence reports a proof of the Aaronson-Ambainis conjecture, an open question dating to 2008. The result shows that, for yes-or-no computations in a specific query model, classical algorithms can approximate a quantum algorithm’s answer probability on most uniformly random inputs with a polynomial number of queries. It limits input reads, not total computing time or the practical value of quantum computers.
A paper by David Turturean of Physical Superintelligence reports a proof of the Aaronson-Ambainis conjecture, an open problem dating to 2008 about when quantum algorithms can gain large advantages on randomly generated inputs. The result says that, for yes-or-no computations in a widely used query model, a classical algorithm can approximate a quantum algorithm’s probability of answering yes on most uniformly random inputs without an exponential increase in input queries.
The paper’s result concerns query complexity: how many times an algorithm must access the input, rather than how much total computing time it uses. The authors state that for a quantum algorithm making a given number of queries, a deterministic classical algorithm can approximate its acceptance probability—the chance it answers yes—on all but a chosen small fraction of inputs. With fixed accuracy and a fixed allowance for exceptional inputs, the classical query count grows as a fixed power of the quantum query count.
Physical Superintelligence, or PSI, said in an accompanying blog post that its internally developed research system found a complete proof during the third day of a run. The company said the system used instances of a non-public Anthropic model. The paper says its main theorem and its formulation of the original conjecture were formalized in Lean, a proof assistant, and checked by Lean’s kernel. That check verifies the formal logical steps; the report also says researchers reviewed the work.
The result does not say that classical computers can reproduce every quantum computation efficiently, nor does it set a general bound on the time needed to solve problems. It addresses the information each algorithm reads in a particular theoretical framework. The paper’s stated conclusion is limited to yes-or-no computations and most inputs drawn uniformly at random.
What the Query Bound Changes
The theorem gives researchers a sharper limit on where an exponential quantum advantage might arise. In the setting covered by the conjecture, a large advantage in the number of input reads cannot apply broadly to unstructured, uniformly random inputs for yes-or-no tasks: a classical algorithm can approximate the quantum algorithm’s answer probability on most such inputs with a polynomial query cost.
That points research toward problems with exploitable mathematical or physical structure, rather than suggesting that quantum computers have no useful advantages. The result strengthens a theoretical guide to algorithm design, but it does not identify which real-world applications will produce practical speedups. Because the theorem counts queries rather than total operations, its implications for runtime, hardware requirements and commercial value remain limited.
Products Worth Considering
Apple iPad Pro 12.9-inch (2017), 512GB Wi-Fi, Space Gray
Kindle Paperwhite Kids (2024), 16 GB, 7-inch Display, Cyber City Cover
Amazon Kindle Paperwhite (12th Generation, 2024), 16 GB, 7-inch Display, Black
As an affiliate, we earn on qualifying purchases.
From 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 connects a mathematical question about polynomials with a central issue in quantum computing: whether an algorithm can achieve an exponential advantage when its input lacks a favorable pattern. Earlier work linked the probability that a quantum algorithm answers yes to a mathematical formula whose complexity is constrained by the number of input queries.
Researchers study the question using the query model, which counts requests for information about an input rather than all computation. A classical query reads a selected bit; a quantum query can act on a superposition of positions, though it does not simply disclose every bit. The model lets researchers compare information access precisely, but leaves other costs outside the measure.
Some well-known quantum algorithms exploit structure. Peter Shor’s factoring algorithm, introduced in 1994, uses periodicity in a mathematical function to factor numbers more efficiently than any known classical method. The conjecture addresses whether comparably dramatic gains can persist when inputs are random and do not supply such a pattern.
“The system found a complete proof during the third day of a run.”
— Physical Superintelligence, in its accompanying blog post
Limits Beyond Input Queries
The result’s practical implications are not established by the query bound alone. It does not measure total runtime, memory use or implementation costs, and it does not determine whether a particular commercial or scientific application will benefit from quantum hardware. The precise size of the polynomial query overhead depends on the theorem’s parameters, including the permitted approximation error and fraction of exceptional inputs.
The available report says researchers reviewed the work, but does not identify those reviewers or describe an independent peer-reviewed publication. PSI’s account of the AI system’s role is also a company statement; the proof’s formal checking is a separate claim about verification in Lean. The material provided does not establish how much of the proof was generated by the system or how the researchers’ review was conducted.
Further Bounds and Peer Review
The paper’s next milestones are further mathematical scrutiny and publication or review beyond the account described in the report. Researchers may also seek stronger bounds, since the theorem establishes a polynomial relationship in query counts rather than a limit on all computational resources. Those developments could clarify how tight the result is and how broadly its assumptions apply.
For quantum algorithm research, the immediate direction is to examine problems with structure that may support a quantum advantage, while keeping query complexity distinct from end-to-end performance. Whether that theoretical distinction leads to useful speedups in specific applications remains an open question.
Key Questions
What is the Aaronson-Ambainis conjecture?
It is a conjecture dating to 2008 that relates quantum algorithms’ ability to gain large advantages on random inputs to a mathematical statement about polynomials. The reported paper says it proves the conjecture in the framework it studies.
What does the proof establish?
For yes-or-no computations in the query model, a deterministic 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 polynomial query cost under fixed accuracy and exception allowances.
Does this mean quantum computers have no speed advantage?
No. The theorem concerns input queries, not total computing time or every quantum task. It leaves room for advantages on problems with useful structure and does not settle the performance of specific applications.
How was the proof checked?
The paper says its main theorem and formulation were formalized in Lean and checked by Lean’s kernel, which verifies formal logical steps. The report also says researchers reviewed the work, but does not name the reviewers or detail that process.
Source: thequantuminsider.com
