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:2302.06574 · Physical Review A

Hierarchies among genuine multipartite entangling capabilities of quantum gates

Mrinmoy Samanta, Sudipta Mondal, Samir Kumar Hazra, Aditi Sen (De)

Published Dec 12, 2025• 2 citations
arXivHTMLPDF

Abstract

We classify quantum gates according to their capability to generate genuine multipartite entanglement (GME), using a hierarchy based on multipartite separable states. In particular, when a fixed unitary operator acts on the set of k-separable states, the maximal genuine multipartite entanglement content produced via that particular unitary operator is determined after maximizing over the set of k-separable input states. We identify unitary operators that are beneficial for generating high GME when the input states are entangled in some bipartition, although the picture can also be reversed, where such initial entanglement offers no advantage. We investigate the maximum entangling power of a broad range of unitary operators, encompassing special classes of quantum gates, as well as diagonal, permutation, and Haar-uniformly generated unitaries by computing generalized geometric measure (GGM) as a GME quantifier. Additionally, we observe a notable distinction in entangling power based on the nature of the input states: when maximization is restricted to separable states with real coefficients, the entangling power is lower than when the optimization is carried out over arbitrary separable states with complex coefficients, thereby highlighting the role of complex amplitudes in entanglement creation. Furthermore, we determine which unitary operators, along with their corresponding optimal inputs, yield output states with the highest achievable GGM.

DOI
10.1103/vhvd-jbnk

Related papers

Circulating genuine multiparty entanglement in a quantum network

Pritam Halder, Ratul Banerjee, Srijon Ghosh +2 more

We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures---we refer to it as entanglement circulation. The procedure involves optimization over a set of two-qubit arbitrary unitary operators and the entanglement of the initial resource state. We report that the set of unitary operators that maximize the genuine multipartite entanglement quantified via generalized geometric measure (GGM) is not unique. We prove that the GGM of the resulting state of arbitrary qubits coincides with the minimum GGM of the initial resource states. By fixing the output state as the six-qubit one, we find the optimal way to create such states according to the available resource. Moreover, we show that the method proposed here can be implemented by using logic gates, or by using the time dynamics of realizable spin Hamiltonians. In case of an ordered system, GGM varies periodically with time while the evolution via disordered models lead to a low but constant multipartite entanglement in outputs at a critical time, which decreases exponentially with the increase of the strength of the disorder.

arXiv:2112.10122•Physical Review A•Sep 6, 2022•9 citations

Minimal Subsystems for Characterizing Genuine Multipartite Entanglement

Shashank Shekhar, Siddhartha Santra

Genuine multipartite entanglement (GME) is a valuable resource for quantum technologies, but quantifying it in many-body systems can be demanding since measures defined through optimizations over bipartitions are often assumed to require large joint measurements and many measurement settings. We introduce the concepts of GME evaluation length and GME evaluation number, which capture, respectively, the largest subsystem that must be jointly measured and the number of distinct subsystems that need to be measured to evaluate multipartite entanglement measures defined via bipartition optimizations. Taking the genuine multipartite concurrence (GMC) as a canonical example, we show that, for $N$-qubit Haar-random pure states, the GMC can be evaluated using only $N$ single-qubit purity measurements. Thus, for typical many-body states, evaluating the GMC requires considering only the $N$ single-site bipartitions, rather than the exponentially many distinct bipartitions. We further corroborate this behavior numerically for physically accessible states generated by local random quantum circuits. Our results show that the practical cost of quantifying GME can be dramatically lower than suggested by its formal definition, establishing measurement complexity as a complementary operational lens for multipartite entanglement.

quant-pharXiv:2610.16215•Oct 13, 2026•0 citations

Genuine multipartite entanglement of quantum states in the multiple-copy scenario

Carlos Palazuelos, Julio I. de Vicente

Genuine multipartite entanglement (GME) is considered a powerful form of entanglement since it corresponds to those states that are not biseparable, i.e. a mixture of partially separable states across different bipartitions of the parties. In this work we study this phenomenon in the multiple-copy regime, where many perfect copies of a given state can be produced and controlled. In this scenario the above definition leads to subtle intricacies as biseparable states can be GME-activatable, i.e. several copies of a biseparable state can display GME. We show that the set of GME-activatable states admits a simple characterization: a state is GME-activatable if and only if it is not partially separable across one bipartition of the parties. This leads to the second question of whether there is a general upper bound in the number of copies that needs to be considered in order to observe the activation of GME, which we answer in the negative. In particular, by providing an explicit construction, we prove that for any number of parties and any number k∈N there exist GME-activatable multipartite states of fixed (i.e. independent of k ) local dimensions such that k copies of them remain biseparable.

