Entangling and assisted entangling power of bipartite unitary operations

TL;DR

This paper analytically investigates the entangling and assisted entangling power of bipartite unitary operations, providing exact values for specific classes and exploring their relationships and implications for quantum information processing.

Contribution

It derives explicit formulas for entangling and assisted entangling power of certain bipartite unitaries, including permutation and Clifford operators, and introduces a probabilistic implementation protocol.

Findings

Entangling power of permutation unitaries of Schmidt rank three is limited to two values.

Permutation unitaries of Schmidt rank four have maximum entangling and assisted entangling power of 2 ebits.

Bipartite permutation unitaries of Schmidt rank > 2 have entangling power > 1.223 ebits.

Abstract

Nonlocal unitary operations can create quantum entanglement between distributed particles, and the quantification of created entanglement is a hard problem. It corresponds to the concepts of entangling and assisted entangling power when the input states are, respectively, product and arbitrary pure states. We analytically derive them for Schmidt-rank-two bipartite unitary and some complex bipartite permutation unitaries. In particular, the entangling power of permutation unitary of Schmidt rank three can take only one of two values: $\log_2 9 - 16/9$ or $\log_2 3$ ebits. The entangling power, assisted entangling power and disentangling power of $2\times d_B$ permutation unitaries of Schmidt rank four are all $2$ ebits. These quantities are also derived for generalized Clifford operators. We further show that any bipartite permutation unitary of Schmidt rank greater than two has entangling power greater than $1.223$ ebits. We construct the generalized controlled-NOT (CNOT) gates whose assisted entangling power reaches the maximum. We quantitatively compare the entangling power and assisted entangling power for general bipartite unitaries, and study their connection to the disentangling power. We also propose a probabilistic protocol for implementing bipartite unitaries.