Cluster-state quantum computation

Reports on Mathematical Physics

Volumn 57, Issue 1, 2006, Pages 147-161

  Nielsen, Michael A ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

cluster states; one way quantum computer; quantum computation

Indexed keywords

EID: 33744535413     PISSN: 00344877     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0034-4877(06)80014-5     Document Type: Article

References (35)

1. Nielsen M.A., and Chuang I.L. Quantum Computation and Quantum Information (2000), Cambridge University Press, Cambridge
2. Raussendorf R., and Briegel H.J. Phys. Rev. Lett. 86 (2001) 5188
3. Raussendorf R., Browne D.E., and Briegel H.J. J. Mod. Opt. 49 (2002) 1299
4. Nielsen M.A. Phys. Rev. Lett. 93 (2004) 040503
5. D. E. Browne and T. Rudolph: Resource-efficient linear optical quantum computation, quant-ph/0405157.
6. Walther P., Resch K.J., Rudolph T., Schenck E., Weinfurter H., Vedral V., Aspelmeyer M., and Zeilinger A. Nature 434 (2005) 169
7. Nielsen M.A. Phys. Lett. A 308 (2003) 96
8. D. W. Leung: Two qubit projective measurements are universal for quantum computation, quant-ph/0111122.
9. D. W. Leung: Quantum computation by measurements, quant-ph/0310189.
10. P. Aliferis and D. W. Leung: Computation by measurements: a unifying picture, quant-ph/0404082.
11. A. M. Childs, D. W. Leung and M. A. Nielsen: Unified derivation of measurement-based schemes for quantum computation, quant-ph/0404132.
12. P. Jorrand and S. Perdrix: Unifying quantum computation with projective measurements only and one-way quantum computation, quant-ph/0404125.
13. T. Rudolph and S. S. Virmani: A relational quantum computer using only two-qubit total spin measurement and an initial supply of highly mixed single qubit states, quant-ph/0503151.
14. P. Aliferis and D. W. Leung: Fault-tolerant quantum computation with graph states, quant-ph/0503130.
15. V. Danos, E. Kashefi and P. Panangaden: The measurement calculus, quant-ph/0412135.
16. M. Mhalla and S. Perdrix: Complexity of graph state preparation, quant-ph/0412071.
17. M. A. Nielsen and C. M. Dawson: Fault-tolerant quantum computation with cluster states, quant-ph/0405134.
18. S. Perdrix and P. Jorrand: Measurement-based quantum Turing machines and their universality, quant-ph/0404146.
19. Verstraete F., and Cirac J.I. Phys. Rev. A 70 (2004) 060302R
20. S. D. Barrett and P. Kok: Efficient high-fidelity quantum computation using matter qubits and linear optics, quant-ph/0408040.
21. Hutchinson G.D., and Milburn G.J. J. Mod. Opt. 51 (2004) 1211
22. Raussendorf R., and Briegel H.J. J. Mod. Opt. 49 (2002) 1299
23. Raussendorf R., Browne D.E., and Briegel H.J. Phys. Rev. A 68 (2003) 022312
24. Deutsch D. Proc. R. Soc. Lond. A 425 (1989) 73
25. chapter II in [35]. Brylinski J.L., and Brylinski R. Universal quantum gates (2002), CRC Press, Chapman & Hall
26. E. Knill: Approximating quantum circuits, quant-ph/9508006.
27. Nielsen M.A. Journal club notes on cluster-state quantum computation. http://www.qinfo.org/qc-by
28. Raussendorf R., and Briegel H.J. Phys. Rev. Lett. 85 (2001) 910
29. Zhou X., Leung D.W., and Chuang I.L. Phys. Rev. A 62 (2000) 052316
30. Einstein A., Podolsky B., and Rosen N. Phys. Rev. 47 (1935) 777
31. E. Knill: Thresholds for linear optics quantum computation, quant-ph/0006120.
32. Haselgrove H.L., Nielsen M.A., and Osborne T.J. Phys. Rev. Lett. 91 (2003) 052311
33. Gottesman D. Stabilizer codes and quantum error correction. Ph.D. thesis (1997), California Institute of Technology, Pasadena
34. Kempe J., Kitaev A., and Regev O. The complexity of the local Hamiltonian problem. Proc. 24th FSTTCS (2004) 373
35. In: Brylinski K.R., and Chen G. (Eds). Mathematics of Quantum Computation. Computational Mathematics (2002), CRC Press, Chapman & Hall