arXiv:2201.08694•Quantum•Jun 13, 2022•58 citations

Disparity between multipartite entangling and disentangling powers of unitaries: Even vs Odd

Samanta, Mrinmoy, Mondal, Sudipta, Aditi Sen De

We compare the multipartite entangling and disentangling powers of unitary operators by assessing their ability to generate or eliminate genuine multipartite entanglement. Our findings reveal that while diagonal unitary operators can exhibit equal entangling and disentangling powers, certain non-diagonal unitaries demonstrate an imbalance when acting on fully separable states, thereby extending the known disparity from bipartite systems to those with any number of parties. Counterintuitively, we construct classes of unitaries and their adjoints that display unequal entanglement generation capacities, behaving differently when applied to systems with an even number of qubits compared to those with an odd number. Further, we illustrate that this asymmetry can be simulated using physically realizable Hamiltonians: systems with an even number of qubits employ nearest-neighbor Dzyaloshinskii-Moriya (DM) interactions, while those with an odd number utilize a combination of Heisenberg and DM interactions. Additionally, we present a circuit composed of random noncommuting unitaries, constructed from alternating layers of two-qubit Haar-random gates, to illustrate the discrepancy in the entangling and disentangling capabilities of unitaries.

arXiv:2505.18539•May 24, 2025•1 citation

Concurrence triangle induced genuine multipartite entanglement measure

Zhi‐Xiang Jin, Yuan-Hong Tao, Yaoting Gui +3 more

We study the quantification of genuine multipartite entanglement (GME) for general multipartite states. A set of inequalities satisfied by the entanglement of N-partite pure states is derived by exploiting the restrictions on entanglement distributions, showing that the bipartite entanglement between each part and its remaining ones cannot exceed the sum of the other partners with their remaining ones. Then a series of triangles, named concurrence triangles, are established corresponding to these inequalities. Proper genuine multipartite entanglement measures are thus constructed by using the geometric mean area of these concurrence triangles, which are non-increasing under local operation and classical communication. The GME measures classify which parts are separable or entangled with the rest ones for non genuine entangled pure states. The GME measures for mixed states are given via the convex roof construction, and a witness to detect the GME of multipartite mixed states is presented by an approach based on state purifications. Detailed examples are given to illustrate the effectiveness of our GME measures.

arXiv:2212.07067•Results in Physics•Dec 6, 2022•31 citations

Quantifying Entangling Power of Controlled Unitary Gates

Ankur Haldar, Pankaj Agrawal, Prasenjit Deb

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.

