Please use this identifier to cite or link to this item:
|Title:||A repeat-until-success quantum computing scheme||Authors:||Beige, A.
|Issue Date:||29-Jun-2007||Citation:||Beige, A., Lim, Y.L., Kwek, L.C. (2007-06-29). A repeat-until-success quantum computing scheme. New Journal of Physics 9 : -. ScholarBank@NUS Repository. https://doi.org/10.1088/1367-2630/9/6/197||Abstract:||Recently we proposed a hybrid architecture for quantum computing based on stationary and flying qubits: the repeat-until-success (RUS) quantum computing scheme. The scheme is largely implementation independent. Despite the incompleteness theorem for optical Bell-state measurements in any linear optics set-up, it allows for the implementation of a deterministic entangling gate between distant qubits. Here we review this distributed quantum computation scheme, which is ideally suited for integrated quantum computation and communication purposes. © IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.||Source Title:||New Journal of Physics||URI:||http://scholarbank.nus.edu.sg/handle/10635/95677||ISSN:||13672630||DOI:||10.1088/1367-2630/9/6/197|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 14, 2019
WEB OF SCIENCETM
checked on Jun 7, 2019
checked on May 24, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.