Separating quantum and classical efficient computation

Establish whether the class of problems solvable efficiently by quantum algorithms with bounded error (BQP) is strictly different from the class of problems solvable efficiently by classical algorithms; for example, show the existence (or nonexistence) of a decision problem in BQP that is not efficiently solvable by any classical randomized algorithm.

Background

After introducing BQP, the author notes that it is not currently known whether quantum computers are computationally different from classical computers in terms of efficient solvability. This emphasizes a foundational uncertainty about the comparative power of quantum versus classical computation.

Resolving this separation would underpin claims of inherent quantum advantage beyond specific algorithms and provide a formal basis for the distinct capabilities of quantum processing units relative to classical architectures.