相关论文: The logarithmic negativity: A full entanglement mo…

Entanglement monotone is defined as a convex measure of entanglement that does not increase on average under local operations and classical communication (LOCC). Here we call an entanglement monotone a strict entanglement monotone (SEM) if…

We explore properties of the universal terms in the entanglement entropy and logarithmic negativity in 4d CFTs, aiming to clarify the ways in which they behave like the analogous entanglement measures in quantum mechanics. We show that,…

It is well known that increasing functions do not preserve operator order in general; nor do decreasing functions reverse operator order. However, operator monotone increasing or operator monotone decreasing do. In this article, we employ a…

We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key…

We study the entanglement between disjoint subregions in quantum critical systems through the lens of the logarithmic negativity. We work with systems in arbitrary dimensions, including conformal field theories and their corresponding…

A strong entanglement monotone, which never increases under local operations and classical communications (LOCC), restricts quantum entanglement manipulation more strongly than the usual monotone since the usual one does not increase on…

We study operator log-convex functions on $(0,\infty)$, and prove that a continuous nonnegative function on $(0,\infty)$ is operator log-convex if and only if it is operator monotone decreasing. Several equivalent conditions related to…

We introduce a reversible theory of exact entanglement manipulation by establishing a necessary and sufficient condition for state transfer under trace-preserving transformations that completely preserve the positivity of partial transpose…

In the past several years, there have been several representative attitude determination methods developed using derivative-based optimization algorithms. Optimization techniques e.g. gradient-descent algorithm (GDA), Gauss-Newton algorithm…

Many trace inequalities can be expressed either as concavity/convexity theorems or as monotonicity theorems. A classic example is the joint convexity of the quantum relative entropy which is equivalent to the Data Processing Inequality. The…

Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also…

We prove a strengthened form of convexity for operator monotone decreasing positive functions defined on the positive real numbers. This extends Ando and Hiai's work to allow arbitrary positive maps instead of states (or the identity map),…

In recent years, various aspects of theoretical models with long range interactions have attracted attention, ranging from out-of-time-ordered correlators to entanglement. In the present paper, entanglement properties of a simple non-local…

We study the entanglement cost under quantum operations preserving the positivity of the partial transpose (PPT-operations). We demonstrate that this cost is directly related to the logarithmic negativity, thereby providing the operational…

We consider the logarithmic negativity, a measure of bipartite entanglement, in a general unitary 1+1-dimensional massive quantum field theory, not necessarily integrable. We compute the negativity between a finite region of length $r$ and…

A logconcave likelihood is as important to proper statistical inference as a convex cost function is important to variational optimization. Quantization is often disregarded when writing likelihood models, ignoring the limitations of the…

We introduce a new generalization of relative entropy to non-negative vectors with sums $\gt 1$. We show in a purely combinatorial setting, with no probabilistic considerations, that in the presence of linear constraints defining a convex…

The purpose of this paper is to introduce the logarithmic mean of two convex functionals that extends the logarithmic mean of two positive operators. Some inequalities involving this functional mean are discussed as well. The operator…

Characterization and quantification of multipartite entanglement is one of the challenges in state-of-the-art experiments in quantum information processing. According to theory, this is achieved via entanglement monotones, that is,…

The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix…