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 Physical Superintelligence researcher David Turturean proves the Aaronson-Ambainis conjecture, an open question dating to 2008 about quantum advantages for Boolean problems. The result bounds the number of input queries needed to approximate a quantum algorithm’s yes-or-no probability on most uniformly random inputs; it does not bound total computing time or settle 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 when quantum algorithms can gain major advantages over classical ones. The result shows that, for yes-or-no computations, a classical algorithm can approximate a quantum algorithm’s acceptance probability on most uniformly random inputs without an exponential increase in input reads.
The theorem is about query complexity: how many times an algorithm accesses the input, not how long it takes to complete every calculation. In the paper’s formulation, 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 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 internally developed research system found the proof during the third day of a run, using instances of a non-public Anthropic model. The paper reports that the main theorem and its formulation of the conjecture were formalized in Lean, a proof assistant, and checked by Lean’s kernel. PSI’s account describes how the proof was found; the mathematical result itself is presented in the paper, and the source report says researchers also reviewed it.
The finding does not say that classical computers can reproduce every quantum computation efficiently. It establishes a bound within a particular framework and for a particular task: approximating a yes-or-no algorithm’s probability over most random inputs. The distinction between that measure and total running time is central to interpreting the result.
A Bound on Random-Input Advantages
The proof establishes a mathematical bound on one form of quantum speedup. Under the conjecture’s framework, an exponential advantage in the number of input reads cannot be assumed for Boolean problems on most uniformly random inputs. The result applies to query complexity, rather than the full computational costs of solving a problem.
The result does not identify which real-world tasks will benefit from quantum machines. Nor does it show that quantum computers lack practical advantages: input-query counts leave out other computational costs, and applications may have structure that the random-input setting does not capture. Its scope is theoretical and specific to the model described in the paper.
Products Worth Considering
Apple MacBook Air 13-inch Laptop with M5 Chip, 16GB Memory, 512GB SSD, 12MP Center Stage Camera, Touch ID, Wi-Fi 7, Midnight
Apple AirPods Pro 3 Wireless Earbuds with Active Noise Cancellation
Samsung Galaxy Tab A11 Wi-Fi Tablet, 8.7-Inch, 64GB, 4GB RAM, Gray (SM-X133, International Version)
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 a question about quantum algorithms to the mathematical behavior of 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 polynomial whose complexity depends on the number of input queries.
In the query model, a classical algorithm requests information about selected input positions. A quantum query can act on a superposition of positions, but that does not mean it simply reads every value at once. Researchers use the model to compare how much information different algorithms need, while setting aside the cost of all other operations.
Some well-known quantum algorithms exploit special patterns. Shor’s factoring algorithm, introduced in 1994, uses periodic structure to find factors through a period-finding method. The conjecture addressed a related but distinct question: whether enormous quantum advantages could also arise for yes-or-no computations when most inputs are random and do not offer a special pattern.
“The research system found a complete proof during the third day of a run.”
— Physical Superintelligence, in its accompanying blog post
The Limits of the Result
The result’s scope is limited to input queries and approximation of acceptance probabilities on most uniformly random inputs. It does not establish a general limit on total computation time, cover every computational task, or determine whether quantum computers will deliver commercially useful speedups. The available report also does not specify a practical application that the theorem newly rules in or out.
PSI attributes the discovery to a research system using a non-public Anthropic model, but the supplied material does not provide an independent account of the model’s role or a detailed breakdown of how researchers developed and checked the proof. The Lean check supports the formalized theorem; it does not by itself resolve broader questions about the result’s practical implications.
Research Beyond Query Complexity
Further work may examine the paper’s proof and its relation to earlier results in quantum algorithms and mathematics. Researchers may also investigate whether the bounds can be strengthened or how the theorem applies to specific problem settings.
For applications, researchers would need to identify problems with structure that quantum algorithms can exploit and analyze their full computational costs. The proof addresses a theoretical question; it does not establish a particular real-world speedup or commercial outcome.
Key Questions
What question does the proof resolve?
It proves the Aaronson-Ambainis conjecture, which concerns whether quantum algorithms can have exponential advantages for Boolean, yes-or-no computations on most uniformly random inputs in the query model.
Does this show classical computers are as fast as quantum computers?
No. The theorem concerns the number of input queries needed to approximate a quantum algorithm’s acceptance probability on most random inputs. It does not compare total running times for all computations.
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, the component that verifies the formal logical steps.
What role did AI play?
PSI said an internally developed research system, using instances of a non-public Anthropic model, found the proof during the third day of a run. The supplied report does not give an independent assessment of the model’s contribution.
Does the finding rule out practical quantum advantages?
No. It leaves room for advantages on structured problems and does not measure all computational costs. The theorem also does not identify which applications, if any, will produce useful speedups.
Source: thequantuminsider.com
