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 David Turturean of Physical Superintelligence reports a proof of the Aaronson-Ambainis conjecture, an open question dating to 2008. The result concerns how many times an algorithm reads its input, not total computing time, and does not rule out practical quantum speedups on structured problems.
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 gain exponential advantages on unstructured inputs. The result applies to the number of times an algorithm reads its input, rather than its total running time, and was formalized in Lean and checked by the proof assistant’s kernel.
The theorem addresses a specific setting: yes-or-no computations in the query model, which counts requests for information about an input instead of counting every computational operation. According to the paper, for a quantum algorithm using a given number of queries, there is a deterministic classical algorithm that can approximate its 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 requirement grows as a fixed power of the quantum query count, rather than requiring an exponential number of input reads. The conclusion concerns most inputs drawn uniformly at random; it does not say the two kinds of algorithms have the same performance on every input.
PSI said 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 paper says the main theorem and its formulation of the conjecture were formalized in Lean, and that Lean’s kernel checked the logical steps. The source also reports that researchers reviewed the work; it does not provide details of that review.
A Boundary for Random Inputs
The result gives researchers a more precise theoretical boundary for claims about quantum advantage. In the framework studied, it says that a quantum algorithm cannot obtain an exponential advantage in the number of input reads on most uniformly random inputs for this class of yes-or-no tasks. That makes structure in a problem a more important target for understanding where dramatic query savings may arise.
This is relevant to quantum algorithm research, but it is not a verdict on the commercial value of quantum computers. The theorem does not measure the full cost of processing data, building or operating a machine, or translating an algorithm into a useful application. It also does not establish that classical computers can efficiently reproduce every quantum computation. Its contribution is narrower: it constrains input access in a defined mathematical model.
Popular right now
Dyson Supersonic Nural Hair Dryer
Bose QuietComfort Wireless Noise Cancelling Headphones, Twilight Blue
Vitamix Ascent X3 Professional-Grade Blender, 48 oz, Shadow Black
As an affiliate, we earn on qualifying purchases.
From the 2008 Conjecture to Lean
The conjecture is named for Scott Aaronson and Andris Ambainis and is traced in the paper to a 2008 lecture by Aaronson. It links a question about quantum algorithms to a mathematical statement about polynomials. Earlier research connected a quantum algorithm’s probability of answering yes to a polynomial whose complexity is limited by the number of input queries. The reported proof builds on that line of work.
The query model strips away some details of real computation so researchers can compare how much information different algorithms need. A classical query reads an input bit at a selected position. A quantum query can act on a superposition of positions, but does not simply reveal all of their values; the algorithm uses quantum operations and interference to extract information. This model makes the conjecture tractable, while also setting a clear limit on what the answer establishes.
Quantum algorithms can exploit particular patterns. Shor’s factoring algorithm, introduced in 1994, uses a quantum method for finding periods in mathematical functions, a form of structure that can support a speedup. The conjecture asks what can be said when inputs lack such favorable organization. The new result addresses that question for most random inputs within the query framework, not every problem or computational model.
“The 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 an accompanying blog post
Limits of the Result
The result is confined to input-query complexity. It does not bound total computation time, memory use, energy consumption or the cost of running a quantum system. Whether a particular application has a useful quantum advantage remains a separate question.
The source material does not specify a journal publication, an independent formal verification beyond Lean’s kernel, or the details and scope of the reported researcher review. It also does not provide the theorem’s full constants or bounds here. The claim applies to most uniformly random inputs under stated accuracy and exception allowances; how the result bears on specific structured problems depends on their details.
Further Bounds and Peer Review
The immediate next steps are further scrutiny of the paper’s proof and examination of how its bounds relate to earlier results. The source says the theorem’s bounds may be strengthened through further work, but does not give a schedule for that research or identify a publication venue.
Researchers will also need to analyze particular algorithms and applications separately. The conjecture’s resolution sharpens one theoretical question, while the search for practical quantum speedups still depends on identifying problems with exploitable structure and comparing full computational costs. No application-level performance result is established by this proof.
Key Questions
What does the Aaronson-Ambainis conjecture concern?
It concerns whether quantum algorithms can achieve exponential advantages for yes-or-no tasks on unstructured inputs, expressed through a mathematical statement linked to polynomials. The reported proof establishes the conjecture in a query model.
Does this mean quantum computers have no speedups?
No. The theorem limits input reads for most uniformly random inputs in a specified framework. It does not rule out speedups on structured problems or set a general limit on total computing time.
What did Lean check?
The paper says its main theorem and formulation of the conjecture were formalized in Lean and checked by Lean’s kernel, which verifies the logical steps encoded in the formal proof.
Did an AI prove the theorem?
PSI says its research system used instances of a non-public Anthropic model and found the proof during a run. The paper reports formalization and Lean checking; the source does not describe the model’s exact role or provide an independent account of the discovery process.
Does the result show that quantum computing is commercially useful?
No. It is a theoretical result about query complexity, not a demonstration of a practical application, commercial benefit or overall performance advantage.
Source: thequantuminsider.com
