Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1210.1296 · Journal of Physics A Mathematical and Theoretical

Minimum entangling power is close to its maximum

Jianxin Chen, Zhengfeng Ji, David W. Kribs, Bei Zeng, Fang Zhang

Published Apr 4, 2019• 10 citations
arXivHTMLPDF

Abstract

Abstract Given a quantum gate U acting on a bipartite quantum system, its maximum (average, minimum) entangling power is the maximum (average, minimum) entanglement generation with respect to certain entanglement measures when the inputs are restricted to be product states. In this paper, we mainly focus on the ‘weakest’ one, i.e. the minimum entangling power, among all these entangling powers. We show that, by choosing the entropy of entanglement or Schmidt rank as entanglement measure, even the ‘weakest’ entangling power is generically very close to the maximum possible value of the entanglement measure. In other words, maximum, average and minimum entangling powers are generically close. We then study minimum entangling power with respect to other Lipschitiz-continuous (for the Hilbert space distance) entanglement measures and generalize our results to multipartite quantum systems.

DOI
10.1088/1751-8121/ab15e3

Related papers

Multipartite entangling power by von Neumann entropy

Xinyu Qiu, Zhiwei Song, Lin Chen

Quantifying the entanglement generation of a multipartite unitary operation is a key problem in quantum information processing. We introduce the definition of multipartite entangling, assisted entangling, and disentangling power, which is a natural generalization of the bipartite ones. We show that they are assumed at a specified quantum state. We analytically derive the entangling power of Schmidt-rank-two multiqubit unitary operations by the minimal convex sum of modulo-one complex numbers. Besides we show the necessary and sufficient condition that the assisted entangling power of Schmidt-rank-two unitary operations reaches the maximum. We investigate the widely used multiqubit gates, for example, the entangling power of CCZS gate, the entangling and assisted entangling power of the $n$-qubit Toffoli gate. The entangling power of the three-qubit Fredkin gate is two ebits, and that of the four-qubit Fredkin gate is in two to ${log}_{2}5$ ebits. Further we investigate the entangling power during the noisy implementation of operations.

arXiv:2410.15253•Physical Review A•Feb 7, 2025•1 citation

Entangling power and its deviation: A quantitative analysis on input-state dependence and variability in entanglement generation

Kyoungho Cho, Jeongho Bang

Quantifying the entangling capability of quantum operations is a fundamental task in quantum information science. Traditionally, this capability is measured by the entangling power (EP), defined as the average entanglement generated when a quantum operation acts uniformly on all possible product states. However, EP alone cannot capture the intricate input-state-dependent nature of entanglement generation. To address this, we define a complementary metric -- entangling power deviation (EPD) -- as the standard deviation of entanglement generated over all product input states, thereby capturing the multifaceted nature of entangling behavior. We develop a general group-theoretical framework that yields closed-form expressions for both EP and EPD. Our analysis shows that any nontrivial entangling operation necessarily exhibits input-state dependence: nonzero EP implies a nonzero EPD. By analyzing representative two-qubit gates, we show that the gates with identical EP can exhibit markedly different EPD values, illustrating that the nature of entanglement generation can significantly differ depending on the gate functionality. Extending our framework to a class of generalized controlled-unitary operations acting on bipartite Hilbert spaces of arbitrary dimensions, we further analyze the interplay between the entangling strength and uniformity, as quantified by EP and EPD. Moreover, we uncover a subtle dimension-parity-dependent behavior in entanglement generation, which EP alone fails to detect. These findings highlight EPD as an indispensable diagnostic tool -- one that, alongside EP, provides a deeper and more complete characterization of the entangling structure.

arXiv:2508.00301•Physical Review A•Jan 9, 2026•2 citations

Entangling power and fidelity diagnostic for bipartite quantum channels

Marcin Rudziński, Gianluigi Tartaglione, Karol Życzkowski

