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 since 2008 about quantum algorithms on random inputs. The result limits the gap in input reads for yes-or-no tasks under a specific query model; it does not limit total computing time or establish 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 quantum computers’ advantages on randomly generated inputs. The result says that, for yes-or-no problems in a defined query model, a classical algorithm can approximate a quantum algorithm’s answer probability on most inputs without using exponentially more input reads.
The paper says its main theorem and formulation of the conjecture were formalized in Lean, a proof assistant, and checked by Lean’s kernel, which verifies the logical steps encoded in a proof. PSI also said its internally developed research system found the proof during the third day of a run, using instances of a non-public Anthropic model. That account describes how PSI says the proof was found; it does not make the AI system itself an independent verifier.
The theorem concerns the query model, which counts requests for information about an input rather than every calculation a computer performs. For a quantum algorithm making a given number of queries, the paper establishes a deterministic classical algorithm that approximates its probability of answering “yes” on all but a chosen small fraction of inputs. With fixed accuracy and a fixed allowance for exceptions, the required classical query count grows as a fixed power of the quantum query count.
That bound does not say classical computers can reproduce every quantum computation efficiently, and it does not establish a general limit on total runtime. It addresses how many times an algorithm accesses its input under specified conditions. The result’s practical implications for particular devices, applications or commercial value are not established by the theorem.
What the Query Bound Establishes
The proof gives researchers a firmer mathematical boundary for claims about exponential quantum advantages. In the setting studied, an algorithm cannot obtain such an advantage in input reads for a yes-or-no task on most uniformly random inputs without the problem having exploitable structure, as described by the conjecture’s result. This helps clarify what kinds of problems may be promising targets for quantum algorithms.
That is relevant because well-known quantum algorithms exploit patterns. Shor’s factoring algorithm, introduced in 1994, uses periodicity in a mathematical function. The new result bears on the contrasting case: whether a quantum computer can gain an exponential advantage when inputs lack a helpful pattern. It does not rule out quantum advantages on structured problems, nor does it identify which such problems will yield practical gains.
Products Worth Considering
Sony WH-1000XM4 Wireless Noise Cancelling Headphones, Black
Samsung Galaxy Tab A11 8.7-Inch Wi-Fi Tablet, 64GB, 4GB RAM, Silver
Sony WH-1000XM5 Premium Noise Cancelling Wireless Headphones, Midnight Blue
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 traces to a 2008 lecture by Aaronson, according to the paper’s account. It links quantum query complexity to a mathematical statement about polynomials. Earlier work established a connection between the probability that a quantum algorithm answers “yes” and formulas whose complexity is constrained by the algorithm’s number of input queries.
In the query model, a classical algorithm reads a selected input bit, while a quantum query can act on a superposition of positions. That does not expose every input value at once; quantum algorithms use the resulting effects and interference to extract information. The model provides a precise comparison of information access, but it is narrower than a measure of overall computation, which may include substantial work beyond reading the input.
“The system found a complete proof during the third day of a run.”
— Physical Superintelligence, in its accompanying blog post
Limits Beyond Input Reads
The result does not settle whether specific quantum computers will outperform classical systems on practical workloads. It bounds input queries, not total computing time, and the supplied material does not specify a real-world application or measured performance gain. The theorem’s stated guarantee also depends on fixed accuracy and on allowing a chosen small fraction of inputs to be exceptions.
PSI attributes the proof’s discovery to an internal system using a non-public Anthropic model. The material does not identify that model, provide an independent assessment of the AI system’s contribution, or describe external peer review. Lean checking verifies the encoded proof’s logical steps, while the paper’s claims and broader significance remain subject to scrutiny by researchers.
Further Bounds and Research Review
The paper provides a formal result for the conjecture, but the source material does not give a schedule for journal publication, independent replication or further review. Researchers can examine the paper and its Lean formalization, and assess how the theorem’s assumptions and bounds apply to related problems.
PSI’s report says the theorem leaves room for further work to strengthen its mathematical bounds. The next practical question is whether research can connect those bounds to particular structured problems and real quantum workloads. No such application or performance milestone is established in the material currently available.
Key Questions
What does the Aaronson-Ambainis conjecture concern?
It concerns whether quantum algorithms can obtain exponential advantages in input queries for yes-or-no problems on most random inputs, or whether such advantages require structure in the problem.
What did the reported proof establish?
For the stated query model, it establishes that a deterministic classical algorithm can approximate a quantum algorithm’s probability of answering “yes” on all but a chosen small fraction of inputs, with the classical query count growing as a fixed power of the quantum count under fixed accuracy and exception allowances.
Does this show quantum computers have no practical advantage?
No. The result limits input reads in a particular framework. It does not bound total computing time or rule out advantages for structured problems, and it does not determine which applications will be useful.
How was the proof checked?
The paper says its main theorem and formulation of the conjecture were formalized in Lean and checked by the proof assistant’s kernel. PSI separately attributes finding the proof to an internal research system using instances of a non-public Anthropic model.
Source: thequantuminsider.com
