Content deleted Content added
→Quantum Simulation: templatified refs; added arXiv links |
|||
Line 44:
{{main|Deutsch–Jozsa algorithm}}
The Deutsch–Jozsa algorithm solves a [[black-box]] problem which provably requires exponentially many queries to the black box for any deterministic classical computer, but can be done with exactly 1 query by a quantum computer. If we allow both bounded-error quantum and classical algorithms, then there is no speedup since a classical probabilistic algorithm can solve the problem with a constant number of queries with small probability of error.
=== Simon's algorithm ===
| |||