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

Formation of multipartite entanglement using random quantum gates

Yonatan Most, Yishai Shimoni, Ofer Biham

Published Aug 23, 2007• 15 citations
arXivHTMLPDF

Abstract

The formation of multipartite quantum entanglement by repeated operation of one- and two-qubit gates is examined. The resulting entanglement is evaluated using two measures: the average bipartite entanglement and the Groverian measure. A comparison is made between two geometries of the quantum register: a one-dimensional chain in which two-qubit gates apply only locally between nearest neighbors and a nonlocal geometry in which such gates may apply between any pair of qubits. More specifically, we use a combination of random single-qubit rotations and a fixed two-qubit gate such as the controlled-phase gate. It is found that in the nonlocal geometry the entanglement is generated at a higher rate. In both geometries, the Groverian measure converges to its asymptotic value more slowly than the average bipartite entanglement. These results are expected to have implications on different proposed geometries of future quantum computers with local and nonlocal interactions between the qubits.

DOI
10.1103/physreva.76.022328

Related papers

Optimal two-qubit gate for generation of random bipartite entanglement

Marko Žnidarič

We numerically study protocols consisting of repeated applications of two qubit gates used for generating random pure states. A necessary number of steps needed in order to generate states displaying bipartite entanglement typical of random states is considered. Numerics indicates that for a generic two qubit entangling gate the decay of purity is exponential with the decay time scaling as $\ensuremath{\sim}n$, implying that of order $\ensuremath{\sim}{n}^{2}$ steps are needed to reach random bipartite entanglement. We also numerically identify the optimal two qubit gate for which the convergence is the fastest. Perhaps surprisingly, applying the same good two qubit gate in addition to a random single qubit rotations at each step leads to a faster generation of entanglement than applying a random two qubit transformation at each step.

arXiv:quant-ph/0702240•Physical Review A•Jul 17, 2007•38 citations

Exact convergence times for generation of random bipartite entanglement

Marko Žnidarič

We calculate exact convergence times to reach random bipartite entanglement for various random protocols. The eigenproblem of a Markovian chain governing the process is mapped to a spin chain, thereby obtaining exact expression for the gap of the Markov chain for any number of qubits. For protocols coupling nearest-neighbor qubits and a controlled-NOT (CNOT) gate the mapping goes to the $XYZ$ model while for a U(4) gate it goes to an integrable $XY$ model. For coupling between a random pair of qubits the mapping is to an integrable Lipkin-Meshkov-Glick model. In all cases the gap scales inversely with the number of qubits, thereby improving on a recent bound [Phys. Rev. Lett. 98, 130502 (2007)].

arXiv:0809.0554•Physical Review A•Sep 22, 2008•72 citations

Efficient generation of random multipartite entangled states using time-optimal unitary operations

Antoni Borràs, A. P. Majtey, M. Casas

We review the generation of random pure states using a protocol of repeated two-qubit gates. We study the dependence of the convergence to states with Haar multipartite entanglement distribution. We investigate the optimal generation of such states in terms of the physical (real) time needed to apply the protocol, instead of the gate complexity point of view used in other works. This physical time can be obtained, for a given Hamiltonian, within the theoretical framework offered by the quantum brachistochrone formalism, the quantum analogue to the brachistochrone problem in classical mechanics [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006)]. Using an anisotropic Heisenberg Hamiltonian as an example, we find that different optimal quantum gates arise according to the optimality point of view used in each case. We also study how the convergence to random entangled states depends on different entanglement measures.

arXiv:0805.2070•Physical Review A•Aug 19, 2008•4 citations

Entanglement measures of bipartite quantum gates and their thermalization under arbitrary interaction strength

Bhargavi Jonnadula, Prabha Mandayam, Karol Życzkowski +1 more

Entanglement properties of bipartite unitary operators are studied via their local invariants, namely the entangling power e p and a complementary quantity, the gate typicality g t .We characterize the boundaries of the set K 2 representing all two-qubit gates projected onto the plane (e p , g t ) showing that the fractional powers of the SWAP operator form a parabolic boundary of K 2 , while the other bounds are formed by two straight lines.In this way, a family of gates with extreme properties is identified and analyzed.We also show that the parabolic curve representing powers of SWAP persists in the set K N for gates of higher dimensions (N > 2).Furthermore, we study entanglement of bipartite quantum gates applied sequentially n times, and we analyze the influence of interlacing local unitary operations, which model generic Hamiltonian dynamics.An explicit formula for the entangling power of a gate applied n times averaged over random local unitary dynamics is derived for an arbitrary dimension of each subsystem.This quantity shows an exponential saturation to the value predicted by the random matrix theory, indicating "thermalization" in the entanglement properties of sequentially applied quantum gates that can have arbitrarily small, but nonzero, entanglement to begin with.The thermalization is further characterized by the spectral properties of the reshuffled and partially transposed unitary matrices.

