Interpolating between R\'enyi entanglement entropies for arbitrary
bipartitions via operator geometric means
- URL: http://arxiv.org/abs/2208.14438v1
- Date: Tue, 30 Aug 2022 17:56:53 GMT
- Title: Interpolating between R\'enyi entanglement entropies for arbitrary
bipartitions via operator geometric means
- Authors: D\'avid Bug\'ar, P\'eter Vrana
- Abstract summary: We introduce a new construction of subadditive and submultiplicative monotones in terms of a regularized R'enyi divergence.
We show that they can be combined in a nontrivial way using weighted operator geometric means.
In addition, we find lower bounds on the new functionals that are superadditive and supermultiplicative.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The asymptotic restriction problem for tensors can be reduced to finding all
parameters that are normalized, monotone under restrictions, additive under
direct sums and multiplicative under tensor products. The simplest such
parameters are the flattening ranks, the ranks of matrices obtained by
partitioning the tensor factors into two subsets. Over the complex numbers, a
refinement of this problem, originating in the theory of quantum entanglement,
is to find the optimal rate of entanglement transformations as a function of
the error exponent. This trade-off can also be characterized in terms of the
set of normalized, additive, multiplicative functionals that are monotone in a
suitable sense, which includes the restriction-monotones as well. For example,
the flattening ranks generalize to the (exponentiated) R\'enyi entanglement
entropies of order $\alpha\in[0,1]$. More complicated parameters of this type
are known, which interpolate between the flattening ranks or R\'enyi entropies
for special bipartitions, with one of the parts being a single tensor factor.
We introduce a new construction of subadditive and submultiplicative
monotones in terms of a regularized R\'enyi divergence between many copies of
the pure state represented by the tensor and a suitable sequence of positive
operators. We give explicit families of operators that correspond to the
flattening-based functionals, and show that they can be combined in a
nontrivial way using weighted operator geometric means. For order parameters
$\alpha\in[0,1]$, this leads to a new characterization of the previously known
additive and multiplicative monotones, while for $\alpha\in[1/2,1]$ we find new
submultiplicative and subadditive monotones that interpolate between the
R\'enyi entropies for all bipartitions. In addition, we find lower bounds on
the new functionals that are superadditive and supermultiplicative.
Related papers
- Tensor cumulants for statistical inference on invariant distributions [49.80012009682584]
We show that PCA becomes computationally hard at a critical value of the signal's magnitude.
We define a new set of objects, which provide an explicit, near-orthogonal basis for invariants of a given degree.
It also lets us analyze a new problem of distinguishing between different ensembles.
arXiv Detail & Related papers (2024-04-29T14:33:24Z) - Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions [18.086061048484616]
We study finite-sum monotone inclusion problems, which model broad classes of equilibrium problems.
Our main contributions are variants of the classical Halpern iteration that employ variance reduction to obtain improved complexity guarantees.
We argue that, up to poly-logarithmic factors, this complexity is unimprovable in the monotone Lipschitz setting.
arXiv Detail & Related papers (2023-10-04T17:24:45Z) - Decomposition of linear tensor transformations [0.0]
The aim of this paper is to develop a mathematical framework for exact tensor decomposition.
In the paper three different problems will be carried out to derive.
arXiv Detail & Related papers (2023-09-14T16:14:38Z) - Decentralized Riemannian Conjugate Gradient Method on the Stiefel
Manifold [59.73080197971106]
This paper presents a first-order conjugate optimization method that converges faster than the steepest descent method.
It aims to achieve global convergence over the Stiefel manifold.
arXiv Detail & Related papers (2023-08-21T08:02:16Z) - Kernel-based off-policy estimation without overlap: Instance optimality
beyond semiparametric efficiency [53.90687548731265]
We study optimal procedures for estimating a linear functional based on observational data.
For any convex and symmetric function class $mathcalF$, we derive a non-asymptotic local minimax bound on the mean-squared error.
arXiv Detail & Related papers (2023-01-16T02:57:37Z) - From Kernel Methods to Neural Networks: A Unifying Variational
Formulation [25.6264886382888]
We present a unifying regularization functional that depends on an operator and on a generic Radon-domain norm.
Our framework offers guarantees of universal approximation for a broad family of regularization operators or, equivalently, for a wide variety of shallow neural networks.
arXiv Detail & Related papers (2022-06-29T13:13:53Z) - Unified Fourier-based Kernel and Nonlinearity Design for Equivariant
Networks on Homogeneous Spaces [52.424621227687894]
We introduce a unified framework for group equivariant networks on homogeneous spaces.
We take advantage of the sparsity of Fourier coefficients of the lifted feature fields.
We show that other methods treating features as the Fourier coefficients in the stabilizer subgroup are special cases of our activation.
arXiv Detail & Related papers (2022-06-16T17:59:01Z) - The strong converse exponent of discriminating infinite-dimensional
quantum states [0.0]
We show that the sandwiched R'enyi divergences of finite-dimensional density operators quantify their distinguishability in the strong converse domain.
We also initiate the study of the sandwiched R'enyi divergences, and the related problem of the strong converse exponent.
arXiv Detail & Related papers (2021-07-16T17:57:28Z) - R\'enyi divergence inequalities via interpolation, with applications to
generalised entropic uncertainty relations [91.3755431537592]
We investigate quantum R'enyi entropic quantities, specifically those derived from'sandwiched' divergence.
We present R'enyi mutual information decomposition rules, a new approach to the R'enyi conditional entropy tripartite chain rules and a more general bipartite comparison.
arXiv Detail & Related papers (2021-06-19T04:06:23Z) - Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range.
For a large part of the presentation, infinite scattering length will be considered.
arXiv Detail & Related papers (2020-06-03T17:54:43Z) - The semiring of dichotomies and asymptotic relative submajorization [0.0]
We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings.
We find that an variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum.
arXiv Detail & Related papers (2020-04-22T14:13:26Z)
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.