We study two distinct diagnostics of bipartite quantum channels: the average fidelity between a desired state and noisy output across different classes of input states, and generation of entanglement from pure product input states, quantified by well-defined entangling power. These diagnostics are generally independent, but together they provide a more complete description of bipartite channels. We show that the fidelity averaged over any local-unitary orbit with fixed Schmidt coefficients for equal local dimensions is completely determined by the average input-output fidelity and its restriction to product inputs. We also introduce concurrence- and negativity-based entangling power for two-qubit channels, prove their convexity and monotonicity under local postprocessing, and show that, unlike the previously proposed linear-entropy quantity, they vanish for all separable channels. Representative separable and nonseparable channels are investigated. Finally, we generalize our definitions of entangling power to nonproduct inputs, and provide an analytical lower bound for the concurrence-based entanglement variation, showing its effectiveness with specific examples.

quant-pharXiv:2605.26867•Physical Review A•May 27, 2026•0 citations

Entangling power of multipartite unitary gates

Tomasz Linowski, Grzegorz Rajchel-Mieldzioć, Karol Życzkowski

Abstract We study the entangling properties of multipartite unitary gates with respect to the measure of entanglement called one-tangle. Putting special emphasis on the case of three parties, we derive an analytical expression for the entangling power of an n-partite gate as an explicit function of the gate, linking the entangling power of gates acting on the n-partite Hilbert space of dimension to the entanglement of pure states in the Hilbert space of dimension . Furthermore, we evaluate its mean value averaged over the unitary and orthogonal groups, analyze the maximal entangling power and relate it to the absolutely maximally entangled (AME) states of a system with 2n parties. Finally, we provide a detailed analysis of the entangling properties of the three-qubit unitary and orthogonal gates.

arXiv:1909.07709•Journal of Physics A Mathematical and Theoretical•Feb 10, 2020•16 citations

Entangling power of two-qubit unitary operations

Yi Shen, Lin Chen

Abstract The entangling power of a bipartite unitary operation shows the maximum created entanglement with the product input states. For an arbitrary two-qubit unitary operation, it is sufficient to consider its normalized operation U with parameters and c 3 . We show how to compute the entangling power of U when . In particular we construct the analytical expressions of entangling power of such U for two examples. We also formulate the entangling power of bipartite unitary operations of Schmidt rank two for any dimensions.

arXiv:1804.01222•Journal of Physics A Mathematical and Theoretical•Aug 3, 2018•8 citations

Entangling and assisted entangling power of bipartite unitary operations