quant-pharXiv:2608.21105•Aug 24, 2026•0 citations
We classify quantum gates according to their capability to generate genuine multipartite entanglement (GME), using a hierarchy based on multipartite separable states. In particular, when a fixed unitary operator acts on the set of k-separable states, the maximal genuine multipartite entanglement content produced via that particular unitary operator is determined after maximizing over the set of k-separable input states. We identify unitary operators that are beneficial for generating high GME when the input states are entangled in some bipartition, although the picture can also be reversed, where such initial entanglement offers no advantage. We investigate the maximum entangling power of a broad range of unitary operators, encompassing special classes of quantum gates, as well as diagonal, permutation, and Haar-uniformly generated unitaries by computing generalized geometric measure (GGM) as a GME quantifier. Additionally, we observe a notable distinction in entangling power based on the nature of the input states: when maximization is restricted to separable states with real coefficients, the entangling power is lower than when the optimization is carried out over arbitrary separable states with complex coefficients, thereby highlighting the role of complex amplitudes in entanglement creation. Furthermore, we determine which unitary operators, along with their corresponding optimal inputs, yield output states with the highest achievable GGM.
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures---we refer to it as entanglement circulation. The procedure involves optimization over a set of two-qubit arbitrary unitary operators and the entanglement of the initial resource state. We report that the set of unitary operators that maximize the genuine multipartite entanglement quantified via generalized geometric measure (GGM) is not unique. We prove that the GGM of the resulting state of arbitrary qubits coincides with the minimum GGM of the initial resource states. By fixing the output state as the six-qubit one, we find the optimal way to create such states according to the available resource. Moreover, we show that the method proposed here can be implemented by using logic gates, or by using the time dynamics of realizable spin Hamiltonians. In case of an ordered system, GGM varies periodically with time while the evolution via disordered models lead to a low but constant multipartite entanglement in outputs at a critical time, which decreases exponentially with the increase of the strength of the disorder.
Genuine multipartite entanglement (GME) is a valuable resource for quantum technologies, but quantifying it in many-body systems can be demanding since measures defined through optimizations over bipartitions are often assumed to require large joint measurements and many measurement settings. We introduce the concepts of GME evaluation length and GME evaluation number, which capture, respectively, the largest subsystem that must be jointly measured and the number of distinct subsystems that need to be measured to evaluate multipartite entanglement measures defined via bipartition optimizations. Taking the genuine multipartite concurrence (GMC) as a canonical example, we show that, for NNN-qubit Haar-random pure states, the GMC can be evaluated using only NNN single-qubit purity measurements. Thus, for typical many-body states, evaluating the GMC requires considering only the NNN single-site bipartitions, rather than the exponentially many distinct bipartitions. We further corroborate this behavior numerically for physically accessible states generated by local random quantum circuits. Our results show that the practical cost of quantifying GME can be dramatically lower than suggested by its formal definition, establishing measurement complexity as a complementary operational lens for multipartite entanglement.
Genuine multipartite entanglement (GME) is considered a powerful form of entanglement since it corresponds to those states that are not biseparable, i.e. a mixture of partially separable states across different bipartitions of the parties. In this work we study this phenomenon in the multiple-copy regime, where many perfect copies of a given state can be produced and controlled. In this scenario the above definition leads to subtle intricacies as biseparable states can be GME-activatable, i.e. several copies of a biseparable state can display GME. We show that the set of GME-activatable states admits a simple characterization: a state is GME-activatable if and only if it is not partially separable across one bipartition of the parties. This leads to the second question of whether there is a general upper bound in the number of copies that needs to be considered in order to observe the activation of GME, which we answer in the negative. In particular, by providing an explicit construction, we prove that for any number of parties and any number k∈N there exist GME-activatable multipartite states of fixed (i.e. independent of k ) local dimensions such that k copies of them remain biseparable.
We compare the multipartite entangling and disentangling powers of unitary operators by assessing their ability to generate or eliminate genuine multipartite entanglement. Our findings reveal that while diagonal unitary operators can exhibit equal entangling and disentangling powers, certain non-diagonal unitaries demonstrate an imbalance when acting on fully separable states, thereby extending the known disparity from bipartite systems to those with any number of parties. Counterintuitively, we construct classes of unitaries and their adjoints that display unequal entanglement generation capacities, behaving differently when applied to systems with an even number of qubits compared to those with an odd number. Further, we illustrate that this asymmetry can be simulated using physically realizable Hamiltonians: systems with an even number of qubits employ nearest-neighbor Dzyaloshinskii-Moriya (DM) interactions, while those with an odd number utilize a combination of Heisenberg and DM interactions. Additionally, we present a circuit composed of random noncommuting unitaries, constructed from alternating layers of two-qubit Haar-random gates, to illustrate the discrepancy in the entangling and disentangling capabilities of unitaries.
We study the quantification of genuine multipartite entanglement (GME) for general multipartite states. A set of inequalities satisfied by the entanglement of N-partite pure states is derived by exploiting the restrictions on entanglement distributions, showing that the bipartite entanglement between each part and its remaining ones cannot exceed the sum of the other partners with their remaining ones. Then a series of triangles, named concurrence triangles, are established corresponding to these inequalities. Proper genuine multipartite entanglement measures are thus constructed by using the geometric mean area of these concurrence triangles, which are non-increasing under local operation and classical communication. The GME measures classify which parts are separable or entangled with the rest ones for non genuine entangled pure states. The GME measures for mixed states are given via the convex roof construction, and a witness to detect the GME of multipartite mixed states is presented by an approach based on state purifications. Detailed examples are given to illustrate the effectiveness of our GME measures.
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.