Image:BQP complexity class diagram.svg
From Wikipedia, the free encyclopedia
BQP_complexity_class_diagram.svg (SVG file, nominally 518 × 414 pixels, file size: 7 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
| Description |
This svg shows the suspected shape of the 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 :
Based on Image:Complexity classes.svg by user:Booyabazooka (Also public domain) |
||
|---|---|---|---|
| Source |
Drawn by User:Mike1024
|
||
| Date |
15 February 2007 |
||
| Author |
User Mike1024 |
||
| Permission (Reusing this image) |
|
||
| Other versions | None. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment | |
|---|---|---|---|---|
| current | 08:31, 15 February 2007 | 518×414 (7 KB) | Mike1024 | ({{Information| |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 o) |
