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 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 input queries in a defined model, 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 randomly generated inputs. The result concerns how many times an algorithm reads its input, not its total running time, and the paper says its main theorem was formalized and checked using the Lean proof assistant.
The conjecture links a mathematical question about polynomial representations to a central issue in quantum computing: whether a quantum algorithm can retain a dramatic advantage when its input lacks exploitable structure. The reported result says that, for a yes-or-no computation, a classical algorithm can approximate a quantum algorithm’s probability of answering yes on most uniformly random inputs without requiring exponentially more input queries.
The comparison is made in the query model, which counts requests for information about an input rather than every computation performed. The paper states that for a quantum algorithm using a given number of queries, a deterministic classical algorithm can approximate its acceptance probability on all but a chosen small fraction of inputs. With fixed accuracy and a fixed allowance for exceptions, the classical query count grows as a fixed power of the quantum query count.
PSI said its 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 theorem and its formulation of the conjecture were formalized in Lean and checked by the system’s kernel, which verifies logical steps. These are descriptions from PSI and the paper; the supplied report does not identify an independent publication venue or provide a separate external assessment of the proof.
A Bound on Random-Input Advantages
The result sharpens a theoretical boundary between quantum and classical algorithms. If the proof withstands scrutiny, it supports the view that exponential quantum advantages in this setting are not available across most random inputs without some structure in the problem. That gives researchers a more specific reason to look for patterns or mathematical features that quantum algorithms can exploit.
The finding does not show that quantum computers lack useful advantages. It addresses input reads only: a classical algorithm may need a manageable number of queries relative to the quantum algorithm, while still doing substantial work to process information. The theorem does not settle total runtime, implementation costs, error rates on real hardware, or whether a particular commercial application will benefit from quantum computing.
For readers following the field, the distinction matters because a formal limit on one complexity measure is not a verdict on the technology as a whole. The theorem informs the search for algorithms; it does not identify which tasks will deliver practical speedups.
Products Worth Considering
Apple AirPods Pro 3 Wireless Earbuds with Active Noise Cancellation
LG UltraGear 27-inch QHD OLED Gaming Monitor, 240Hz
Sony WH-1000XM4 Wireless Noise-Canceling Headphones, Silver
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 grew out of work connecting quantum query algorithms with statements about polynomials, alongside results in mathematics and theoretical computer science.
In this framework, a classical query reads a selected bit of an input. A quantum query can act on a superposition of positions, but it does not simply reveal all those bits at once. Quantum algorithms use interference among possible interactions to extract information. Counting queries gives researchers a precise way to compare access to data, while deliberately leaving other computational costs aside.
Quantum algorithms can exploit structure in some problems. Shor’s factoring algorithm, introduced in 1994, uses the period of a mathematical function as part of its approach. The conjecture addressed a different case: whether a quantum algorithm could still achieve an exponential query advantage for a yes-or-no task on uniformly random inputs, where a useful pattern may be absent.
“The system found the proof during the third day of a run.”
— Physical Superintelligence, in an accompanying blog post
Scope and Review Still Matter
The result’s scope is the query model. It does not give a general bound on total computing time, nor does it prove that classical machines can efficiently reproduce every quantum computation. The supplied source also does not report the exact constants or practical query costs needed to apply the theorem to particular algorithms.
PSI says the proof was checked in Lean and reviewed by researchers, but the available account does not name those reviewers or describe the extent of their review. It also does not establish whether the paper has been peer reviewed or published in a journal. The proof’s formalization is a significant verification step, while broader mathematical scrutiny and the theorem’s precise practical implications remain matters for the research community.
Further Scrutiny and Stronger Bounds
The immediate next step is for other researchers to examine the paper’s argument, its formalized statements and the relationship between the theorem and the original conjecture. The supplied report gives no date for a journal decision, conference presentation or further review, so the timing of those steps is not yet clear.
Further work may seek to strengthen the theorem’s mathematical bounds or clarify how its query guarantees apply to specific problems. Researchers will also need separate analysis to establish what the result means for total runtime and real-world applications. For now, the reported proof narrows one theoretical question while leaving the broader search for useful quantum speedups open.
Key Questions
What does the proof establish?
It establishes the Aaronson-Ambainis conjecture in the query-complexity setting described by the paper: for a quantum algorithm answering a yes-or-no question, a classical algorithm can approximate its acceptance probability on most uniformly random inputs without an exponential increase in input queries.
Does this mean quantum computers have no practical advantage?
No. The theorem concerns input queries, not total computing time or the value of any particular application. It does not rule out quantum advantages on structured problems or 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 Lean’s kernel. PSI also says researchers reviewed the work, though the supplied account does not identify them or detail that review.
What role did AI play?
PSI said its research system found the proof during the third day of a run and used instances of a non-public Anthropic model. That account comes from PSI; the result’s mathematical validity rests on the proof and its verification, not on the system’s reported discovery process.
What remains unresolved?
The theorem does not settle total runtime or practical performance, and the supplied report does not establish whether the paper has undergone independent peer review. Further scrutiny and work on stronger bounds are still expected.
Source: thequantuminsider.com
