Abstract
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation, and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.
- Received 18 February 2003
DOI:https://doi.org/10.1103/PhysRevA.68.022312
©2003 American Physical Society
Collections
This article appears in the following collection:
Physical Review A 50th Anniversary Milestones
The collection contains papers that have made important contributions to atomic, molecular, and optical physics and quantum information by announcing significant discoveries or by initiating new areas of research.