Details
| Original language | English |
|---|---|
| Pages (from-to) | 1053-1203 |
| Number of pages | 151 |
| Journal | International Journal of Quantum Information |
| Volume | 7 |
| Issue number | 6 |
| Publication status | Published - Sept 2009 |
| Externally published | Yes |
Abstract
In this thesis, we describe the one-way quantum computer (QCC), a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the (QCC, describe the underlying computational model and demonstrate that the QCC, can be operated fault-tolerantly. In Sec. 2, we show that the QCC, can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model - the common model of quantum computation. We also indicate that the description of the QCC, as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the QCC, which is very different from the quantum logic network model. The QCC has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of QCC quantum algorithms. Further, all information that is processed with the QCC is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The QCC, is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the QCC. Further, we outline the concept of checksums in the context of the QCC, which may become an element in future practical and adequate methods for fault-tolerant QCCcomputation.
Keywords
- Cluster states, Measurement, Quantum computation
ASJC Scopus subject areas
- Physics and Astronomy(all)
- Physics and Astronomy (miscellaneous)
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: International Journal of Quantum Information, Vol. 7, No. 6, 09.2009, p. 1053-1203.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Measurement-based quantum computation with cluster states
AU - Raußendorf, Robert
PY - 2009/9
Y1 - 2009/9
N2 - In this thesis, we describe the one-way quantum computer (QCC), a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the (QCC, describe the underlying computational model and demonstrate that the QCC, can be operated fault-tolerantly. In Sec. 2, we show that the QCC, can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model - the common model of quantum computation. We also indicate that the description of the QCC, as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the QCC, which is very different from the quantum logic network model. The QCC has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of QCC quantum algorithms. Further, all information that is processed with the QCC is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The QCC, is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the QCC. Further, we outline the concept of checksums in the context of the QCC, which may become an element in future practical and adequate methods for fault-tolerant QCCcomputation.
AB - In this thesis, we describe the one-way quantum computer (QCC), a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the (QCC, describe the underlying computational model and demonstrate that the QCC, can be operated fault-tolerantly. In Sec. 2, we show that the QCC, can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model - the common model of quantum computation. We also indicate that the description of the QCC, as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the QCC, which is very different from the quantum logic network model. The QCC has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of QCC quantum algorithms. Further, all information that is processed with the QCC is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The QCC, is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the QCC. Further, we outline the concept of checksums in the context of the QCC, which may become an element in future practical and adequate methods for fault-tolerant QCCcomputation.
KW - Cluster states
KW - Measurement
KW - Quantum computation
UR - http://www.scopus.com/inward/record.url?scp=70349483757&partnerID=8YFLogxK
U2 - 10.48550/arXiv.quant-ph/0301052
DO - 10.48550/arXiv.quant-ph/0301052
M3 - Article
AN - SCOPUS:70349483757
VL - 7
SP - 1053
EP - 1203
JO - International Journal of Quantum Information
JF - International Journal of Quantum Information
SN - 0219-7499
IS - 6
ER -