Content deleted Content added
Jadzia2341 (talk | contribs) m →Quantum simulation: Adding reference to main article |
TheMathCat (talk | contribs) A reference updated (the paper is published) |
||
Line 9:
==Overview==
Quantum algorithms are usually described, in the commonly used circuit model of quantum computation, by a [[quantum circuit]] which acts on some input [[qubit]]s and terminates with a [[measurement]]. A quantum circuit consists of simple [[quantum gate]]s which act on at most a fixed number of qubits. The number of qubits has to be fixed because a changing number of qubits implies non-unitary evolution. Quantum algorithms may also be stated in other models of quantum computation, such as the [[Hamiltonian oracle model]].<ref name=Hamiltonian_NAND_Tree>{{cite
| last1 = Farhi | first1 =
| last2 = Goldstone |first2=
| last3 = Gutmann |first3=
| date =
| title = A Quantum Algorithm for the Hamiltonian NAND Tree
| journal=Theory of Computing
| eprint = quant-ph/0702144▼
| volume=4
| pages=169—190
| doi=10.4086/toc.2008.v004a008 | doi-access=free}}</ref>
Quantum algorithms can be categorized by the main techniques used by 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, for instance see 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>
| |||