The need for structure in quantum speedups
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms operate. First, we show that for any problem that is invaria...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Electronic Colloquium on Computational Complexity,
2012-08-08T21:01:16Z.
|
| Subjects: | |
| Online Access: | Get fulltext |