Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 32 |
| Seitenumfang | 1 |
| Fachzeitschrift | Physical Review A - Atomic, Molecular, and Optical Physics |
| Jahrgang | 68 |
| Ausgabenummer | 2 |
| Publikationsstatus | Veröffentlicht - 25 Aug. 2003 |
| Extern publiziert | Ja |
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.
ASJC Scopus Sachgebiete
- Physik und Astronomie (insg.)
- Atom- und Molekularphysik sowie Optik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Physical Review A - Atomic, Molecular, and Optical Physics, Jahrgang 68, Nr. 2, 25.08.2003, S. 32.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Measurement-based quantum computation on cluster states
AU - Raussendorf, Robert
AU - Browne, Daniel E.
AU - Briegel, Hans J.
PY - 2003/8/25
Y1 - 2003/8/25
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84860802259&partnerID=8YFLogxK
U2 - 10.48550/arXiv.quant-ph/0301052
DO - 10.48550/arXiv.quant-ph/0301052
M3 - Article
AN - SCOPUS:84860802259
VL - 68
SP - 32
JO - Physical Review A - Atomic, Molecular, and Optical Physics
JF - Physical Review A - Atomic, Molecular, and Optical Physics
SN - 1094-1622
IS - 2
ER -