Editing Quantum algorithm (section)

==Overview==
Quantum algorithms are usually described, in the commonly used circuit model of quantum computation, by a [[quantum circuit]] that acts on some input [[qubit]]s and terminates with a [[measurement]]. A quantum circuit consists of simple [[quantum gate]]s, each of which acts on some finite number of qubits. Quantum algorithms may also be stated in other models of quantum computation, such as the [[Hamiltonian oracle model]].<ref name=Hamiltonian_NAND_Tree>{{cite journal
 | last1 = Farhi | first1 = Edward
 | last2 = Goldstone |first2=Jeffrey
 | last3 = Gutmann |first3=Sam
 | date = 2008
 | title = A Quantum Algorithm for the Hamiltonian NAND Tree
 | journal=Theory of Computing
 | volume=4
 | pages=169–190
 | arxiv = quant-ph/0702144
 | doi=10.4086/toc.2008.v004a008 | doi-access=free}}</ref>

Quantum algorithms can be categorized by the main techniques involved in the algorithm. Some commonly used techniques/ideas in quantum algorithms include [[phase kick-back]], [[quantum phase estimation algorithm|phase estimation]], the [[quantum Fourier transform]], [[quantum walk]]s, [[amplitude amplification]] and [[topological quantum field theory]]. Quantum algorithms may also be grouped by the type of problem solved; see, e.g., the survey on quantum algorithms for algebraic problems.<ref>{{cite journal|last1=Childs|first1=Andrew M.|author-link=Andrew Childs|last2=van Dam|first2=W.|year=2010|title=Quantum algorithms for algebraic problems|journal=[[Reviews of Modern Physics]]|volume=82|issue=1|pages=1–52|arxiv=0812.0380|bibcode=2010RvMP...82....1C|doi=10.1103/RevModPhys.82.1|s2cid=119261679}}</ref>