Quantum algorithm: Difference between revisions

Revision as of 10:12, 12 December 2015

Revision as of 16:35, 13 December 2015

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,<ref>{{Cite book|title = Quantum Computer Science|url = https://books.google.com/books?id=-wkJIuw0YRsC&pg=PA23&lpg=PA23&dq=quantum%2520computer%2520equivalent%2520classical%2520computer&source=bl&ots=a4GtRJVB3c&sig=TwUadwnVELCCwY6EXkKne-2GZVw&hl=en&sa=X&ved=0ahUKEwi54efO39PJAhUG7WMKHSg6BkIQ6AEIRDAH#v=onepage&q=quantum%2520computer%2520equivalent%2520classical%2520computer&f=false|publisher = Morgan & Claypool Publishers|date = 2009-01-01|isbn = 9781598297324|language = en|first = Marco|last = Lanzagorta|first2 = Jeffrey K.|last2 = Uhlmann}}</ref>, 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]].

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.