Multipartite entangling power by von Neumann entropy
Abstract
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 multi-qubit 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 further investigate the widely-used multi-qubit gates, for example, the entangling and assisted entangling power of the -qubit Toffoli gate is one ebit. The entangling power of the three-qubit Fredkin gate is two ebits, and that of the four-qubit Fredkin gate is in two to ebits.
I Introduction
Entanglement is a key resource in quantum information processing tasks, such as dense coding bennett1992communication ; qiu2022quantum , distributed computation dis1999cirac and efficient tomography cramer2010Efficient . In practice, entanglement is generated by nonlocal unitary operations. It is of importance to quantify how much entanglement a unitary operation can generate. This is characterized by entangling power, the most fundamental quantity to evaluate the usefulness of the nonlocal unitary operation acting on a composed quantum system. For instance, more entanglement generated by a unitary operation guarantees high fidelity and robustness in quantum communication hu2021long ; qiu2024w1 . Entangling power is firstly defined for the bipartite nonlocal unitary operation ent2000zanardi ; wang2002ep ; hamma2004ep ; mkz13 . By taking the maximum or average over all input states, the entangling power is defined via various entropy of entanglement, such as linear entropy ent2000zanardi and von Neumann entropy Nielsen03 . Analytically, the entangling power of Schmidt-rank-two bipartite unitary and some complex bipartite permutation unitaries are derived lcly20160808 ; ent2016yu ; ent2018shen .
Multipartite entanglement has been paid much attention with the development of its realization cao2023gene ; high2023ever and applications exp2022nad ; expqkd2022nad . Multipartite unitary operations are vital in the construction of such states. Their experimental implementation is paid much attention wang2015improving , for example, the multi-qubit controlled phase gate is implemented by extracting gate fidelity with neutral atoms levine2019parallel . In this case, the investigation of entangling power of multipartite operations is necessary. Multipartite entangling power with respect to the mean output entanglement for random pure states sampled according to the unitarily invariant Haar measure is investigated scott2004mul . Recently it has been shown that the minimum entangling power is close to its maximum by choosing the entropy of entanglement or Schmidt rank as entanglement measure mini2019chen . The analytical expression of the entangling power of -partite unitary operations is derived concerning linear entropy of entanglement ent2020lin , where the von Neumann entropy is not considered as it is much harder to obtain than the linear entropy. However, the von Neumann entropy is one of the cornerstones of quantum information theory ohya1995entropy ; song2023proof . Roughly speaking, it quantifies the amount of quantum information contained in a state of independently distributed quantum systems, and also fully characterizes single-shot state transitions in unitary quantum mechanics boes2019von . As an application, von Neumann entropy plays an essential role in the coding theorem schu1995coding ; winter1999coding . From a practical perspective, it is of importance to consider the multipartite entangling power by von Neumann entropy. As far as we know, the analytical derivation of that has not been analyzed due to its difficulty.
In this paper, we focus on the property and analytical expression of entangling power of -partite unitary operations with respect to von Neumann entropy. To be specific, we show the definition of multipartite entangling, assisted entangling and disentangling entangling power in Definitions 4 and 5. It is the maximal von Neumann entropy over all input states with ancillae and possible bipartite divisions of multipartite systems. Hence the multipartite entangling power is a natural generalization of the bipartite one. Based on that, we show that the multipartite entangling, assisted entangling and disentangling power are assumed at a specified state by some facts in functional analysis. They are presented in Propositions 8 and 9. It implies that the supreme in the definition reaches the maximum exactly, and shows benefits in the derivation of entangling power. As the example, we show the analytical results of entangling power of three and -qubit () Schmidt-rank-two unitary operations in Propositions 15 and 17, respectively. They are obtained by the results on the minimal convex sum of some modulo-one complex numbers in Lemma 10. We present the necessary and sufficient condition that the assisted entangling power of three and -qubit () Schmidt-rank-two unitary operations reach the maximum in Propositions 16 and 18, respectively. Up to local unitaries, we consider the entangling and assisted entangling power of the widely-used multi-qubit unitary operations including Toffoli and Fredkin gate. We show that the entangling and assisted entangling power of a -qubit Toffoli gate is one ebit in Proposition 19. The entangling power of the three-qubit Fredkin gate is two ebits shown in Proposition 20, and that of four-qubit Fredkin gate is in two to ebits.
The rest of this paper is organized as follows. In Sec. II we introduce the notations, some facts of bipartite entangling power, von Neumann entropy and functional analysis. In Sec. III we show the definition and physical meaning of multipartite entangling power, and show their properties. In Sec. IV we show the entangling and assisted entangling power of multi-qubit Schmidt-rank-two unitary operations. In Sec. V, we show the entangling and assisted entangling power of widely used gates including Toffoli and Fredkin gate. We conclude in Sec. VI.
II Preliminaries and notations
In this section we show the notations and some facts used in this paper. First we present the notations of this paper. Then we show the definition and some properties of entangling power of bipartite unitaries. Finally we introduce some facts about continuous mapping in functional analysis, which will be used later.
Let be the Hilbert space of system . We denote by the set of complex matrices, by the set of complex matrices and by the set of unitary matrices, by the Schmidt rank of a bipartite unitary. The Schatten -norm for arbitrary operator and is defined as . By setting and in the definition of , the trace norm and Frobenius norm are obtained, respectively. The distance induced by Schatten -norm is given by . We denote by the von Neumann entropy of the quantum state , by the entangling power of a , and by the entangling power of under the bipartition .
Next we present the definition of entangling and assisted entangling power of bipartite unitaries. The entangling power of a bipartite unitary acting on the Hilbert space of systems , is defined as Nielsen03
(1) |
where and are pure states, and are the local auxiliary systems, and denotes the entanglement of the state , i.e. the von Neumann entropy of the reduced density matrix on any one system, . No entanglement is required as the initial resource and for all bipartite unitaries . From a generalized perspective, entanglement may be the initial resource. This derives the assisted entangling power, which is defined as lhl03
(2) |
where is a bipartite pure state. Obvious it holds that . Any bipartite unitary acting on has Schmidt rank equal to if there is an expansion of the form , where matrices are linearly independent, and the matrices are also linearly independent. So . The operator Schmidt decomposition in a standard form, i.e. , where , and the Schmidt coefficients satisfy , . Obviously the Schmidt coefficients are invariant under local unitaries. For any bipartite unitary , the following inequality holds
(3) |
where and ’s are defined in the standard form of Schmidt decomposition. If a bipartite unitary acting on is a controlled one, namely with the pairwise orthogonal projectors on and the unitary operators on , then the assisted entangling power of satisfies that
(4) |
where the second inequality becomes equality if and only if there is a mixed state such that the equations hold for any and lcly20160808 . Using the above fact, one can obtain assisted entangling power with the help of entangling power in some cases.
In quantum information processing, functional analysis allows us to consider a specific analytical problem from the comprehensive perspective of pure algebra and topology. We introduce some facts about compact set of a Hilbert space and continuous mapping as follows.
Theorem 1
Let be a Hilbert space, and is a subset of . Then the subset is compact if and only if is closed and bounded in .
Definition 2
Let and be metric spaces. A mapping is said to be continuous at a point if for every there is a such that for all satisfying . is said to be continuous if it is continuous at every point of .
Theorem 3
A continuous mapping of a compact subset of a metric space into assumes a maximum and minimum at some points of .
Using above facts, we will show the essential property of entangling power. This property will show benefits in the analytical derivation of entangling power.
III Definition and properties of multipartite entangling power
In this section we propose the definition, physical meaning and some properties of multipartite entangling and assisted entangling power. In Sec. III.1, we show the definition and physical meaning of entangling and assisted entangling power of multi-qubit unitary operations. In Sec. III.2 we show that the supremum is exactly maximum in their definitions, which will contribute to the calculation of the entangling power.
III.1 Definition and physical meanings
In this paper we focus on the multipartite quantum systems, where the structure of the entangled states is more complex than that of the bipartite case. For instance, an -partite pure state in the Hilbert space is fully separable in any bipartite cut if and only if with . However the violation of full separation may not lead to a fully entangled state, as a multipartite state may be entangled by the bipartition on some of the subsystems for example, the state , where is a qubit state and is a qubit GHZ state.
We study the entangling power of a multipartite unitary with regard to the maximal von Neumann entropy, over all possible divisions of a multipartite system. Its definition is given as follows.
Definition 4
The entangling power of a unitary acting on the Hilbert space of a -partite system is defined as
where is the complement set of .
One can see that the multipartite entangling power is a natural generalization of the bipartite one. Practically, if a gate is applied in a quantum protocol or circuit without initial entanglement, then the entangled generation of this protocol or circuit will not be larger than the entangling power of . As mentioned above, the input states are chosen as fully separable states here. This means that we do not need any entanglement as the initial resource. The entangling power shows the maximum entanglement that generated by over all kinds of bipartite cuts. As in Sec. III.1, it holds that .
The multipartite assisted entangling power is also a generalization of the bipartite case. It allows the entanglement to be the initial resource and is characterized by the maximal von Neumann entropy over all possible bipartite cuts. The multipartite assisted entangling power is defined by the difference between the entanglement of output and input states.
Definition 5
Let be the Hilbert space of a -partite system, that is, . Then
(i) The assisted entangling power of a unitary acting on is defined as
(5) | |||
The multipartite assisted entangling power characterizes the power of a unitary operation that can change the entanglement of a quantum state. The input states of entangling power are included in that of assisted entangling power, and hence . In practice, the multipartite assisted entangling power characterizes the maximal change of entanglement in a quantum protocol.
Note that the auxiliary systems are necessary in Definition 4 and 5. For example, the three-qubit unitary operation satisfies that . So it can not generate any entanglement from the fully separable states. By adding the auxiliary systems, one can see that the entangling power of the gate is 2 ebits by (3).
III.2 Entangling, assisted entangling and disentangling power are assumed at a quantum state
The multipartite entangling, assisted entangling and disentangling power are defined by taking the supreme over all quantum states. One may wonder whether entangling and assisted entangling power can always be assumed at a specified input state, as it will facilitate their derivation. Here we prove that the answer is yes by some facts in functional analysis. This implies that the supreme in Definitions 4 and 5 are exactly maximum. Besides, this fact contributes to the analytical derivation and precise estimation of entangling power. The proof of the facts in this section is shown in Appendix A.
Before showing the main results, we introduce some basic facts about the set consisting of multipartite pure states and pure product states, respectively.
Lemma 6
Suppose is the set of -partite operators given by with and , . The Schatten- norm is denoted by with . Then
(i)All density operators of -dimensional -partite pure states form a compact subset of the normed space .
(ii) All density operators of -dimensional -partite pure product states form a compact subset of the normed space .
Remark 7
Lemma 6 also holds for the set of all quantum states, as the limit of a sequence of positive semidefinite matrices is also positive semidefinite.
Now we are ready to show the main result of this section. It implies that the supreme in the definition of assisted entangling and disentangling power is the maximum exactly.
Proposition 8
(i) The supremum of multipartite assisted entangling power of unitary operations is assumed at some pure states. That is, the assisted entangling power of a unitary operation acting on the -partite system is exactly .
(ii) The supremum of multipartite disentangling power of unitary operations is assumed at some pure states. That is, the disentangling power of a unitary operation acting on the -partite system is exactly .
Similar to Proposition 8, we obtain the following results concerning entangling power.
Proposition 9
The maximum of multipartite entangling power of unitary operations is assumed at some product states. That is, the entangling power of a unitary operation acting on the -partite system is exactly .
The preceding facts show that it suffices to consider the maximum for the derivation of the entangling power of unitary operations. Next we show some examples concerning multi-qubit Schmidt-rank-two unitary operations and some widely used multi-qubit unitary operations.
IV Entangling and assisted entangling power of multi-qubit Schmidt-rank-two unitaries
Schmidt-rank-two multi-qubit unitaries are widely used in quantum information processing, for example, the multi-qubit controlled phase gate. In this section we show the entangling power of this kind of unitaries. In Sec. IV.1, we present some useful facts that will be used for the derivation of the entangling power. In Sec. IV.2, we show the entangling and assisted entangling power of multi-qubit Schmidt-rank-two unitary operations.
IV.1 Preliminary lemmas
We consider the minimum convex sum of finite module-one complex numbers. First we show the expression of the minimum convex sum of a set. Based on that, we prove that the minimum convex sum decreases with the cardinality of this set. The proof of the facts in this section is shown in Appendix B.
Lemma 10
The minimum convex sum of the set with and is derived by
(7) | |||||
From the proof of Lemma 10, one can obtain that the minimum convex sum decreases with the cardinality of a set. This fact will be used to obtain the entangling power of multi-qubit unitary operations.
Lemma 11
Suppose two sets and satisfies and . Then
(i) The minimum convex sum of the set is not less than that of , that is,
(8) |
(ii) The maximum convex sum of the set is not more than that of , that is,
(9) |
We show the expression of entangling power of a Schmidt-rank-two bipartite unitary acting on states, which will be used later in the analysis of multi-qubit case. From Eq. (18) in lcly20160808 , it has been obtained that the entangling power of the unitary with orthogonal projectors and real parameters shows
(10) | |||||
From Lemma 10 and (10), the entangling power of Schmidt-rank-two bipartite unitaries can be obtained as follows.
Lemma 12
Suppose is a controlled unitary with orthogonal projectors and real parameters . Without loss of generality, one can assume that and for . Then has the entangling power
where .
Next we simplify the analysis of entangling power. That is, the critical states for multipartite unitaries with Schmidt rank equal to two can be removed during its calculation.
Lemma 13
Up to local unitary, we assume that a -partite unitary is controlled from side, where the projectors ’s are pairwise orthogonal to each other and ’s are pairwise orthogonal -partite unitaries. Under the bipartition , the maximal entanglement generation can be derived by removing the ancilla . That is,
(11) | |||||
(12) |
From the proof of Lemma 13, when a -partite unitary is controlled from more than one subsystem, their corresponding ancilla systems can also be removed for the calculation of entangling power.
Lemma 14
Let and . Up to local unitary, we assume that a -partite unitary is controlled from side, where the projectors ’s are pairwise orthogonal to each other and ’s are pairwise orthogonal unitaries. Under the bipartition , the maximal entanglement generation can be derived by removing the ancilla . That is,
As we shall see, these facts bring convenience for the derivation of the entangling power of Schmidt-rank-two unitary operations.
IV.2 Entangling and assisted entangling and assisted entangling power of multi-qubit Schmidt-rank-two unitaries
First we consider the entangling power for the three-qubit case, which is a generalization of the two-qubit one. Using Lemmas 10 and 13, we have the following results.
Proposition 15
Up to system permutation, a Schmidt-rank-two three-qubit unitary is a controlled unitary with orthogonal projectors and with . Let
and be the -th smallest element in . Then has the entangling power
(13) | |||||
where and .
From Proposition 15, one can obtain the assisted entangling power of some Schmidt-rank-two three-qubit unitary, where the assisted entangling power reaches the maximum.
Proposition 16
By the assumption in Proposition 15, the assisted entangling power of a Schmidt-rank-two three-qubit unitary reaches the maximum, i.e. one ebit if and only if there is a such that , for .
Proof.
The proof of Proposition 15 shows that the unitary is controlled by two terms under any possible bipartition. We consider the bipartition , where denotes the controlled system. Suppose the unitaries , on system correspond to the set in Proposition 15. From (4), one has (ebit), and the entanglement generation by this bipartition if and only if there is a mixed state such that , where is the controlled unitaries implemented on . Again by the proof of Proposition 15, s.t. if and only if the minimum convex sum of the set contains the original point, namely . Note that is the maximal entanglement generation over all divisions. Hence if and only if there is a satisfies the condition above.
Proposition 16 gives the necessary and sufficient condition that the three-qubit assisted entangling power reaches the maximum. It shows that many widely used three-qubit universal quantum gates have the assisted entangling power equal to one ebit, as we shall see in Sec. V. From the perspective of entanglement, these universal gates generate the maximum entanglement among all Schmidt-rank-two unitaries and hence are economic in quantum protocols.
Next we focus on the entangling and assisted entangling power of -qubit () Schmidt-rank-two unitaries. The multipartite unitary gates are called genuine if they are not product unitary operators across any bipartition. In shen2022class , the Schmidt-rank-two genuine multipartite unitary gates are classified, and the parametric Schmidt decomposition is given in TABLE 1.
singular number | parametric Schmidt decomposition | range of parameters |
and | ||
We analyze the entangling power of a -qubit Schmidt-rank-two unitary acting on systems . It suffices to consider the genuine multipartite unitaries where there are not product unitary operators across any bipartition. In fact, if the subsystems of a unitary are product unitaries then this part will not generate entanglement. When analyzing the entangling power of this unitary, we can always ignore these product unitaries and turn to consider the non-product subsystems of this unitary. For example, from Definition 4, the entangling power of a unitary is equal to that of a smaller unitary as no entanglement is generated by the last subsystems.
As is shown in TABLE 1, a genuine -qubit () unitary is classified into five categories based on its singular number. It is defined as the number of local singular operators in the unique Schmidt decomposition in shen2022class . We obtain the entangling power of the -partite unitary whose singular number is equal to , respectively.
Proposition 17
Suppose is a Schmidt-rank-two -qubit () unitary with singular number in TABLE 1, for . Then has the entangling power as follows.
(i) For or , we assume that is the -th smallest elsment in the set . Then
(14) | |||||
where .
(ii) For , we assume that is the -th smallest element in the set . Then
(15) | |||||
where with , and .
(iii) For or , we assume that is the -th smallest element in the set . Then
(16) | |||||
where with .
We show the results of Proposition 17 in FIG. 1 and 2. In detail, we show results (i) and (iii) in FIG. 1, and result (ii) in FIG. 2. From FIG. 1, one can see that the value of reaches the maximum, i.e. one, when both and approach , and tends to be the minimum, i.e. zero, when or approach or . When (real line) or (dashed line), approaches , which is merely determined by . Besides, one can obtain that the value of reaches the maximum, i.e. one, when , or , . Besides, approaches the minimum, zero, when or approach 0 or , or both of them approach . When (real line) or (dashed line), the entangling power of approaches that of .
From FIG. 2, the value of is shown regarding to the parameters . From the proof of Proposition 17, have the same effect on . Without loss of generality, we set with such that we can observe the value of clearly. First we show the value of regarding . From the first plane on the left, one can see that the minimum of approaches zero for . The minimum of increases until reaches , where for any , shown in the third plane. After that, the minimum of decreases with the increase of , shown by the fifth to seventh planes. Besides, the maximum of remains one for any . Second, we show the value of for a fixed and variable . The value of reaches the maximum, i.e. one, when both and approach , and tends to be the minimum, i.e. zero, when or approach or .



