Abstract
Cluster states for measurement-based quantum computing can be created with entangling operations of arbitrary low success probability. This will place a lower bound on the minimum lifetime of the qubits used in the implementation. Here, we present a simple scaling argument for the T2 time of the qubits for various cluster state geometries. The results suggest that the required T2 times are not unrealistic for the practical implementation of universal quantum computing with cluster states.
© 2013 IEICE
PDF ArticleMore Like This
Hee Su Park, Sang Min Lee, Jaeyoon Cho, Yoonshik Kang, and Sang-Kyung Choi
QMI2 International Conference on Quantum Information (QIM) 2011
Mihir Pant, Hyeongrak Choi, Saikat Guha, and Dirk Englund
FTh1G.6 CLEO: QELS_Fundamental Science (CLEO:FS) 2018
G. Vallone, E. Pomarico, P. Mataloni, F. De Martini, and V. Berardi
IC4_2 International Quantum Electronics Conference (IQEC) 2007