Upper bounds on success probabilities in linear optics

Stefan Scheel, Norbert Luetkenhaus

Published 2004-03-15Version 1

We develop an abstract way of defining linear-optics networks designed to perform quantum information tasks such as quantum gates. We will be mainly concerned with the nonlinear sign shift gate, but it will become obvious that all other gates can be treated in a similar manner. The abstract scheme is extremely well suited for analytical as well as numerical investigations since it reduces the number of parameters for a general setting. With that we show numerically and partially analytically for a wide class of states that the success probability of generating a nonlinear sign shift gate does not exceed 1/4 which to our knowledge is the strongest bound to date.