Probabilistically implementing nonlocal operation using non-maximally entangled state

Abstract

We develop the probabilistic implementation of a nonlocal gate $\exp{[iξ{σ_{n_A}}σ_{n_B}]}$ and $ξ\in[0,\frac\pi4]$, by using a single non-maximally entangled state. We prove that, nonlocal gates can be implemented with a fidelity greater than 79.3% and a consumption of less than 0.969 ebits and 2 classical bits, when $ξ\leq0.353$. This provides a higher bound for the feasible operation compared to the former techniques \cite{Cirac,Groisman,Bennett-1}. Besides, gates with $ξ\geq0.353$ can be implemented with the probability 79.3% and a consumption of 0.969 ebits, which is the same efficiency as the distillation-based protocol \cite{Groisman,Bennett-1}, while our method saves extra classical resource. Gates with $ξ\to0$ can be implemented with nearly unit probability and a small entanglement. We also generalize some application to the multiple system, where we find it is possible to implement certain nonlocal gates between many non-entangled partners using a non-maximally multiple entangled state.