Quantifying Entangling Power of Controlled Unitary Gates
Ankur Haldar Pankaj Agrawal Prasenjit Deb
作者信息
Abstract
Applying controlled unitary gates to generate entanglement between qubits is a routine task in both quantum communication and computation. The existing tools for predicting how much entanglement a given gate can generate require either simulation of the entangling circuit or averaging over a distribution of inputs for a given controlled unitary gate. Here, we introduce a computable quantity $ζ$ that not only determines whether a controlled unitary gate generates entanglement, but also quantifies the entanglement for any specific input without requiring the construction of the output state. For two-qubit controlled unitary gates, we establish the physical conditions corresponding to the extremum values of the proposed quantity. Extending the dimension of control and target registers to arbitrary size through a generalized controlled unitary architecture, we derive a universal upper bound on $ζ$ and identify the conditions for its saturation. Later we establish functional relation between the quantity and other known quantities, such as purity, normalized linear entropy, and von Neumann entropy. Finally, we compare our results with previous research work and show that the quantity proposed in this work achieves the previously known optimal values of entangling power of controlled unitary gates for some specific dimensions of target and control registers.引用本文复制引用
Ankur Haldar,Pankaj Agrawal,Prasenjit Deb.Quantifying Entangling Power of Controlled Unitary Gates[EB/OL].(2026-08-21)[2026-09-01].https://arxiv.org/abs/2608.21105.学科分类
物理学
|国家预印本平台