File:BQP complexity class diagram.svg

Uploaded by Andrei Stroe
Upload date 2024-05-09T12:56:52Z
MIME type image/svg+xml
Dimensions 518 × 414 px
File size 9.2 KB
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.
SVG development
InfoField
 The SVG code is valid.
 This diagram was created with Inkscape.
  This diagram uses embedded text that can be easily translated using a text editor.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

inception

15 February 2007

media type

image/svg+xml

height

414 pixel

width

518 pixel

data size

9,403 byte

checksum

2665739729b1c7b82339695cff5f70e2a5331c7b

determination method or standard: SHA-1
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