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, open since 2008, about quantum algorithms for yes-or-no problems. The result says a classical algorithm can approximate a quantum algorithm’s answer probability on most uniformly random inputs with a query count that grows as a fixed power of the quantum count. It limits input reads in a particular 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 about whether quantum algorithms can achieve exponential advantages on unstructured inputs. The result applies within a query model: for yes-or-no problems, a classical algorithm can approximate a quantum algorithm’s probability of answering yes on most uniformly random inputs without using exponentially more input reads.
The paper, posted on GitHub, states that for a quantum algorithm using a given number of queries, there is a deterministic classical algorithm that approximates its acceptance probability on all but a chosen small fraction of inputs. The classical query count grows as a fixed power of the quantum query count when the accuracy and allowed exceptional fraction are fixed. This rules out an exponential gap in input reads for most inputs in that setting; it is not a claim that classical computers can reproduce every quantum computation efficiently.
PSI said in a blog post that an internally developed research system, using instances of a non-public Anthropic model, found a complete proof during the third day of a run. The paper says its main theorem and its formulation of the conjecture were formalized in Lean, a proof assistant, and checked by Lean’s kernel, which verifies logical steps. The company’s account describes the role of its system; the mathematical result is presented in the paper and was also reviewed by researchers, according to the source report.
The theorem counts queries, or requests for information about the input, rather than all computational operations. A classical query reads a selected bit; a quantum query can act on a superposition of input positions. The result therefore bounds how much input access is needed in this model. It does not establish a general bound on runtime, hardware costs, or the performance of quantum devices on real-world applications.
A Bound on Quantum Input Reads
The result gives researchers a sharper account of where to look for large quantum advantages. If a problem’s inputs behave like uniformly random, unstructured data, this theorem says a quantum algorithm’s yes-or-no probability can generally be approximated classically with only a polynomial increase in queries, under the stated conditions. That narrows the prospects for exponential advantages based solely on access to arbitrary input bits.
It does not show that quantum computers lack useful advantages. The theorem leaves open cases where a problem has exploitable mathematical or physical structure, as well as benefits measured by total runtime or other resources. The practical implications for any particular application remain unsettled: the result offers a theoretical guide for algorithm research, not a forecast of commercial performance.
Products Worth Considering
LG UltraGear 32GX850A-B 32-inch 4K UHD Glossy OLED Gaming Monitor
Kindle Paperwhite 16GB (2024) – 7 Glare-Free Display, Weeks Battery Life – Black
Bose SoundLink Flex Bluetooth Speaker (2nd Gen), Black
As an affiliate, we earn on qualifying purchases.
From a 2008 Question to Lean
The conjecture is named for Scott Aaronson and Andris Ambainis and traces back to a 2008 lecture by Aaronson, according to the paper’s account. It links a question about quantum computation to a mathematical statement involving polynomials. Earlier work established a connection between a quantum algorithm’s acceptance probability and a polynomial whose complexity is limited by the number of input queries. The new proof addresses the conjecture built on that line of research.
The question matters because prominent quantum algorithms can exploit structure. Shor’s factoring algorithm, introduced in 1994, uses a periodic pattern in a mathematical function to provide a route to factoring large numbers faster than any known classical method. The Aaronson-Ambainis conjecture asks whether similarly dramatic speedups can persist when the input lacks favorable structure. The reported theorem concerns that question in a specific query framework, rather than every possible measure of computational advantage.
“An internally developed research system, using instances of a non-public Anthropic model, 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 restricted to query complexity and the stated conditions on yes-or-no computations and most uniformly random inputs. It does not settle whether quantum computers can deliver large advantages on structured problems, nor does it compare total runtime, energy use, or hardware requirements. Those questions are outside the bound described in the source material.
The supplied report says the proof was reviewed by researchers, but it does not identify the reviewers or describe the scope of their review. The material also does not establish whether the paper has undergone peer review or journal publication. PSI’s description of the AI system’s role is attributed to the company; further independent information about the system, its contribution, and the proof’s reception is not provided.
Further Review and Stronger Bounds
The immediate next step is scrutiny of the paper’s argument and formalization by researchers working in quantum computing, complexity theory, and mathematics. Lean’s kernel checks the formal proof as encoded, while expert review can assess the formulation, assumptions, and relevance of the result. The source material does not give a publication schedule or identify a planned venue for peer review.
Further work may seek to strengthen the mathematical bounds or clarify how the theorem relates to other computational resources and problem classes. For now, the result gives a more precise limit on quantum advantages measured by input reads in one framework, while leaving the prospects for specific applications open.
Key Questions
What does the proof establish?
It establishes the Aaronson-Ambainis conjecture in the described query framework: for yes-or-no computations, a classical algorithm can approximate a quantum algorithm’s acceptance probability on most uniformly random inputs without exponentially more input reads.
Does this mean quantum computers have no major advantages?
No. The theorem concerns input queries in a particular model. It does not rule out advantages on problems with useful structure or settle comparisons based on total runtime and other resources.
What role did AI play in the proof?
PSI says its research system, using instances of a non-public Anthropic model, found a complete proof during the third day of a run. The paper reports that the main theorem was formalized in Lean and checked by Lean’s kernel. The source does not provide an independent assessment of the AI system’s contribution.
Has the proof been peer-reviewed?
The source report says researchers reviewed the work, but it does not identify them or state that the paper has completed formal peer review or been published in a journal.
Source: thequantuminsider.com
