Partial-Norm of Entanglement: Entanglement Monotones That are not Monogamous

• URL: http://arxiv.org/abs/2212.06521v6
• Date: Thu, 31 Aug 2023 07:44:07 GMT
• Title: Partial-Norm of Entanglement: Entanglement Monotones That are not Monogamous
• Authors: Yu Guo
• Abstract summary: Quantum entanglement is known to be monogamous, i.e., it obeys strong constraints on how the entanglement can be distributed among multipartite systems. We explore here a family of entanglement monotones with the reduced functions are concave but not strictly concave and show that they are not monogamous.
• Score: 3.832210766570055
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum entanglement is known to be monogamous, i.e., it obeys strong constraints on how the entanglement can be distributed among multipartite systems. Almost all the entanglement monotones so far are shown to be monogamous. We explore here a family of entanglement monotones with the reduced functions are concave but not strictly concave and show that they are not monogamous. They are defined by four kinds of the ``partial-norm'' of the reduced state, which we call them \textit{partial-norm of entanglement}, minimal partial-norm of entanglement, reinforced minimal partial-norm of entanglement, and \textit{partial negativity}, respectively. This indicates that, the previous axiomatic definition of the entanglement monotone needs supplemental agreement that the reduced function should be strictly concave since such a strict concavity can make sure that the corresponding convex-roof extended entanglement monotone is monogamous. Here, the reduced function of an entanglement monotone refers to the corresponding function on the reduced state for the measure on bipartite pure states.

Related papers

• MonoKAN: Certified Monotonic Kolmogorov-Arnold Network [48.623199394622546]
  In certain applications, model predictions must align with expert-imposed requirements, sometimes exemplified by partial monotonicity constraints. We introduce a novel ANN architecture called MonoKAN, based on the KAN architecture and achieves certified partial monotonicity while enhancing interpretability. Our experiments demonstrate that MonoKAN not only enhances interpretability but also improves predictive performance across the majority of benchmarks, outperforming state-of-the-art monotonic approaches.
  arXiv  Detail & Related papers  (2024-09-17T11:10:59Z)
• Rigorous derivation of the Efimov effect in a simple model [68.8204255655161]
  We consider a system of three identical bosons in $mathbbR3$ with two-body zero-range interactions and a three-body hard-core repulsion of a given radius $a>0$.
  arXiv  Detail & Related papers  (2023-06-21T10:11:28Z)
• Sequences of resource monotones from modular Hamiltonian polynomials [0.0]
  We show that entanglement monotones yield infinite sequences of inequalities that must be satisfied in majorizing state transitions. These inequalities give improved lower bounds for the work cost in finite dimensional systems. As an application to thermodynamics, one can use them to derive finite-dimension corrections to the Clausius inequality.
  arXiv  Detail & Related papers  (2023-01-03T11:33:44Z)
• Complete Genuine Multipartite Entanglement Monotone [3.832210766570055]
  We study whether the multipartite entanglement monotone (MEM) and genuine multipartite entanglement monotone (GMEM) are complete, completely monogamous, and tightly complete monogamous according to the feature of the reduced function. In addition, the relation between monogamy, complete monogamy, and the tightly complete monogamy are revealed in light of different kinds of MEMs and GMEMs.
  arXiv  Detail & Related papers  (2023-01-01T03:00:47Z)
• On the monotonicity of a quantum optimal transport cost [91.3755431537592]
  We show that the generalization of the $2$-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces. We propose a stabilized version of the original definition, which we show to be monotone under the application of general quantum channels.
  arXiv  Detail & Related papers  (2022-11-21T18:33:50Z)
• Monogamy inequality of entanglement of pure tripartite qudit states [0.0]
  We analytically establish an inequality analogous to the Coffman-Kundu-Wootters inequality. It is shown that the shared entanglement of the subsystems of a pure tripartite qudit state always satisfy a monogamy constraint.
  arXiv  Detail & Related papers  (2022-04-28T17:09:25Z)
• Monogamy of quantum entanglement [2.7631289602843774]
  monogamy of entanglement is restricted shareability of entanglement among multi-party systems. We introduce some generalized version of monogamy inequalities which extend and sharpen the traditional ones. We present two new definitions to define monogamy of entanglement.
  arXiv  Detail & Related papers  (2022-01-02T15:03:56Z)
• Quantifying entanglement in terms of an operational way [0.0]
  We show that any good entanglement quantifier defined on pure states can induce an entanglement monotone for all density matrices. In some particular cases, our proposed entanglement monotones turned to be equivalent to the convex roof construction.
  arXiv  Detail & Related papers  (2021-09-07T06:08:49Z)
• Spectrum of localized states in fermionic chains with defect and adiabatic charge pumping [68.8204255655161]
  We study the localized states of a generic quadratic fermionic chain with finite-range couplings. We analyze the robustness of the connection between bands against perturbations of the Hamiltonian.
  arXiv  Detail & Related papers  (2021-07-20T18:44:06Z)
• A study of latent monotonic attention variants [65.73442960456013]
  End-to-end models reach state-of-the-art performance for speech recognition, but global soft attention is not monotonic. We present a mathematically clean solution to introduce monotonicity, by introducing a new latent variable. We show that our monotonic models perform as good as the global soft attention model.
  arXiv  Detail & Related papers  (2021-03-30T22:35:56Z)
• Exact Hard Monotonic Attention for Character-Level Transduction [76.66797368985453]
  We show that neural sequence-to-sequence models that use non-monotonic soft attention often outperform popular monotonic models. We develop a hard attention sequence-to-sequence model that enforces strict monotonicity and learns a latent alignment jointly while learning to transduce.
  arXiv  Detail & Related papers  (2019-05-15T17:51:09Z)

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.