We show the assisted entangling power of some Schmidt-rank-two multi-qubit unitaries by Propositions 8 and 17. Here the assisted entangling power reaches the maximum.
Proposition 18
Suppose is a Schmidt-rank-two -qubit () unitary with singular number in TABLE 1, for . Then the assisted entangling power of reaches the maximum, i.e. one ebit if and only if
(i) For or , we assume that is the -th smallest element in the set . It holds that , and .
(ii) For , we assume that is the -th smallest element in the set . It holds that and , for , or there is a such that .
(iii) For or , we assume that is the -th smallest element in the set . It holds that , for and .
Proof.
Proposition 18 shows the necessary and sufficient condition that the Schmidt-rank-two multi-qubit assisted entangling power reaches the maximum. Many well-known multi-qubit universal quantum gates are included in Proposition 16, such as the -qubit Toffoli gate, -qubit controlled-controlled z gate, and the generalized CNOT gate proposed in lcly20160808 etc. In general, the multipartite assisted entangling of an arbitrary unitary operation is still an open problem.
V Entangling and assisted entangling power of Widely-used multi-qubit unitaries
In this section we consider the entangling power of two types of multi-qubit unitary gates, namely Toffoli gates and Fredkin gates. We show that the entangling and assisted entangling power of a -qubit Fredkin gate is equal to one ebit, regardless of the number of controlling parties. As for the Fredkin gate, we show that the entangling power of three-qubit Fredkin gate is equal to two ebits, and conjecture that the entangling power of four-qubit Fredkin gate may also be equal to two ebits.
The Toffoli gate or controlled-controlled-NOT gate is a three-qubit gate. Its circuit representation is shown in FIG. 3. Toffoli gate is a kind of universal reversible gate. This gate acts as follows: the two control bits are unchanged, i.e. and while the target bit is flipped if and only if the two control bits are set to 1, i.e. . The expression of the three-qubit Toffoli gate is given by
(17) |
Note that the controlled-controlled z (CCZ) gate, a special case for the controlled-controlled phase (CCP) gate,
for is equivalent to the Toffoli gate up to local unitaries. Their entangling power is obtained as they are Schmidt-rank-two unitaries with singular number equal to . From (i) in Proposition 17, the entangling power of a CCP gate is equal to with . In particular, by choosing , the CCZ and Toffoli gate is equal to one ebit, which is the maximal of gate.
In general, we may consider the entangling power of a -qubit Toffoli gate , namely
(18) |
By Proposition 17, it can be obtained that the entangling power of is also one ebit, which will not increase with the number of controlling parties. This derives the following fact.
Proposition 19
The entangling and assisted entangling power of a -qubit Toffoli gate is equal to one ebit.
\Qcircuit@C=0.8em @R=1.5em
\lstick—a⟩ &\qw\ctrl2\qw\qw \qw\ctrl1 \qw\qw
\lstick—b⟩ \qw\ctrl1\qw\qw \qw\qswap\qw\qw
\lstick—c⟩ \qw\targ\qw\qw \qw\qswap\qwx\qw\qw
The Fredkin gate, or controlled-swap gate, is another universal reversible gate, whose circuit representation is shown in FIG. 3. This gate swaps the input bits and if and only if the control bit is set to 1. The expression of the three-qubit Fredkin gate is given by
(19) |
where is the two-qubit swap gate. Next we consider the entangling power of the Fredkin gate acting on , and obtain the following.
Proposition 20
The entangling power of a three qubit Fredkin gate is equal to two ebits.
Proof.
Since system is symmetric with system here, it suffices to consider the bipartition and .
First we consider the entanglement generation . Obviously can be controlled from system . From Proposition 9 and Lemma 13, the entanglement generation can be derived by removing the ancilla , that is,
(20) | |||||
Since is controlled by two terms from system , we have (ebit). By choosing and , one has (ebit). Hence .
Next we consider the entanglement generation . From the Schmidt decomposition of Fredkin gate under the bipartition , one can see that . Next we choose and . Then . We have . Hence one can obtain that
This completes the proof.
Next we consider the entangling power of , where for the SWAP gate ,
Due to the symmetry of subsystems, it suffices to consider four cases with respect to the bipartition.
Case 1: We analyze the bipartition or , where . We merely consider the bipartition . By this bipartition, one can see that and hence . On the other hand, we have
We choose and . Then . To conclude, we have (ebit).
Case 2: We analyze the bipartition or , where . It can be obtained that . Next we consider the bipartition . By choosing the input state as , . One can obtain that
Therefore, we obtain that (ebits).
Case 3: We analyze the bipartition . By this bipartition, is a controlled unitary and it is controlled with two terms. Here systems are the controller. From Lemma 13, one has
By choosing the input state and , one has (ebit). Obviously it reached the maximum. Hence we have (ebit).
We shall emphasize that the analysis in Case 1-3 can be extended to a -qubit Fredkin gate. Next we consider the last bipartition.
Case 4: We consider the entanglement generation or equivalently, . The Schmidt decomposition of with respect to the bipartition shows that and thus (ebits). On the other hand, we can choose an input state such that (ebits). Hence we have , namely . Further we conjecture that by numerical results and thus have the following.
Conjecture 21
The entanglement generation . Hence the entangling power of a four-qubit Fredkin gate is equal to two ebits.
In order to prove this conjecture, we may choose the input states as
up to local unitaries. The subadditivity of von Neumann entropy may also be used. The entangling power of a -qubit Fredkin gate remains to be an open problem.
VI Conclusion
In summary, we have introduced the definition of the entangling power of multipartite nonlocal unitary operations. We have shown that the entangling, assisted entangling and disentangling power are assumed by an input state by some facts in functional analysis. The entangling power of Schmidt-rank-two multi-qubit unitary operations has been analytically derived. The necessary and sufficient condition that the assisted entangling power of Schmidt-rank-two multi-qubit unitary operations reaches the maximum has been given. Further the entangling and assisted entangling power of the most widely-used multi-qubit unitary gates including Toffoli and Fredkin gates have also been investigated.
Many problems arising from this paper can be further explored. The entangling power of multipartite unitary operation that is controlled with more than two terms may be derived by the investigation between von Neumann entropy and the reduced density matrix of the controlled systems. Besides, the entangling power of multipartite unitary operations with Schmidt rank more than two remains to be analyzed. This may be obtained by the canonical form of such unitary operations. Some interesting problems concerning this problem remain to be analyzed, such as Conjecture 21. As a harder problem, the analytical results of the multipartite assisted entangling power of an arbitrary unitary operation remains to be investigated.
ACKNOWLEDGMENTS
Authors were supported by the NNSF of China (Grant No. 12471427).
Appendix A Proof of properties of entangling, assisted entangling and disentangling power
Here we show the proof of Lemma 6.
Proof.
(i) Let denote the set consisting of all density operators of -dimensional -partite pure states. So is a subset of the normed space . From (1) in Theorem 1, it suffices to prove that is bounded and closed. Obviously is bounded, as satisfies for . In order to show that is closed under the distance induced by , we need to show that all the accumulation points of belong to . We consider a sequence of -partite pure states , where satisfies that exists for all . That is, , where with . From the identity we obtain that and . It implies that if and then . So is closed under .
(ii) Suppose is a subset of this normed space consisting of all density operators of -dimensional -partite product states. In order to obtain that is compact, it suffices to show its boundedness and closeness. Any satisfies and thus is bounded. We show that is closed under . Consider a sequence of bipartite product states , with where exist for all . That is, , where with and . From the identity with and , we obtain that and . Hence, , which implies that is closed under for . Using Theorem 1, is a compact subset of the normed space .
The proof of Proposition 8 is shown below.
Proof.
(i) By the definition of , it is derived by taking the maximum over all possible bipartition and the supreme of all pure states. As the bipartite cuts has finite kinds, the maximum can be reached by one of the bipartition, namely . It suffices to show that the supreme can be reached by this bipartition . Without loss of generality, we treat this multipartite unitary as a bipartite one, i.e. .
We consider the normed space , where is the set of bipartite operators given by with . Lemma 6 shows that all density operators of -dimensional bipartite pure states form a compact subset of this normed space. Next we consider the following mapping
(21) |
where , is a bipartite unitary. From Theorem 3, if is a continuous mapping of then the assertion is proved. It suffices to show that is continuous at every point . For every , we show the existence of a such that for all satisfying . In detail, for above , there are and some points satisfying , where the equality follows from the unitary invariance of trace norm. Since the trace norm is non-increasing under the action of partial trace, it holds that . Using triangle inequality and Fannes’ inequality of von Neumann entropy nielsen2000quantum , one can obtain that
where . Since , for above , there is a such that for all satisfying . We can always find a such that
(22) | |||||
(23) |
for all satisfying . Here the first inequality follows from and Fannes’ inequality. The second inequality comes from , i.e. and . Hence, the mapping is continuous by Definition 2. From Theorem 3, the continuous mapping assumes a maximum at some points of compact subset .
(ii) The assertion is obtained by replacing the unitary in (i) by . This completes the proof.
Below we show the proof of Proposition 9.
Proof.
As the proof of Proposition 8, it suffices to consider the multipartite unitary under the bipartition . In the normed space defined above, we consider a subset consisting of all density operators of -dimensional bipartite pure product states. In Lemma 6, we have shown that is a compact subset of this normed space. On the other hand, similar to the proof of Proposition 8, we can prove that is a continuous mapping of for any bipartite unitary , where for ,
(24) |
From Theorem 3, the continuous mapping assumes a maximum at some points of compact subset .
Appendix B Proof of preliminary lemmas of Schmidt-rank-two bipartite unitary entangling power
The proof of Lemma 10 is shown here.
Proof.
Geometrically, stands for a point on the unit circle in the complex plane. The minimization can be transformed to the minimum distance between the original point and convex hull of , denoted by . In the complex plane, is expressed as a -polygon and its interior, whose vertices belong to . If the original point , the minimum distance is equal to zero; otherwise the distance is equal to the minimum distance between and each side of , i.e. . The two cases are shown in FIG 4.