arXiv:1909.08139•Physical Review Research•Oct 23, 2020•28 citations

Quantifying the Operational Cost of Multipartite Entanglement

Francois Payn, Michele Minervini, Davide Girolami

Multipartite entanglement determines the strength and range of interactions in many-body quantum systems. Yet, it is hard to evaluate it, due to the complex structures of quantum states. Here, we introduce a generic method to quantify the k <= N-partite entanglement of an N-particle system, by maximizing an arbitrary bipartite entanglement measure within subsystems of size up to k. The resulting classification of multipartite states captures their experimental cost: creating a k-partite entangled state requires at least k-1 two-particle entangling gates. Further, we analytically calculate the newly defined k-partite entanglement of formation, which generalizes an important bipartite entanglement measure, in several classes of states, including the W states of any dimension.

quant-pharXiv:2602.04760•Feb 5, 2026•0 citations

Characterizing quantum dynamics using multipartite entanglement generation

Gaurav Rudra Malik, Rohit Kumar Shukla, S. Aravinda +1 more

Entanglement is a defining feature of many-body quantum systems and is an essential requirement for quantum computing. It is therefore useful to study physical processes which generate entanglement within a large system, as they maybe replicated for applications involving the said requirements in quantum information processing. A possible avenue to maximize entanglement generation is to rely on the phenomena of information scrambling, i.e. transport of initially localized information throughout the system. Here the rationale is that the spread of information carries with it an inherent capacity of entanglement generation. Scrambling greatly depends upon the dynamical nature of the system Hamiltonian, and the interplay between entanglement generation and information scrambling maybe investigated taking a chain of interacting spins on a one dimensional lattice. This system is analogous to an array of qubits and this relative simplicity implies that the resulting unitary dynamics can be efficiently simulated using present-day cloud based NISQ devices. In our present work, we consider such a spin model which is made up of nearest and next nearest neighbor XXZ Model, along with an introduced coupling term λ. This coupling term serves as a tuning parameter which modifies the dynamical nature of the system from the integrable to the quantum chaotic regime. In order to quantify the entanglement generated within the system we use the more general multipartite metric which computes the average entanglement across all system bipartitions to obtain a global picture of the entanglement structure within the entire system. Further to make our study initial state independent, we consider an ensemble of random initial states and evaluate the multipartite entanglement generated for each of these states under time evolution. We find clear differences in the entanglement measures as the system undergoes through different regimes. We also analyze the fluctuations present within our entanglement metric and find a distinct pattern as we head from the integrable to the chaotic regime.

