pith. sign in

arxiv: quant-ph/0508113 · v2 · pith:GQR7G2PVnew · submitted 2005-08-15 · 🪐 quant-ph

High-fidelity linear optical quantum computing with polarization encoding

classification 🪐 quant-ph
keywords gateencodingpolarizationprobabilitycomputingdark-countdetectordetectors
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.