Please use this identifier to cite or link to this item:
|Title:||Cluster state quantum computation and the repeat-until-success scheme|
|Citation:||Kwek, L.C. (2008-01-20). Cluster state quantum computation and the repeat-until-success scheme. International Journal of Modern Physics B 22 (1-2) : 33-43. ScholarBank@NUS Repository.|
|Abstract:||Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits. © World Scientific Publishing Company.|
|Source Title:||International Journal of Modern Physics B|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 7, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.