그림:BQP complexity class diagram.svg

위키백과 ― 우리 모두의 백과사전.

No higher resolution available.

BQP_complexity_class_diagram.svg (518 × 414 pixel, file size: 7 KB, MIME type: image/svg+xml)

위키미디어 공용 로고 이 자료는 위키미디어 공용에 있습니다. 이 자료에 대한 설명이 아래에 있습니다.

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 :

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

Based on Image:Complexity classes.svg by user:Booyabazooka (Also public domain)

Source

Drawn by User:Mike1024

This vector image was created with Inkscape.
Date

15 February 2007

Author

User Mike1024

Permission
Public domain I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide.

In case this is not legally possible:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.


Afrikaans | Alemannisch | Aragonés | العربية | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Ελληνικά | English | Español | Esperanto | Euskara | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردي | Latina | Lietuvių | Magyar | Bahasa Melayu | Nederlands | Norsk (bokmål) | Norsk (nynorsk) | 日本語 | Polski | Português | Ripoarish | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски | Svenska | ไทย | Türkçe | Українська | Tiếng Việt | | 简体中文 | 繁體中文 | 粵語 | +/-

Other versions None.

다음 문서들이 이 그림을 사용하고 있습니다: