Content deleted Content added
m Bot: Deprecating Template:Cite doi and some minor fixes |
Big statement, nothing to back it up |
||
Line 14:
| class = quant-ph
| eprint = 0808.0369
}}</ref> A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical [[computer]]. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a [[quantum computer]]. Although all classical algorithms can also be performed on a quantum computer, {{Citation needed}} the term quantum algorithm is usually used for those algorithms which seem inherently quantum, or use some essential feature of quantum computation such as [[quantum superposition]] or [[quantum entanglement]].
All problems which can be solved on a quantum computer can be solved on a classical computer. In particular, problems which are [[Undecidable problem|undecidable]] using classical computers remain undecidable using quantum computers. What makes quantum algorithms interesting is that they might be able to solve some problems faster than classical algorithms.
| |||