Quantum algorithm: Difference between revisions

Revision as of 04:18, 13 September 2011

Revision as of 04:19, 13 September 2011

Line 1:

In [[quantum computing]], a '''quantum algorithm''' is an [[algorithm]] which runs on a realistic model of [[quantum computation]], the most commonly used model being the [[quantum circuit]] model of computation.<ref>
{{cite book
| authorlast= [[Michael Nielsen]] and [[Isaac|first=M.
| last2=Chuang]] |first2=I.
| year=2000
| title=Quantum Computation and Quantum Information
| publisher=[[Cambridge University Press | ___location=Cambridge | year=2000 ]]
| isbn=0-521-63503-9 | oclc= 174527496
}}</ref><ref>
{{Citecite arxiv

| last = Mosca | first = M.

| firstdate = Michele2008

| title = Quantum Algorithms

| date = 2008-08-03

| eprint = 0808.0369

| 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, 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]].