A repeat-until-success quantum computing scheme

Details A repeat-until-success quantum computing scheme A repeat-until-success quantum computing scheme

Jun 2007

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2007njph....9..197b&link_type=abstract

New Journal of Physics, Volume 9, Issue 6, pp. 197 (2007).

Physics

1

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A repeat-until-success quantum computing scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A repeat-until-success quantum computing scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A repeat-until-success quantum computing scheme will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1327839