| Authors |
|
| Publication date |
2005
|
| Journal |
Bulletin of the European Association for Theoretical Computer Science
|
| Volume | Issue number |
87
|
| Pages (from-to) |
78-103
|
| Number of pages |
26
|
| Organisations |
-
Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
|
| Abstract |
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers cannot do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods.
|
| Document type |
Article
|
| Note |
quant-ph/0509153
|
| Published at |
http://www.eatcs.org/images/bulletin/beatcs87.pdf
|
|
Permalink to this page
|