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 says that, in a defined query model, classical algorithms can approximate a quantum algorithm’s yes-or-no output probability on most random inputs with a polynomial increase in input reads. The proof was formalized in Lean and checked by its kernel; it does not settle total computing time or the practical value of quantum computers.
Researchers at Physical Superintelligence (PSI) report a proof of the Aaronson-Ambainis conjecture, a question open since 2008 about when quantum algorithms can achieve large advantages over classical ones. The result concerns yes-or-no computations on most uniformly random inputs: in a specified model, a classical algorithm can approximate a quantum algorithm’s probability of answering yes without an exponential increase in input reads.
The result is presented in a paper posted by David Turturean of PSI. It addresses the conjecture through the query model, which counts how often an algorithm accesses information in its input rather than counting every operation or measuring total runtime. A classical query reads a selected input bit; a quantum query can act on a superposition of positions, with the algorithm’s final output shaped by interference.
For a quantum algorithm using a given number of queries, the paper says there is a deterministic classical algorithm that approximates its acceptance probability—the probability of answering yes—on all but a chosen small fraction of inputs. For fixed accuracy and a fixed allowance for exceptional inputs, the classical query count grows as a fixed power of the quantum query count. The report does not give a universal bound that applies to every computational task or input.
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. According to the paper and company account, the main theorem and formulation of the conjecture were formalized in Lean and checked by Lean’s kernel, software that verifies logical steps. Researchers also reviewed the work, the report says. These details describe the authors’ account of how the proof was developed and checked; they do not establish that an AI system independently validated the result.
A Limit on Random-Input Speedups
The theorem sharpens a theoretical boundary between quantum and classical computing. It supports the view that dramatic quantum advantages in this framework require structure in the problem or input, rather than arising broadly for yes-or-no questions on random data. For researchers, that gives a more definite mathematical result to use when studying which problems may benefit from quantum methods.
The finding does not show that quantum computers lack useful advantages. It bounds input reads, not total computing time: it does not account for all processing costs, implementation constraints or the resources needed to produce an answer. Nor does it determine whether any particular application will yield a commercially useful speedup. Its importance is narrower: it clarifies a longstanding theoretical question and points algorithm research toward exploitable mathematical or physical structure.
Products Worth Considering
Kindle Paperwhite Signature Edition 32GB (2024) – Auto-adjusting front light, wireless charging, weeks of battery life – Metallic Black
Bose QuietComfort Wireless Noise Cancelling Headphones, Black
Kindle Paperwhite 16GB (2024) – 7 Glare-Free Display, Weeks Battery Life – Black
As an affiliate, we earn on qualifying purchases.
From a 2008 Question to Lean
The conjecture takes its name from Scott Aaronson and Andris Ambainis and links quantum query complexity to a statement about polynomials. The paper traces the question to a 2008 lecture by Aaronson and builds on earlier work connecting the probability that a quantum algorithm answers yes to a mathematical formula whose complexity is limited by the number of input queries.
That framework matters because quantum algorithms can exploit patterns that are difficult for classical methods to use. Shor’s factoring algorithm, introduced in 1994, uses quantum computation to find the period of a repeating mathematical function; that period provides structure relevant to factoring. The conjecture asks how much advantage remains when favorable structure is absent. The new result addresses that question for most random inputs, within the query model, rather than settling all comparisons between quantum and classical computers.
“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’s scope is constrained by the query model. It does not give a general limit on total runtime, cover every computational task, or establish that classical computers can efficiently reproduce all quantum computations. The stated conclusion is about approximating a quantum algorithm’s yes-or-no probability on most uniformly random inputs, with specified accuracy and an allowed fraction of exceptions.
The available report does not provide enough detail to independently assess the theorem’s exact constants, the full proof or the researchers’ review process. PSI’s account says the work was checked in Lean and reviewed by researchers, but further scrutiny of the paper and its formalization will clarify how the result is evaluated by the broader research community. The practical consequences for specific quantum applications also remain open.
Further Review and Stronger Bounds
The paper’s proof and Lean formalization are available for examination, according to the report. The next steps are for other researchers to scrutinize the argument, test how its assumptions and bounds apply to particular problems, and build on the result. The source says the theorem leaves room for work to strengthen its mathematical bounds.
For quantum algorithm research, the result makes the search for exploitable structure more central, but it does not identify which applications will benefit. Further theoretical work and analysis of specific algorithms will be needed before the theorem can inform claims about real-world performance.
Key Questions
What does the Aaronson-Ambainis conjecture concern?
It asks whether quantum algorithms can achieve exponential advantages in input queries for yes-or-no problems on random inputs, or whether such advantages require structure. The reported proof establishes a limit in a specified query framework.
Does the proof show that quantum computers are no faster than classical computers?
No. It concerns input reads and approximation of a quantum algorithm’s yes-or-no probability on most random inputs. It does not bound total runtime or rule out useful quantum advantages on structured problems.
What role did AI play in the proof?
PSI says its research system used instances of a non-public Anthropic model and found a complete proof during the third day of a run. The paper’s main theorem was formalized in Lean and checked by its kernel; the source also says researchers reviewed the work.
What is Lean’s role in the result?
Lean is a proof assistant. The report says the theorem and conjecture formulation were formalized in Lean and checked by its kernel, which verifies logical steps. This is distinct from the claim about the AI-assisted discovery process.
Does the result identify practical uses for quantum computers?
No. It clarifies a theoretical boundary and may guide research toward problems with exploitable structure, but it does not establish which applications will deliver useful speedups.
Source: thequantuminsider.com