Lin Chen, Li Zhi Yu

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\ensuremath{-}16/9$ or ${log}_{2}3$ ebits. The entangling power, assisted entangling power, and disentangling power of $2\ifmmode\times\else\texttimes\fi{}{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 their connection to the disentangling power by proposing a probabilistic protocol for implementing bipartite unitaries.

arXiv:1604.05788•Physical Review A•Aug 8, 2016•16 citations
Abstract Given a quantum gate U acting on a bipartite quantum system, its maximum (average, minimum) entangling power is the maximum (average, minimum) entanglement generation with respect to certain entanglement measures when the inputs are restricted to be product states. In this paper, we mainly focus on the ‘weakest’ one, i.e. the minimum entangling power, among all these entangling powers. We show that, by choosing the entropy of entanglement or Schmidt rank as entanglement measure, even the ‘weakest’ entangling power is generically very close to the maximum possible value of the entanglement measure. In other words, maximum, average and minimum entangling powers are generically close. We then study minimum entangling power with respect to other Lipschitiz-continuous (for the Hilbert space distance) entanglement measures and generalize our results to multipartite quantum systems.
Quantifying the entanglement generation of a multipartite unitary operation is a key problem in quantum information processing. We introduce the definition of multipartite entangling, assisted entangling, and disentangling power, which is a natural generalization of the bipartite ones. We show that they are assumed at a specified quantum state. We analytically derive the entangling power of Schmidt-rank-two multiqubit unitary operations by the minimal convex sum of modulo-one complex numbers. Besides we show the necessary and sufficient condition that the assisted entangling power of Schmidt-rank-two unitary operations reaches the maximum. We investigate the widely used multiqubit gates, for example, the entangling power of CCZS gate, the entangling and assisted entangling power of the nnn-qubit Toffoli gate. The entangling power of the three-qubit Fredkin gate is two ebits, and that of the four-qubit Fredkin gate is in two to log25{log}_{2}5log2​5 ebits. Further we investigate the entangling power during the noisy implementation of operations.
Quantifying the entangling capability of quantum operations is a fundamental task in quantum information science. Traditionally, this capability is measured by the entangling power (EP), defined as the average entanglement generated when a quantum operation acts uniformly on all possible product states. However, EP alone cannot capture the intricate input-state-dependent nature of entanglement generation. To address this, we define a complementary metric -- entangling power deviation (EPD) -- as the standard deviation of entanglement generated over all product input states, thereby capturing the multifaceted nature of entangling behavior. We develop a general group-theoretical framework that yields closed-form expressions for both EP and EPD. Our analysis shows that any nontrivial entangling operation necessarily exhibits input-state dependence: nonzero EP implies a nonzero EPD. By analyzing representative two-qubit gates, we show that the gates with identical EP can exhibit markedly different EPD values, illustrating that the nature of entanglement generation can significantly differ depending on the gate functionality. Extending our framework to a class of generalized controlled-unitary operations acting on bipartite Hilbert spaces of arbitrary dimensions, we further analyze the interplay between the entangling strength and uniformity, as quantified by EP and EPD. Moreover, we uncover a subtle dimension-parity-dependent behavior in entanglement generation, which EP alone fails to detect. These findings highlight EPD as an indispensable diagnostic tool -- one that, alongside EP, provides a deeper and more complete characterization of the entangling structure.
We study two distinct diagnostics of bipartite quantum channels: the average fidelity between a desired state and noisy output across different classes of input states, and generation of entanglement from pure product input states, quantified by well-defined entangling power. These diagnostics are generally independent, but together they provide a more complete description of bipartite channels. We show that the fidelity averaged over any local-unitary orbit with fixed Schmidt coefficients for equal local dimensions is completely determined by the average input-output fidelity and its restriction to product inputs. We also introduce concurrence- and negativity-based entangling power for two-qubit channels, prove their convexity and monotonicity under local postprocessing, and show that, unlike the previously proposed linear-entropy quantity, they vanish for all separable channels. Representative separable and nonseparable channels are investigated. Finally, we generalize our definitions of entangling power to nonproduct inputs, and provide an analytical lower bound for the concurrence-based entanglement variation, showing its effectiveness with specific examples.
Abstract We study the entangling properties of multipartite unitary gates with respect to the measure of entanglement called one-tangle. Putting special emphasis on the case of three parties, we derive an analytical expression for the entangling power of an n-partite gate as an explicit function of the gate, linking the entangling power of gates acting on the n-partite Hilbert space of dimension to the entanglement of pure states in the Hilbert space of dimension . Furthermore, we evaluate its mean value averaged over the unitary and orthogonal groups, analyze the maximal entangling power and relate it to the absolutely maximally entangled (AME) states of a system with 2n parties. Finally, we provide a detailed analysis of the entangling properties of the three-qubit unitary and orthogonal gates.
Abstract The entangling power of a bipartite unitary operation shows the maximum created entanglement with the product input states. For an arbitrary two-qubit unitary operation, it is sufficient to consider its normalized operation U with parameters and c 3 . We show how to compute the entangling power of U when . In particular we construct the analytical expressions of entangling power of such U for two examples. We also formulate the entangling power of bipartite unitary operations of Schmidt rank two for any dimensions.
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\ensuremath{-}16/9$ or log23{log}_{2}3log2​3 ebits. The entangling power, assisted entangling power, and disentangling power of $2\ifmmode\times\else\texttimes\fi{}{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 their connection to the disentangling power by proposing a probabilistic protocol for implementing bipartite unitaries.