Raussendorf, R;
Browne, DE;
Briegel, HJ;
(2003)
Measurement-based quantum computation on cluster states.
PHYS REV A
, 68
(2)
, Article 022312. 10.1103/PhysRevA.68.022312.
![[thumbnail of 9338_real.pdf]](https://discovery-pp.ucl.ac.uk/style/images/fileicons/application_pdf.png) Preview |
PDF
9338_real.pdf Download (769kB) |
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.
| Type: | Article |
|---|---|
| Title: | Measurement-based quantum computation on cluster states |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1103/PhysRevA.68.022312 |
| Keywords: | ENTANGLEMENT, COMPUTER, ARRAYS |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Physics and Astronomy |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/9338 |
Archive Staff Only
 |
View Item |
