Please use this identifier to cite or link to this item:
https://doi.org/10.1088/1367-2630/9/6/197
DC Field | Value | |
---|---|---|
dc.title | A repeat-until-success quantum computing scheme | |
dc.contributor.author | Beige, A. | |
dc.contributor.author | Lim, Y.L. | |
dc.contributor.author | Kwek, L.C. | |
dc.date.accessioned | 2014-10-16T09:14:31Z | |
dc.date.available | 2014-10-16T09:14:31Z | |
dc.date.issued | 2007-06-29 | |
dc.identifier.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 | |
dc.identifier.issn | 13672630 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/95677 | |
dc.description.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. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | PHYSICS | |
dc.description.doi | 10.1088/1367-2630/9/6/197 | |
dc.description.sourcetitle | New Journal of Physics | |
dc.description.volume | 9 | |
dc.description.page | - | |
dc.identifier.isiut | 000247952900007 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.