Upper bounds on success probabilities in linear optics

Abstract

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.

8 pages, typeset using RevTex4, 5 EPS figures

Cited by in corpus (18)

• Review article: Linear optical quantum computing
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Potential and limits to cluster state quantum computing using probabilistic gates
• Optimizing linear optics quantum gates
• Optical generation of matter qubit graph states
• Efficient construction of 2-D cluster states with probabilistic quantum gates
• On photonic controlled phase gates
• Minimal resources for linear optical one-way computing
• Cluster state preparation using gates operating at arbitrary success probabilities
• Feed-forward and its role in conditional linear optical quantum dynamics
• Scaling of success probabilities for linear optics gates
• Percolation in quantum computation and communication
• Teleportation-Assisted Optical CSIGN Gates
• Implementing Non-Projective Measurements via Linear Optics: an Approach Based on Optimal Quantum State Discrimination
• Concatenated beam splitters, optical feed-forward and the nonlinear sign gate
• The effect of component variations on the gate fidelity in linear optical networks
• Arbitrary-dimensional teleportation of optical number states with linear optics
• Universal Quantum Computation with Shutter Logic