Quantum algorithm: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
m Alter: template type, isbn. Add: issue, arxiv, doi, pages, volume, year, journal. Removed parameters. Some additions/deletions were actually parameter name changes. | You can use this bot yourself. Report bugs here. | Activated by User:AManWithNoPlan | All pages linked from User:AManWithNoPlan/sandbox2 | via #UCB_webform_linked
No edit summary
Line 8:
 
==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{{why|date=February. 2018}}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 arXiv
| last = Farhi | first = E.
| last2 = Goldstone |first2=J.