Hierarchies among Genuine Multipartite Entangling Capabilities of Quantum Gates

• URL: http://arxiv.org/abs/2302.06574v3
• Date: Fri, 15 Aug 2025 07:53:51 GMT
• Title: Hierarchies among Genuine Multipartite Entangling Capabilities of Quantum Gates
• Authors: Mrinmoy Samanta, Sudipta Mondal, Samir Kumar Hazra, Aditi Sen De,
• Abstract summary: We classify quantum gates according to their capability to generate genuine multipartite entanglement (GME)<n>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.
• Score: 0.22499166814992438
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Higher-order transformations of bidirectional quantum processes [37.129018407842445]
  Bidirectional devices are devices for which the roles of the input and output ports can be exchanged.<n>Recently, it has been shown that quantum devices can, in principle, be used in ways that are incompatible with a definite input-output direction.
  arXiv  Detail & Related papers  (2026-01-31T18:39:36Z)
• Disparity between multipartite entangling and disentangling powers of unitaries: Even vs Odd [0.24578723416255752]
  We compare the entangling and disentangling powers of unitary operators by assessing their ability to generate or eliminate genuine multipartite entanglement.<n>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.
  arXiv  Detail & Related papers  (2025-05-24T06:05:24Z)
• Gradient projection method for constrained quantum control [50.24983453990065]
  We adopt the Gradient Projection Method (GPM) to problems of quantum control. The main advantage of the method is that it allows to exactly satisfy the bounds. We apply the GPM to several examples including generation of one- and two-qubit gates and two-qubit Bell and Werner states.
  arXiv  Detail & Related papers  (2024-11-29T11:56:55Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Spectral decomposition of field operators and causal measurement in quantum field theory [0.0]
  We use decompositions to construct families of quantum operations implementing measurements of the field observables. What is more, we show that these quantum operations do not lead to superluminal signaling and are possible measurements on quantum fields in the sense of Sorkin.
  arXiv  Detail & Related papers  (2024-09-13T11:59:28Z)
• Tight upper bound for the maximal expectation value of the $N$-partite generalized Svetlichny operator [4.7487511537612335]
  We consider the $N$-partite scenario and provide an analytical upper bound on the maximal expectation value of the generalized Svetlichny inequality achieved by an arbitrary $N$-qubit system. Our results give feasible experimental implementations in detecting the genuine multipartite non-locality and can potentially be applied to other quantum information processing tasks.
  arXiv  Detail & Related papers  (2024-09-13T02:32:40Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Multipartite entanglement theory with entanglement-nonincreasing operations [91.3755431537592]
  We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
  arXiv  Detail & Related papers  (2023-05-30T12:53:56Z)
• The tilted CHSH games: an operator algebraic classification [77.34726150561087]
  This article introduces a general systematic procedure for solving any binary-input binary-output game. We then illustrate on the prominent class of tilted CHSH games. We derive for those an entire characterisation on the region exhibiting some quantum advantage.
  arXiv  Detail & Related papers  (2023-02-16T18:33:59Z)
• Quantum algorithms for generator coordinate methods [12.744157326232749]
  This paper discusses quantum algorithms for the generator coordinate method (GCM) that can be used to benchmark molecular systems. We illustrate the performance of the quantum algorithm for constructing a discretized form of the Hill-Wheeler equation for ground and excited state energies.
  arXiv  Detail & Related papers  (2022-12-19T01:22:19Z)
• Dual Exponential Coupled Cluster Theory: Unitary Adaptation, Implementation in the Variational Quantum Eigensolver Framework and Pilot Applications [0.0]
  We have developed a unitary variant of a double exponential coupled cluster theory. The method relies upon the nontrivial action of a unitary, containing a set of rank-two scattering operators. We have shown that all our schemes can perform uniformly well throughout the molecular potential energy surface.
  arXiv  Detail & Related papers  (2022-07-12T05:10:58Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators [0.0]
  We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices. We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity. We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
  arXiv  Detail & Related papers  (2022-05-05T17:56:41Z)
• Circulating Genuine Multiparty Entanglement in Quantum Network [0.0]
  We propose a scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size. We prove that the generalized geometric measure (GGM) of the resulting state of arbitrary qubits coincides with the minimum GGM of the initial resource states. We show that the method proposed here can be implemented by using logic gates, or by using the time dynamics of realizable spin Hamiltonians.
  arXiv  Detail & Related papers  (2021-12-19T11:26:16Z)
• Extracting work from correlated many-body quantum systems [2.0305676256390934]
  The presence of correlations in the input state of a non-interacting many-body quantum system can lead to an increase in the amount of work we can extract from it under global unitary processes. We observe that in the thermodynamic limit of large number of sites, complete work extraction can be attained for relatively small correlation strength.
  arXiv  Detail & Related papers  (2021-10-12T18:00:00Z)
• Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach [128.62787284435007]
  We propose the mean-field proximal policy optimization (MF-PPO) algorithm, at the core of which is a permutation-invariant actor-critic neural architecture. We prove that MF-PPO attains the globally optimal policy at a sublinear rate of convergence. In particular, we show that the inductive bias introduced by the permutation-invariant neural architecture enables MF-PPO to outperform existing competitors.
  arXiv  Detail & Related papers  (2021-05-18T04:35:41Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.