New additivity properties of the relative entropy of entanglement and its generalizations
- URL: http://arxiv.org/abs/2211.12804v3
- Date: Thu, 2 May 2024 04:59:35 GMT
- Title: New additivity properties of the relative entropy of entanglement and its generalizations
- Authors: Roberto Rubboli, Marco Tomamichel,
- Abstract summary: We prove that the relative entropy of entanglement is additive when emph at least one of the two states belongs to some specific class.
We show that these classes include bipartite pure, maximally correlated, GHZ, Bell diagonal, isotropic, and generalized Dicke states.
We extend these results to entanglement monotones based on the $alpha$-$z$ R'enyi relative entropy.
- Score: 8.97780713904412
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We prove that the relative entropy of entanglement is additive when \emph{at least one of the two states} belongs to some specific class. We show that these classes include bipartite pure, maximally correlated, GHZ, Bell diagonal, isotropic, and generalized Dicke states. Previously, additivity was established only if \textit{both} states belong to the same class. Moreover, we extend these results to entanglement monotones based on the $\alpha$-$z$ R\'enyi relative entropy. Notably, this family of monotones includes also the generalized robustness of entanglement and the geometric measure of entanglement. In addition, we prove that any monotone based on a quantum relative entropy is not additive for general states. We also compute closed-form expressions of the monotones for bipartite pure, Bell diagonal, isotropic, generalized Werner, generalized Dicke, and maximally correlated Bell diagonal states. Our results rely on developing a method that allows us to recast the initial convex optimization problem into a simpler linear one. Even though we mostly focus on entanglement theory, we expect that some of our technical results could be useful in investigating more general convex optimization problems.
Related papers
- Average Rényi Entanglement Entropy in Gaussian Boson Sampling [17.695669245980124]
We study the modal entanglement of the output states in a framework for quantum computing.
We derive formulas for $alpha = 1$, and, more generally, for all integers $alpha$ in the limit of modes and for input states that are composed of single-mode-squeezed-vacuum state with equal squeezing strength.
arXiv Detail & Related papers (2024-03-27T18:00:01Z) - Entanglement and Bell inequalities violation in $H\to ZZ$ with anomalous coupling [44.99833362998488]
We discuss entanglement and violation of Bell-type inequalities for a system of two $Z$ bosons produced in Higgs decays.
We find that a $ZZ$ state is entangled and violates the inequality for all values of the pair (anomalous) coupling constant.
arXiv Detail & Related papers (2023-07-25T13:44:31Z) - Towards a resolution of the spin alignment problem [1.6317061277457001]
We study a class of optimization problems inspired by the recently introduced spin alignment conjecture.
The motivation for our study is the recently introduced spin alignment conjecture.
arXiv Detail & Related papers (2023-07-13T16:47:55Z) - Average entanglement entropy of midspectrum eigenstates of
quantum-chaotic interacting Hamiltonians [0.0]
We show that the magnitude of the negative $O(1)$ correction is only slightly greater than the one predicted for random pure states.
We derive a simple expression that describes the numerically observed $nu$ dependence of the $O(1)$ deviation from the prediction for random pure states.
arXiv Detail & Related papers (2023-03-23T18:00:02Z) - 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) - Asymptotic Equipartition Theorems in von Neumann algebras [24.1712628013996]
We show that the smooth max entropy of i.i.d. states on a von Neumann algebra has an rate given by the quantum relative entropy.
Our AEP not only applies to states, but also to quantum channels with appropriate restrictions.
arXiv Detail & Related papers (2022-12-30T13:42:35Z) - Geometric relative entropies and barycentric Rényi divergences [16.385815610837167]
monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
We show that monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
arXiv Detail & Related papers (2022-07-28T17:58:59Z) - Local Additivity Revisited [0.0]
We make a number of simplifications in Gour and Friedland's proof of local additivity of minimum output entropy of a quantum channel.
We use a different approach to reduce the general case to that of a square positive definite matrix.
We extend this result to the maximum relative entropy with respect to a fixed reference state.
arXiv Detail & Related papers (2021-11-22T17:51:24Z) - Annihilating Entanglement Between Cones [77.34726150561087]
We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied.
Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
arXiv Detail & Related papers (2021-10-22T15:02:39Z) - Entropy and relative entropy from information-theoretic principles [24.74754293747645]
We find that every relative entropy must lie between the R'enyi divergences of order $0$ and $infty$.
Our main result is a one-to-one correspondence between entropies and relative entropies.
arXiv Detail & Related papers (2020-06-19T14:50:44Z) - Debiased Sinkhorn barycenters [110.79706180350507]
Entropy regularization in optimal transport (OT) has been the driver of many recent interests for Wasserstein metrics and barycenters in machine learning.
We show how this bias is tightly linked to the reference measure that defines the entropy regularizer.
We propose debiased Wasserstein barycenters that preserve the best of both worlds: fast Sinkhorn-like iterations without entropy smoothing.
arXiv Detail & Related papers (2020-06-03T23:06:02Z)
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.