So it suffices to consider when the original point belongs to . In fact, boundary situations should be considered, where one of the edges of this -polygon becomes the diameter of unit circle. In the boundary situations, the point is on one of the edges of this polygon. One can obtain that the boundary situations are depicted by with and . They are shown in FIG. 5. One can see that if and only if all edges of the polygon are not on the same half of unit circle. That is and , for . This completes the proof.

Here we show the proof of Lemma 11.
Proof.
(i) If then the equality in (9) holds. Next we assume that is a proper subset of . Up to the subscript permutation, we can assume that with . As the proof of Lemma 10, we consider the polygon corresponding to and , and denote them by and , respectively. Since , is obtained by adding some points with to . Then the minimum distance between and is not less than that between and . As above, the minimization in (9) can be transformed to the minimum distance between the original point and (resp. ). This completes the proof.
(ii) The assertion can be proved in the same way as (i).
The proof of Lemma 13 is presented below.
Proof.
We show the case for , others can be proved in a similar way. For convenience of statement, one can further assume that , where ’s are diagonal unitaries. Without loss of generality, we assume that the orthogonal projectors , where , and for . Since , the unitaries satisfy with .
We show the derivation of the equality in (11). Suppose is the critical state such that , where , and . From , we obtain that
Hence, the ancilla can be removed.
The equality in (12) is obtained by choosing with and . From with for , we have
(26) | |||||
where and hence , . This complets the proof.
Appendix C Analytical derivation of multi-qubit Schmidt rank two unitary operations
We present the proof of Proposition 15 below.
Proof.
From cy13 can be controlled from every subsystem. Combined with Definition 4, Proposition 9 and Lemma 13, the entangling power of is given by
First we consider the the maximal entanglement generation of under the bipartition . From Lemma 13, we have
(28) | |||
where , and , as we can choose an appropriate local unitary acting on . Besides, there exists a unitary acting on whose first row is the transpose of . For convenience, we denote by , respectively. We obtain that
(29) | |||||
where the second equality follows from for and . Hence and . Without loss of generality, one can assume that for , and . Using Lemma 10, we have
(30) | |||||
where with .
Next we consider and . First we rewrite in the form that is the control with terms. By exchanging the system of , we obtain that
(31) | |||||
(32) | |||||
Then by the same analysis as , we obtain and . By taking maximization over the three bipartition, we complete the proof.
Here we show the Proof of Proposition 17.
Proof.
We analyze the entangling power of with respect to , respectively. Here the unitary with or is analyzed in case (i); is analyzed in case (ii); or 0 is analyzed in case (iii).
(i) The Schmidt decomposition of a unitary whose singular number is given as
(33) |
In order to analyze the entangling power of , we should take the maximal entanglement generation across any bipartition by Definition 4 and Proposition 9, that is,
(34) | |||||
Across any bipartition , the unitary can be treated as a bipartite unitary. It has been shown that either party of this unitary can be chosen as control in cy13 . From Lemma 14, the ancilla of each system can be removed. Note that is symmetric on all systems , that is, the expression of is the same up to the permutation of systems. Due to the symmetry of , it suffices to consider types of bipartition, i.e. and for . With this bipartition, we write in the form of two-term control as follows
If we exchange the systems and of this unitary, then the entanglement generation remains the same. Therefore, we analyze the entanglement generation of by choosing either or as the control and will obtain the same result. Using Lemma 12, we choose as the control and obtain that for ,
for . Hence, the entangling power of is give as follows. For ,
(35) | |||||
When a unitary with the singular number , its Schmidt decomposition is given as
(36) |
with and . The unitary is symmetric except for the last system . By some observations, it can be obtained that when the system is not performed as one system of the control under a proper bipartition, the unitary can always be written in the form of two-term control. Since the systems are symmetric, it suffices to analyze the entangling power of this unitary under the bipartition and for and choose as the control. Then can be given by
It is worth mentioning that choosing as the control to analyze the entangling power is without loss of generality, as the entangling generation remains the same when we exchange the two systems, i.e., . We assume that and . Then we obtain the entangling power of as follows
where .
(ii) A unitary with the singular number is given as, for ,
The systems of are not symmetric. In order to obtain the entangling power of , all kinds of bipartition of it should be taken into account.
First, we show the expression of a kind of bipartition, i.e. and for . Without loss of generality, we choose the control as . Then is controlled with two terms as follows
(38) | |||||
where for (resp. ). Performing a local unitary on , we obtain a unitary
(39) | |||||
By the locally unitary invariance of von Neumann entropy, . Suppose with is the set consisting of the phases of all diagonal elements of the unitary . We rearrange the elements of in the ascending order and denote the -th smallest element in this set by , for . That is,
(40) | |||||
By the same analysis as in Lemma 12, the entanglement generation of under this bipartition is
(41) | |||||
where , and with . Next we compare over the bipartition with . We claim that is non-increasing with respect to . In fact, one can obtain that
(42) |
From (39), (resp. ) by the bipartition (resp. ). Hence the set in (40) satisfies . We denote the minimum convex sum of by . Then we have
(43) | |||||
where the first and third equality follows from (10), and the second equality is derived by and Lemma 11. By now we have proven (42). From (42), we obtain that
(44) |
Therefore, in order to consider the maximal entanglement generation under the bipartition , we can only consider the bipartition . Let . By choosing in (41), one has the entanglement generation over as
(45) | |||||
where , and with .
Next we consider other bipartition , where . As we have shown in (44), the fewer systems working as the control under the bipartition there are, the larger the entangling power will be. Hence the maximal entanglement generation is reached when a single system works as the control, across any bipartition . In summary, the entangling power of in (C) is obtained by taking the maximization over the following types of bipartition, that is,
We write in (C) in the form that the system is the control with , i.e.
which is locally unitarily equivalent to
with respect to the bipartition . From Lemma 12 and (C), we obtain that for ,
(47) | |||||
for . We have shown the case by (45) and by (47). Then we obtain the entangling power of the unitary . Hence the equality (15) holds for .
(iii) A -qubit unitary with singular number is given by
with . The unitary is symmetric except for the first system. We can merely analyze the entanglement generation under the bipartition and for . Under this bipartition, the unitary is given as
Note that is either odd or even. Based on its value, we divide the set of POVMs of systems into two subsets. That is,
(50) | |||
Obviously, and is orthogonal to . From (C)-(C), one can obtain that
(52) |
where the unitaries
Obviously, is locally unitarily equivalent to
From (C) and (C), the diagonal elements of are . Let the set . From Lemma 12, we obtain the entangling power of as follows
(56) |
where .
When the singular number , the unitary is written as
(57) | |||||
with . By similar analysis as for , the unitary is written in the form of two-term control, across the bipartition and as follows
(58) |
where in (C) and (C) with , and
The unitary is locally equivalent to
The diagonal elements of are . Let . From Lemma 12, we obtain the entangling power of shown in (16). This completes the proof.
References
- [1] Bennett and Wiesner. Communication via one- and two-particle operators on einstein-podolsky-rosen states. Phys. Rev. Lett, 69(20):2881–2884, 1992.
- [2] Xinyu Qiu and Lin Chen. Quantum cost of dense coding and teleportation. Phys. Rev. A, 105:062451, 2022.
- [3] J. I. Cirac, A. K. Ekert, S. F. Huelga, and C. Macchiavello. Distributed quantum computation over noisy channels. Phys. Rev. A, 59:4249–4254, Jun 1999.
- [4] Marcus Cramer, Martin B Plenio, Steven T Flammia, Rolando Somma, and Yi Kai Liu. Efficient quantum state tomography. Nature Communications, 1(9):149, 2010.
- [5] Xiao-Min Hu, Cen-Xiao Huang, Yu-Bo Sheng, Lan Zhou, Bi-Heng Liu, Yu Guo, Chao Zhang, Wen-Bo Xing, Yun-Feng Huang, Chuan-Feng Li, and Guang-Can Guo. Long-distance entanglement purification for quantum communication. Phys. Rev. Lett., 126:010503, Jan 2021.
- [6] Xinyu Qiu, Lin Chen, and Li-Jun Zhao. Quantum wasserstein distance between unitary operations. Phys. Rev. A, 110:012412, Jul 2024.
- [7] Paolo Zanardi, Christof Zalka, and Lara Faoro. Entangling power of quantum evolutions. Phys. Rev. A, 62:030301, Aug 2000.
- [8] Xiaoguang Wang and Paolo Zanardi. Quantum entanglement of unitary operators on bipartite systems. Phys. Rev. A, 66:044303, Oct 2002.
- [9] Alioscia Hamma and Paolo Zanardi. Quantum entangling power of adiabatically connected hamiltonians. Phys. Rev. A, 69:062319, Jun 2004.
- [10] Marcin Musz, Marek Kus, and Karol Zyczkowski. Unitary quantum gates, perfect entanglers and unistochastic maps. Phys. Rev. A, 87(2):022111, 2013.
- [11] Michael A. Nielsen, Christopher M. Dawson, Jennifer L. Dodd, Alexei Gilchrist, Duncan Mortimer, Tobias J. Osborne, Michael J. Bremner, Aram W. Harrow, and Andrew Hines. Quantum dynamics as a physical resource. Phys. Rev. A, 67:052301, May 2003.
- [12] Lin Chen and Li Yu. Entangling and assisted entangling power of bipartite unitary operations. Phys. Rev. A, 94:022307, Aug 2016.
- [13] Lin Chen and Li Yu. Entanglement cost and entangling power of bipartite unitary and permutation operators. Phys. Rev. A, 93:042331, Apr 2016.
- [14] Yi Shen and Lin Chen. Entangling power of two-qubit unitary operations. Journal of Physics A: Mathematical and Theoretical, 51(39):395303, aug 2018.
- [15] Sirui Cao, Bujiao Wu, Fusheng Chen, Ming Gong, Yulin Wu, Yangsen Ye, Chen Zha, Haoran Qian, Chong Ying, Shaojun Guo, Qingling Zhu, He-Liang Huang, Youwei Zhao, Shaowei Li, Shiyu Wang, Jiale Yu, Daojin Fan, Dachao Wu, Hong Su, Hui Deng, Hao Rong, Yuan Li, Kaili Zhang, Tung-Hsun Chung, Futian Liang, Jin Lin, Yu Xu, Lihua Sun, Cheng Guo, Na Li, Yong-Heng Huo, Cheng-Zhi Peng, Chao-Yang Lu, Xiao Yuan, Xiaobo Zhu, and Jian-Wei Pan. Generation of genuine entanglement up to 51 superconducting qubits. Nature, 619(7971):738–742, 2023.
- [16] Simon J. Evered, Dolev Bluvstein, Marcin Kalinowski, Sepehr Ebadi, Tom Manovitz, Hengyun Zhou, Sophie H. Li, Alexandra A. Geim, Tout T. Wang, Nishad Maskara, Harry Levine, Giulia Semeghini, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin. High-fidelity parallel entangling gates on a neutral-atom quantum computer. Nature, 622(7982):268–272, 2023.
- [17] D. P. Nadlinger, P. Drmota, B. C. Nichol, G. Araneda, D. Main, R. Srinivas, D. M. Lucas, C. J. Ballance, K. Ivanov, E. Y. Z. Tan, P. Sekatski, R. L. Urbanke, R. Renner, N. Sangouard, and J. D. Bancal. Experimental quantum key distribution certified by bell’s theorem. Nature, 607(7920):682–686, 2022.
- [18] D. P. Nadlinger, P. Drmota, B. C. Nichol, G. Araneda, D. Main, R. Srinivas, D. M. Lucas, C. J. Ballance, K. Ivanov, E. Y. Z. Tan, P. Sekatski, R. L. Urbanke, R. Renner, N. Sangouard, and J. D. Bancal. Experimental quantum key distribution certified by bell’s theorem. Nature, 607(7920):682–686, 2022.
- [19] Xin Wang, Edwin Barnes, and S. Das Sarma. Improving the gate fidelity of capacitively coupled spin qubits. npj Quantum Information, 1(1):15003, 2015.
- [20] Harry Levine, Alexander Keesling, Giulia Semeghini, Ahmed Omran, Tolut T. Wang, Sepehr Ebadi, Hannes Bernien, Markus Greiner, Vladan Vuletić, Hannes Pichler, and Mikhail D. Lukin. Parallel implementation of high-fidelity multiqubit gates with neutral atoms. Phys. Rev. Lett., 123:170503, Oct 2019.
- [21] A. J. Scott. Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions. Phys. Rev. A, 69:052330, May 2004.
- [22] Jianxin Chen, Zhengfeng Ji, David W Kribs, Bei Zeng, and Fang Zhang. Minimum entangling power is close to its maximum. Journal of Physics A: Mathematical and Theoretical, 52(21):215302, apr 2019.
- [23] Tomasz Linowski, Grzegorz Rajchel-Mieldzioć, and Karol Życzkowski. Entangling power of multipartite unitary gates. Journal of Physics A: Mathematical and Theoretical, 53(12):125303, 2020.
- [24] Masanori Ohya and Dénes Petz. Quantum Entropy and Its Use. 01 1995.
- [25] Zhiwei Song, Lin Chen, Yize Sun, and Mengyao Hu. Proof of a conjectured 0-rényi entropy inequality with applications to multipartite entanglement. IEEE Transactions on Information Theory, 69(4):2385–2399, 2023.
- [26] Paul Boes, Jens Eisert, Rodrigo Gallego, Markus P. Müller, and Henrik Wilming. Von neumann entropy from unitarity. Phys. Rev. Lett., 122:210402, May 2019.
- [27] Benjamin Schumacher. Quantum coding. Phys. Rev. A, 51:2738–2747, Apr 1995.
- [28] A. Winter. Coding theorem and strong converse for quantum channels. IEEE Transactions on Information Theory, 45(7):2481–2485, 1999.
- [29] M. S. Leifer, L. Henderson, and N. Linden. Optimal entanglement generation from quantum operations. Phys. Rev. A, 67:012306, Jan 2003.
- [30] Yi Shen, Lin Chen, and Li Yu. Classification of schmidt-rank-two multipartite unitary gates by singular number. Journal of Physics A: Mathematical and Theoretical, 55(46):465302, nov 2022.
- [31] M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2000.
- [32] Scott M. Cohen and Li Yu. All unitaries having operator Schmidt rank 2 are controlled unitaries. Phys. Rev. A, 87:022329, Feb 2013.