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 about quantum speedups on random inputs. PSI says an AI research system helped find the proof, which was formalized in Lean and checked by its kernel. The result bounds input queries in a specific model; it does not rule out quantum advantages in total computing time or practical applications.
A paper by David Turturean of Physical Superintelligence reports a proof of the Aaronson-Ambainis conjecture, a question open since 2008 about whether quantum computers can achieve exponential advantages on most random inputs without special structure. PSI says an AI-assisted research system helped find the proof; the paper says its main theorem was formalized in Lean and checked by the proof assistant’s kernel.
The theorem concerns query complexity: how many times an algorithm must access the input data, rather than how many total operations it takes or how long it runs. In the framework described by the paper, for a quantum algorithm using a given number of 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 an allowed fraction of exceptions, the classical query count grows as a fixed power of the quantum query count, rather than requiring an exponential number of input reads.
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 research team says the conjecture’s formulation and the main theorem were formalized in Lean. Lean’s kernel checks whether the formal proof follows from its stated logical steps; that verification is distinct from independently evaluating the theorem’s practical implications.
The paper places the result in a line of work connecting quantum algorithms to polynomial representations of their output probabilities. It presents the proof as resolving the conjecture within the stated framework. The available source material does not describe the result as a bound on all forms of quantum computation or as evidence that quantum computers lack useful advantages.
A Bound on Random-Input Queries
The result gives researchers a sharper theoretical guide to where dramatic quantum speedups may be found. If a problem’s inputs are typical random strings and the task is a yes-or-no computation in this query model, the theorem says the quantum algorithm’s acceptance probability can be approximated classically on most inputs without an exponential gap in the number of data accesses. That places pressure on claims of exponential query advantages that do not rely on special structure.
It does not settle which quantum applications will be commercially valuable. The theorem counts input reads, not the full computation needed to process data, and so does not establish a general limit on total runtime, memory use, or hardware requirements. Its importance is narrower: it strengthens the mathematical basis for focusing quantum algorithm research on problems with exploitable patterns, while leaving practical performance questions open.
Products Worth Considering
Apple MacBook Air 13.6-inch Laptop with M5 Chip, 16GB Memory, 512GB SSD, Midnight
Amazon Kindle Paperwhite (2024, 16 GB) – 7-inch Glare-Free Display, Black
Samsung Galaxy Tab S7 11-inch Android Tablet 128GB Wi‑Fi with S Pen Mystic Black
As an affiliate, we earn on qualifying purchases.
From the 2008 Conjecture to Lean
The conjecture takes its name from Scott Aaronson and Andris Ambainis and, according to the paper’s account, traces back to a 2008 lecture by Aaronson. It links a question about quantum query algorithms to a mathematical statement about polynomials. Previous work showed that a quantum algorithm’s probability of answering “yes” can be represented by a polynomial whose complexity is constrained by how often the algorithm accesses its input.
The query model makes comparisons precise by counting requests for input information. A classical query reads a bit at one position; a quantum query can act on a superposition of positions, but that does not mean it reveals all those bits at once. Quantum algorithms can use interference to extract information about patterns in the input. Shor’s factoring algorithm, introduced in 1994, illustrates the role of structure: it uses periodicity in a mathematical function. The conjecture asks what can happen when favorable structure is absent.
“The system found a complete proof during the third day of a run.”
— Physical Superintelligence, in its accompanying blog post
Limits of the Reported Result
The result is limited to the query model and the stated task of approximating a quantum algorithm’s acceptance probability on most uniformly random inputs. It does not show that classical machines can match quantum machines in total runtime across all problems, nor does it identify which real-world applications will benefit from quantum computing. The source material also does not provide a practical benchmark or an estimate of the computational cost of applying the classical approximation.
PSI attributes the proof’s discovery to an internally developed system using a non-public Anthropic model, but the supplied reporting does not detail the system’s design, the model’s contribution relative to human researchers, or the full review process. The paper’s Lean formalization offers a check of the encoded logical proof; the extent of independent review beyond that is not specified in the material provided.
Further Bounds and Independent Review
The paper’s publication and subsequent scrutiny will determine how other researchers assess the proof and its presentation. Further work may seek to strengthen the theorem’s mathematical bounds or clarify how its query-complexity result relates to other models of computation. Those questions matter because a limit on data accesses alone does not predict the full resources required by real algorithms.
For now, the reported milestone is a proof within a defined theoretical framework, alongside PSI’s account of AI assistance and Lean verification. No specific application result or practical quantum-computing milestone is established by the source material.
Key Questions
What question does the Aaronson-Ambainis conjecture address?
It asks whether a quantum algorithm can obtain an exponential advantage on most random inputs for yes-or-no computations without relying on special structure. The reported proof establishes a classical approximation result in a specific query model.
Does the proof show that quantum computers have no practical advantage?
No. It bounds the number of input queries in a particular framework, not total computing time or the value of quantum computers for specific applications.
What role did AI play, according to PSI?
PSI says 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 source material does not give a detailed account of how the AI and human researchers divided the work.
What does Lean verification establish?
The paper says the theorem and conjecture formulation were formalized in Lean and checked by Lean’s kernel, which verifies the logical steps encoded in the formal proof. This does not by itself establish practical consequences beyond the theorem’s stated assumptions.
Source: thequantuminsider.com