arXiv:2505.10477•Jan 6, 2025•0 citations
The formation of multipartite quantum entanglement by repeated operation of one- and two-qubit gates is examined. The resulting entanglement is evaluated using two measures: the average bipartite entanglement and the Groverian measure. A comparison is made between two geometries of the quantum register: a one-dimensional chain in which two-qubit gates apply only locally between nearest neighbors and a nonlocal geometry in which such gates may apply between any pair of qubits. More specifically, we use a combination of random single-qubit rotations and a fixed two-qubit gate such as the controlled-phase gate. It is found that in the nonlocal geometry the entanglement is generated at a higher rate. In both geometries, the Groverian measure converges to its asymptotic value more slowly than the average bipartite entanglement. These results are expected to have implications on different proposed geometries of future quantum computers with local and nonlocal interactions between the qubits.
We numerically study protocols consisting of repeated applications of two qubit gates used for generating random pure states. A necessary number of steps needed in order to generate states displaying bipartite entanglement typical of random states is considered. Numerics indicates that for a generic two qubit entangling gate the decay of purity is exponential with the decay time scaling as $\ensuremath{\sim}n$, implying that of order $\ensuremath{\sim}{n}^{2}$ steps are needed to reach random bipartite entanglement. We also numerically identify the optimal two qubit gate for which the convergence is the fastest. Perhaps surprisingly, applying the same good two qubit gate in addition to a random single qubit rotations at each step leads to a faster generation of entanglement than applying a random two qubit transformation at each step.
We calculate exact convergence times to reach random bipartite entanglement for various random protocols. The eigenproblem of a Markovian chain governing the process is mapped to a spin chain, thereby obtaining exact expression for the gap of the Markov chain for any number of qubits. For protocols coupling nearest-neighbor qubits and a controlled-NOT (CNOT) gate the mapping goes to the XYZXYZXYZ model while for a U(4) gate it goes to an integrable XYXYXY model. For coupling between a random pair of qubits the mapping is to an integrable Lipkin-Meshkov-Glick model. In all cases the gap scales inversely with the number of qubits, thereby improving on a recent bound [Phys. Rev. Lett. 98, 130502 (2007)].
We review the generation of random pure states using a protocol of repeated two-qubit gates. We study the dependence of the convergence to states with Haar multipartite entanglement distribution. We investigate the optimal generation of such states in terms of the physical (real) time needed to apply the protocol, instead of the gate complexity point of view used in other works. This physical time can be obtained, for a given Hamiltonian, within the theoretical framework offered by the quantum brachistochrone formalism, the quantum analogue to the brachistochrone problem in classical mechanics [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006)]. Using an anisotropic Heisenberg Hamiltonian as an example, we find that different optimal quantum gates arise according to the optimality point of view used in each case. We also study how the convergence to random entangled states depends on different entanglement measures.
Entanglement properties of bipartite unitary operators are studied via their local invariants, namely the entangling power e p and a complementary quantity, the gate typicality g t .We characterize the boundaries of the set K 2 representing all two-qubit gates projected onto the plane (e p , g t ) showing that the fractional powers of the SWAP operator form a parabolic boundary of K 2 , while the other bounds are formed by two straight lines.In this way, a family of gates with extreme properties is identified and analyzed.We also show that the parabolic curve representing powers of SWAP persists in the set K N for gates of higher dimensions (N > 2).Furthermore, we study entanglement of bipartite quantum gates applied sequentially n times, and we analyze the influence of interlacing local unitary operations, which model generic Hamiltonian dynamics.An explicit formula for the entangling power of a gate applied n times averaged over random local unitary dynamics is derived for an arbitrary dimension of each subsystem.This quantity shows an exponential saturation to the value predicted by the random matrix theory, indicating "thermalization" in the entanglement properties of sequentially applied quantum gates that can have arbitrarily small, but nonzero, entanglement to begin with.The thermalization is further characterized by the spectral properties of the reshuffled and partially transposed unitary matrices.
Multipartite entanglement determines the strength and range of interactions in many-body quantum systems. Yet, it is hard to evaluate it, due to the complex structures of quantum states. Here, we introduce a generic method to quantify the k <= N-partite entanglement of an N-particle system, by maximizing an arbitrary bipartite entanglement measure within subsystems of size up to k. The resulting classification of multipartite states captures their experimental cost: creating a k-partite entangled state requires at least k-1 two-particle entangling gates. Further, we analytically calculate the newly defined k-partite entanglement of formation, which generalizes an important bipartite entanglement measure, in several classes of states, including the W states of any dimension.
Entanglement is a defining feature of many-body quantum systems and is an essential requirement for quantum computing. It is therefore useful to study physical processes which generate entanglement within a large system, as they maybe replicated for applications involving the said requirements in quantum information processing. A possible avenue to maximize entanglement generation is to rely on the phenomena of information scrambling, i.e. transport of initially localized information throughout the system. Here the rationale is that the spread of information carries with it an inherent capacity of entanglement generation. Scrambling greatly depends upon the dynamical nature of the system Hamiltonian, and the interplay between entanglement generation and information scrambling maybe investigated taking a chain of interacting spins on a one dimensional lattice. This system is analogous to an array of qubits and this relative simplicity implies that the resulting unitary dynamics can be efficiently simulated using present-day cloud based NISQ devices. In our present work, we consider such a spin model which is made up of nearest and next nearest neighbor XXZ Model, along with an introduced coupling term λ. This coupling term serves as a tuning parameter which modifies the dynamical nature of the system from the integrable to the quantum chaotic regime. In order to quantify the entanglement generated within the system we use the more general multipartite metric which computes the average entanglement across all system bipartitions to obtain a global picture of the entanglement structure within the entire system. Further to make our study initial state independent, we consider an ensemble of random initial states and evaluate the multipartite entanglement generated for each of these states under time evolution. We find clear differences in the entanglement measures as the system undergoes through different regimes. We also analyze the fluctuations present within our entanglement metric and find a distinct pattern as we head from the integrable to the chaotic regime.