Please use this identifier to cite or link to this item: https://doi.org/10.1088/1367-2630/9/6/197
DC FieldValue
dc.titleA repeat-until-success quantum computing scheme
dc.contributor.authorBeige, A.
dc.contributor.authorLim, Y.L.
dc.contributor.authorKwek, L.C.
dc.date.accessioned2014-10-16T09:14:31Z
dc.date.available2014-10-16T09:14:31Z
dc.date.issued2007-06-29
dc.identifier.citationBeige, 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.issn13672630
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/95677
dc.description.abstractRecently 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.sourceScopus
dc.typeArticle
dc.contributor.departmentPHYSICS
dc.description.doi10.1088/1367-2630/9/6/197
dc.description.sourcetitleNew Journal of Physics
dc.description.volume9
dc.description.page-
dc.identifier.isiut000247952900007
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on Nov 26, 2021

WEB OF SCIENCETM
Citations

9
checked on Nov 26, 2021

Page view(s)

118
checked on Dec 2, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.