Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Entangling and assisted entangling power of bipartite unitary operations (1604.05788v4)

Published 20 Apr 2016 in quant-ph, math-ph, and math.MP

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.

Summary

We haven't generated a summary for this paper yet.