This svg shows the suspected shape of the BQP of problem space, the range of problems easily solved by quantum computers.

Note that this is not proven; it has not been proved that P!=NP or P!=PSPACE, and if either of these are equal, the shape of BQP would be different.

Diagram based on information found in :

• Michael Nielsen and Isaac Chuang (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. ISBN 0-521-63503-9.