Measurement-based quantum computation on cluster states. Raussendorf, R., Browne, D. E., & Briegel, H. J. *Physical Review A*, 68(2):022312, August, 2003. ZSCC: 0001320Paper doi abstract bibtex 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.

@article{raussendorf_measurement-based_2003,
title = {Measurement-based quantum computation on cluster states},
volume = {68},
url = {https://link.aps.org/doi/10.1103/PhysRevA.68.022312},
doi = {10/ch96qm},
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.},
number = {2},
urldate = {2019-11-04},
journal = {Physical Review A},
author = {Raussendorf, Robert and Browne, Daniel E. and Briegel, Hans J.},
month = aug,
year = {2003},
note = {ZSCC: 0001320},
pages = {022312}
}

Downloads: 0

{"_id":"EhvR7MW9bC5vxmKMz","bibbaseid":"raussendorf-browne-briegel-measurementbasedquantumcomputationonclusterstates-2003","authorIDs":[],"author_short":["Raussendorf, R.","Browne, D. E.","Briegel, H. J."],"bibdata":{"bibtype":"article","type":"article","title":"Measurement-based quantum computation on cluster states","volume":"68","url":"https://link.aps.org/doi/10.1103/PhysRevA.68.022312","doi":"10/ch96qm","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.","number":"2","urldate":"2019-11-04","journal":"Physical Review A","author":[{"propositions":[],"lastnames":["Raussendorf"],"firstnames":["Robert"],"suffixes":[]},{"propositions":[],"lastnames":["Browne"],"firstnames":["Daniel","E."],"suffixes":[]},{"propositions":[],"lastnames":["Briegel"],"firstnames":["Hans","J."],"suffixes":[]}],"month":"August","year":"2003","note":"ZSCC: 0001320","pages":"022312","bibtex":"@article{raussendorf_measurement-based_2003,\n\ttitle = {Measurement-based quantum computation on cluster states},\n\tvolume = {68},\n\turl = {https://link.aps.org/doi/10.1103/PhysRevA.68.022312},\n\tdoi = {10/ch96qm},\n\tabstract = {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.},\n\tnumber = {2},\n\turldate = {2019-11-04},\n\tjournal = {Physical Review A},\n\tauthor = {Raussendorf, Robert and Browne, Daniel E. and Briegel, Hans J.},\n\tmonth = aug,\n\tyear = {2003},\n\tnote = {ZSCC: 0001320},\n\tpages = {022312}\n}\n","author_short":["Raussendorf, R.","Browne, D. E.","Briegel, H. J."],"key":"raussendorf_measurement-based_2003","id":"raussendorf_measurement-based_2003","bibbaseid":"raussendorf-browne-briegel-measurementbasedquantumcomputationonclusterstates-2003","role":"author","urls":{"Paper":"https://link.aps.org/doi/10.1103/PhysRevA.68.022312"},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/zotero/k4rtik","creationDate":"2020-05-31T17:07:22.570Z","downloads":0,"keywords":[],"search_terms":["measurement","based","quantum","computation","cluster","states","raussendorf","browne","briegel"],"title":"Measurement-based quantum computation on cluster states","year":2003,"dataSources":["Z5Dp3qAJiMzxtvKMq"]}