위키백과 ― 우리 모두의 백과사전.
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
|
Date |
15 February 2007
|
Author |
User Mike1024
|
Permission |
|
Other versions |
None. |
그림 링크
다음 문서들이 이 그림을 사용하고 있습니다: