Scaling of success probabilities for linear optics gates

Abstract

By using the abstract linear-optical network derived in [S. Scheel and N. Lütkenhaus, New J. Phys. \textbf{6}, 51 (2004)] we show that for the lowest possible ancilla photon numbers the probability of success of realizing a (single-shot) generalized nonlinear sign shift gate on an ($N+1$)-dimensional signal state scales as $1/N^2$. We limit ourselves to single-shot gates without conditional feed-forward. We derive our results by using determinants of Vandermonde-type over a polynomial basis which is closely related to the well-known Jacobi polynomials.

10 pages, RevTeX4, 1 EPS figure

References in corpus (1)

• Upper bounds on success probabilities in linear optics

Cited by in corpus (6)

• Review article: Linear optical quantum computing
• Potential and limits to cluster state quantum computing using probabilistic gates
• Feed-forward and its role in conditional linear optical quantum dynamics
• Unity-Efficiency Parametric Down-Conversion via Amplitude Amplification
• Quasiprobability methods for multimode conditional optical gates
• Teleportation-Assisted Optical CSIGN Gates