factual

Quantum Computers Give At Most Exponential Speedup

Because P is contained in BQP which is contained in PSPACE, quantum computers can give at most an exponential running-time advantage over classical ones and cannot solve anything uncomputable like the halting problem; moreover, proving P is not equal to BQP would require proving P is not equal to PSPACE, explaining why a real-world quantum advantage cannot yet be proven.

factualpending

Speaker

Scott Aaronson

Evidence Quote

“BQP is contained in PSPACE, which means anything that you can do in polynomial time with a quantum computer, you can also do in polynomial space with a classical computer”

Source

99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity— Sean Carroll's Mindscape
Created: 6/13/2026, 12:26:25 AM

Your notes

Loading notes...