High-fidelity linear optical quantum computing with polarization encoding

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 7 figures. Improved construction of high-fidelity entangled ancilla; references added

Scientific paper

10.1103/PhysRevA.73.012334

We show that the KLM scheme [Knill, Laflamme and Milburn, Nature {\bf 409}, 46] can be implemented using polarization encoding, thus reducing the number of path modes required by half. One of the main advantages of this new implementation is that it naturally incorporates a loss detection mechanism that makes the probability of a gate introducing a non-detected error, when non-ideal detectors are considered, dependent only on the detector dark-count rate and independent of its efficiency. Since very low dark-count rate detectors are currently available, a high-fidelity gate (probability of error of order $10^{-6}$ conditional on the gate being successful) can be implemented using polarization encoding. The detector efficiency determines the overall success probability of the gate but does not affect its fidelity. This can be applied to the efficient construction of optical cluster states with very high fidelity for quantum computing.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

High-fidelity linear optical quantum computing with polarization encoding 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 High-fidelity linear optical quantum computing with polarization encoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-fidelity linear optical quantum computing with polarization encoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-131319

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.