File:BQP complexity class diagram.svg

Description

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.
Based on File:Complexity classes.svg by Booyabazooka (Also public domain)
Date
Source Own work based on: Complexity classes.svg by Booyabazooka
Author Mike1024
Permission
(Reusing this file)
Public domain I, the copyright holder of this work, release this work into the public domain. This applies worldwide.
In some countries this may not be legally possible; if so:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
Category:Self-published work#BQP%20complexity%20class%20diagram.svgCategory:PD-self#BQP%20complexity%20class%20diagram.svg
SVG development
InfoField
 
The SVG code is valid.
 
This diagram was created with Inkscape.
Category:Valid SVG created with Inkscape:Diagrams#BQP%20complexity%20class%20diagram.svg
 
 Category:Translation possible - SVGThis diagram uses embedded text that can be easily translated using a text editor.
Category:Computational complexity theory Category:Computer science Venn diagrams
Category:Computational complexity theory Category:Computer science Venn diagrams Category:PD-self Category:Self-published work Category:Translation possible - SVG Category:Valid SVG created with Inkscape:Diagrams