Polygamy relations for tripartite and multipartite quantum systems

• URL: http://arxiv.org/abs/2312.15683v2
• Date: Wed, 10 Jan 2024 03:48:01 GMT
• Title: Polygamy relations for tripartite and multipartite quantum systems
• Authors: Yanying Liang, Haozhen Situ, and Zhu-Jun Zheng
• Abstract summary: We study the polygamy property for tripartite and multipartite quantum systems. We use right triangle and tetrahedron to explain our polygamy relations according to the new definitions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the polygamy property for tripartite and multipartite quantum systems. In tripartite system, we build a solution set for polygamy in tripartite system and find a lower bound of the set, which can be a sufficient and necessary condition for any quantum entanglement of assistance $Q$ to be polygamous. In multipartite system, we firstly provide generalized definitions for polygamy in two kind of divisions of $n$-qubit systems, and then build polygamy inequalities with a polygamy power $\beta$, repectively. Moreover, we use right triangle and tetrahedron to explain our polygamy relations according to the new definitions.

Related papers

• Quantum Private Distributed Matrix Multiplication With Degree Tables [46.17112353277822]
  We show how quantum resources can be used to increase the rate of private distributed matrix multiplication.<n>In the high-privacy regime, the state-of-the-art classical code is called the gap additive secure (GASP) code.<n>We develop a new family of codes that can work in the quantum setting.
  arXiv  Detail & Related papers  (2025-11-28T18:02:11Z)
• A Quantum-Control Lambda-Calculus with Multiple Measurement Bases [49.1574468325115]
  We introduce Lambda-SX, a typed quantum-calculus that supports multiple measurement bases.<n>By tracking duplicability relative to arbitrary bases within the type system, Lambda-SX enables more flexible control and compositional reasoning about measurements.
  arXiv  Detail & Related papers  (2025-06-19T11:59:39Z)
• Multipartite Embezzlement of Entanglement [44.99833362998488]
  Embezzlement of entanglement refers to the task of extracting entanglement from an entanglement resource via local operations and without communication. We show that finite-dimensional approximations of multipartite embezzling states form multipartite embezzling families. We discuss our results in the context of quantum field theory and quantum many-body physics.
  arXiv  Detail & Related papers  (2024-09-11T22:14:22Z)
• Polygamy relation of quantum correlations with equality [5.925000951196114]
  A polygamy relation with equality is given by introducing the polygamy weight. From the polygamy relation with equality, we present polygamy inequalities satisfied by the power of the quantum correlation measures.
  arXiv  Detail & Related papers  (2023-09-23T14:09:52Z)
• Revisiting Tropical Polynomial Division: Theory, Algorithms and Application to Neural Networks [40.137069931650444]
  Tropical geometry has recently found several applications in the analysis of neural networks with piecewise linear activation functions. This paper presents a new look at the problem of tropical division and its application to the simplification of neural networks.
  arXiv  Detail & Related papers  (2023-06-27T02:26:07Z)
• On monogamy and polygamy relations of multipartite systems [9.730815192305782]
  We study the monogamy and polygamy relations related to quantum correlations for multipartite quantum systems. It is known that any bipartite measure obeys monogamy and polygamy relations for the $r$-power of the measure.
  arXiv  Detail & Related papers  (2023-02-16T19:11:51Z)
• A Direct Reduction from the Polynomial to the Adversary Method [92.54311953850168]
  We give a simple and direct reduction from the method (in the form of a dual) to the adversary method. This shows that any lower bound in the form of a dual is an adversary lower bound of a specific form.
  arXiv  Detail & Related papers  (2023-01-24T21:37:20Z)
• An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree [79.43134049617873]
  In this paper, we demonstrate an exponential separation between exact degree and approximate quantum query for a partial function. For an alphabet size, we have a constant versus separation complexity.
  arXiv  Detail & Related papers  (2023-01-22T22:08:28Z)
• Tightening monogamy and polygamy relations of unified entanglement in multipartite systems [1.6353216381658506]
  We first derive the monogamy inequality of unified-$(q, s)$ entanglement for multi-qubit states under arbitrary bipartition. We then obtain the monogamy inequalities of the $alpha$th ($0leqalphaleqfracr2, rgeqsqrt2$) power of entanglement of formation for tripartite states.
  arXiv  Detail & Related papers  (2022-05-12T23:27:16Z)
• PolyNet: Polynomial Neural Network for 3D Shape Recognition with PolyShape Representation [51.147664305955495]
  3D shape representation and its processing have substantial effects on 3D shape recognition. We propose a deep neural network-based method (PolyNet) and a specific polygon representation (PolyShape) Our experiments demonstrate the strength and the advantages of PolyNet on both 3D shape classification and retrieval tasks.
  arXiv  Detail & Related papers  (2021-10-15T06:45:59Z)
• Multiclass versus Binary Differentially Private PAC Learning [32.22526322514124]
  We show a generic reduction from multiclass differentially private PAC learning to binary private PAC learning. Our proof extends the notion of $Psi$-dimension defined in work of Ben-David et al. [JCSS '95] to the online setting and explores its general properties.
  arXiv  Detail & Related papers  (2021-07-22T18:06:39Z)
• Strong polygamy of multi-party $q$-expected quantum correlations [0.0]
  We show that the polygamous nature of multi-party quantum correlations can be characterized in a em stronger form based on Tsallis $q$-entropy and $q$-expectation value. We further establish the equivalence between strong polygamy inequalities of quantum entanglement and quantum discord distributed in multi-party quantum systems.
  arXiv  Detail & Related papers  (2021-01-14T01:54:40Z)
• Tighter constraints of multiqubit entanglement in terms of R\'{e}nyi-$\alpha$ entropy [5.316931601243777]
  monogamy and polygamy relations characterize the entanglement distributions in the multipartite systems. We present a class of monogamy inequalities related to the $mu$th power of the entanglement measure. These monogamy and polygamy relations are shown to be tighter than the existing ones.
  arXiv  Detail & Related papers  (2020-06-16T01:05:21Z)
• Post-Quantum Multi-Party Computation [32.75732860329838]
  We study multi-party computation for classical functionalities (in the plain model) with security against malicious-time quantum adversaries. We assume superpolynomial quantum hardness of learning with errors (LWE), and quantum hardness of an LWE-based circular security assumption. Along the way, we develop cryptographic primitives that may be of independent interest.
  arXiv  Detail & Related papers  (2020-05-23T00:42:52Z)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26:00Z)

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.