Two new relative entropy quantities, called the min- and max-relative entropies, are introduced and their properties are investigated. The well-known min- and max- entropies, introduced by Renner, are obtained from these. We define a new entanglement monotone, which we refer to as the max-relative entropy of entanglement, and which is an upper bound to the relative entropy of entanglement. We also generalize the min- and max-relative entropies to obtain smooth min- and max- relative entropies. These act as parent quantities for the smooth Renyi entropies, and allow us to define the analogues of the mutual information, in the Smooth Renyi Entropy framework. Further, the spectral divergence rates of the Information Spectrum approach are shown to be obtained from the smooth min- and max-relative entropies in the asymptotic limit.
We discuss the geometric aspects of a recently described unfolding procedure and show the form of objects relevant in the field of Quantum Information Geometry in the unfolding space. In particular, we show the form of the quantum monotone metric tensors characterized by Petz and retrace in this unfolded perspective a recently introduced procedure of extracting a covariant tensor from a relative $g$-entropy.
We construct a class of algebraic invariants for N-qubit pure states based on bipartite decompositions of the system. We show that they are entanglement monotones, and that they differ from the well know linear entropies of the sub-systems. They therefore capture new information on the non-local properties of multipartite systems.
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 of which are the flattening ranks. 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 suita…
The Rains relative entropy of a bipartite quantum state is the tightest known upper bound on its distillable entanglement -- which has a crisp physical interpretation of entanglement as a resource -- and it is efficiently computable by convex programming. It has not been known to be a selective entanglement monotone in its own right. In this work, we strengthen the interpretation of the Rains relative entropy by showing that it is monotone under the action of selective operations that completely preserve the positivity of the partial transpose, reasonably quantifying entanglement. That is, we …
At the onset of an interaction between two initially independent systems, each system tends to experience an increase in its n-Renyi entropies, such as its von Neumann entropy (n = 1) and its mixedness (n = 2). We here ask which properties of a system determine how quickly its Renyi entropies increase and, therefore, how sensitive the system is to becoming entangled. We find that the rate at which the n-Renyi entropy increases in an interaction is determined by a quantity which we term the n-fragility of the system. The 2-fragility is closely related to the notion of 2-norm coherence, in that …
We provide an upper bound on the quasi-relative entropy in terms of the trace distance. The bound is derived for two cases: 1) any operator monotone decreasing function and full rank mixed qubit or classical states; 2) a large class of operator monotone decreasing function and any mixed qubit or classical states. Moreover, we derive an upper bound for the Umegaki and Tsallis relative entropies in the case of any finite-dimensional states. The bound for the relative entropy improves the known bounds for some states in any dimensions larger than four. The bound for the Tsallis entropy improves t…
Quantum coherence is a crucial resource for quantum information processing. By employing the language of coherence orders largely applied in NMR systems, quantum coherence has been currently addressed in terms of multiple quantum coherences (MQCs). Here we investigate the $α$-MQCs, a novel class of multiple quantum coherences which is based on $α$-relative purity, an information-theoretic quantifier analogous to quantum fidelity and closely related to Rényi relative entropy of order $α$. Our framework enables linking $α$-MQCs to Wigner-Yanase-Dyson skew information (WYDSI), an asymmetry monoto…
In classical and quantum information theory, operational quantities such as the amount of randomness that can be extracted from a given source or the amount of space needed to store given data are normally characterized by one of two entropy measures, called smooth min-entropy and smooth max-entropy, respectively. While both entropies are equal to the von Neumann entropy in certain special cases (e.g., asymptotically, for many independent repetitions of the given data), their values can differ arbitrarily in the general case. In this work, a recently discovered duality relation between (non-sm…
The information content of the two-particle one- and two-dimensional Calogero model is studied using the von Neumann and Rényi entropies. The one-dimensional model is shown to have non-monotonic entropies with finite values in the large interaction strength limit. On the other hand, the von Neumann entropy of the two-dimensional model with isotropic confinement is a monotone increasing function of the interaction strength which diverges logarithmically. By considering an anisotropic confinement in the two-dimensional case we show that the one-dimensional behavior is eventually reached when the…
Cornell University（康奈尔大学）；Quantum Science Center（量子科学中心）；University of Maryland, College Park（马里兰大学帕克分校）；Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）；Université de Montréal（蒙特利尔大学）
We derive new characterisations of the matrix $\mathrmΦ$-entropy functionals introduced in [Electron.~J.~Probab., 19(20): 1--30, 2014]. Notably, all known equivalent characterisations of the classical $Φ$-entropies have their matrix correspondences. Next, we propose an operator-valued generalisation of the matrix $Φ$-entropy functionals, and prove their subadditivity under Löwner partial ordering. Our results demonstrate that the subadditivity of operator-valued $Φ$-entropies is equivalent to the convexity of various related functions. This result can be used to demonstrate an interesting resu…
We consider an extension of the conditional min- and max-entropies to infinite-dimensional separable Hilbert spaces. We show that these satisfy characterizing properties known from the finite-dimensional case, and retain information-theoretic operational interpretations, e.g., the min-entropy as maximum achievable quantum correlation, and the max-entropy as decoupling accuracy. We furthermore generalize the smoothed versions of these entropies and prove an infinite-dimensional quantum asymptotic equipartition property. To facilitate these generalizations we show that the min- and max-entropy c…
We use the relative modular operator to define a generalized relative entropy for any convex operator function g on the positive real line satisfying g(1) = 0. We show that these convex operator functions can be partitioned into convex subsets each of which defines a unique symmetrized relative entropy, a unique family (parameterized by density matrices) of continuous monotone Riemannian metrics, a unique geodesic distance on the space of density matrices, and a unique monotone operator function satisfying certain symmetry and normalization conditions. We describe these objects explicitly in s…
Conditions for Large-Sample Majorization of Pairs of Flat States in Terms of $α$-z Relative Entropies
Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；Department of Electrical and Computer Engineering, National University of Singapore（新加坡国立大学电气与计算机工程系）
Mathematical models use information from past observations to generate predictions about the future. If two models make identical predictions the one that needs less information from the past to do this is preferred. It is already known that certain classical models (certain Hidden Markov Models called ε-machines which are often optimal classical models) are not in general the preferred ones. We extend this result and show that even optimal classical models (models with minimal internal entropy) in general are not the best possible models (called ideal models). Instead of optimal classical mod…
The occupancies and entropic entanglement measures for the ground state of two particles in a two-dimensional harmonic anisotropic trap are studied. We implement a method to study the large interaction strength limit for different short- and long-range interaction potentials that allows to obtain the exact entanglement spectrum and several entropies. We show that for long-range interactions, the von Neumann, min-entropy and the family of Rényi entropies remain finite for the anisotropic traps and diverge logarithmically for the isotropic traps. In the short-range interaction case the entanglem…
We present a genuine coherence measure based on a quasi-relative entropy as a difference between quasi-entropies of the dephased and the original states. The measure satisfies non-negativity and monotonicity under genuine incoherent operations (GIO). It is strongly monotone under GIO in two- and three-dimensions, or for pure states in any dimension, making it a genuine coherence monotone. We provide a bound on the error term in the monotonicity relation in terms of the trace distance between the original and the dephased states. Moreover, the lower bound on the coherence measure can also be ca…
The Tsallis and Rényi entropies are important quantities in the information theory, statistics and related fields because the Tsallis entropy is an one parameter generalization of the Shannon entropy and the Rényi entropy includes several useful entropy measures such as the Shannon entropy, Min-entropy and so on, as special choices of its parameter. On the other hand, the discrete-time quantum walk plays important roles in various applications, for example, quantum speed-up algorithm and universal computation. In this paper, we show limiting behaviors of the Tsallis and Rényi entropies for dis…
The chain rule for the Shannon and von Neumann entropy, which relates the total entropy of a system to the entropies of its parts, is of central importance to information theory. Here we consider the chain rule for the more general smooth min- and max-entropy, used in one-shot information theory. For these entropy measures, the chain rule no longer holds as an equality, but manifests itself as a set of inequalities that reduce to the chain rule for the von Neumann entropy in the i.i.d. case.
The min-cut function of weighted hypergraphs and the von Neumann entropy of pure quantum states are both symmetric submodular functions. In this note, we explain this coincidence by proving that the min-cut function of any weighted hypergraph can be approximated (up to an overall rescaling) by the entropies of quantum states known as stabilizer states. This implies that the min-cuts of hypergraphs are constrained by quantum entropy inequalities, and it shows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones, as has been conjectured in the recent l…
The Renyi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies or mutual information, and have found many applications in information theory and beyond. Various generalizations of Renyi entropies to the quantum setting have been proposed, most notably Petz's quasi-entropies and Renner's conditional min-, max- and collision entropy. Here, we argue that previous quantum extensions are incompatible and thus unsatisfactory. We p…
We investigate minimum output (Rényi) entropy of qubit channels and unital quantum channels. We obtain an exact formula for the minimum output entropy of qubit channels, and bounds for unital quantum channels. Interestingly, our bounds depend only on the operator norm of the matrix representation of the channels on the space of trace-less Hermitian operators. Moreover, since these bounds respect tensor products, we get bounds for the capacity of unital quantum channels, which is saturated by the Werner-Holevo channel. Furthermore, we construct an orthonormal basis, besides the Gell-Mann basis,…
In this paper, we investigate and compare two well-developed definitions of entropy relevant for describing the dynamics of isolated quantum systems: bipartite entanglement entropy and observational entropy. In a model system of interacting particles in a one-dimensional lattice, we numerically solve for the full quantum behavior of the system. We characterize the fluctuations, and find the maximal, minimal, and typical entropy of each type that the system can eventually attain through its evolution. While both entropies are low for some "special" configurations and high for more "generic" one…
We prove a tight uniform continuity bound for a family of entropies which includes the von Neumann entropy, the Tsallis entropy and the $α$-Rényi entropy, $S_α$, for $α\in (0,1)$. We establish necessary and sufficient conditions for equality in the continuity bound and prove that these conditions are the same for every member of the family. Our result builds on recent work in which we constructed a state which was majorized by every state in a neighbourhood ($\varepsilon$-ball) of a given state, and thus was the minimal state in majorization order in the $\varepsilon$-ball. This minimal state …
This thesis consolidates, improves and extends the smooth entropy framework for non-asymptotic information theory and cryptography. We investigate the conditional min- and max-entropy for quantum states, generalizations of classical Rényi entropies. We introduce the purified distance, a novel metric for unnormalized quantum states and use it to define smooth entropies as optimizations of the min- and max-entropies over a ball of close states. We explore various properties of these entropies, including data-processing inequalities, chain rules and their classical limits. The most important prop…
We introduce an axiomatic approach to entropies and relative entropies that relies only on minimal information-theoretic axioms, namely monotonicity under mixing and data-processing as well as additivity for product distributions. We find that these axioms induce sufficient structure to establish continuity in the interior of the probability simplex and meaningful upper and lower bounds, e.g., we find that every relative entropy must lie between the Rényi divergences of order $0$ and $\infty$. We further show simple conditions for positive definiteness of such relative entropies and a characte…
In [Berta et al., J. Math. Phys. 56, 022205 (2015)], we recently proposed Renyi generalizations of the conditional quantum mutual information of a tripartite state on $ABC$ (with $C$ being the conditioning system), which were shown to satisfy some properties that hold for the original quantity, such as non-negativity, duality, and monotonicity with respect to local operations on the system $B$ (with it being left open to show that the Renyi quantity is monotone with respect to local operations on system $A$). Here we define a Renyi squashed entanglement and a Renyi quantum discord based on a R…
We investigate the relationship between mixedness and entanglement for Gaussian states of continuous variable systems. We introduce generalized entropies based on Schatten $p$-norms to quantify the mixedness of a state, and derive their explicit expressions in terms of symplectic spectra. We compare the hierarchies of mixedness provided by such measures with the one provided by the purity (defined as ${\rm tr} \varrho^2$ for the state $\varrho$) for generic $n$-mode states. We then review the analysis proving the existence of both maximally and minimally entangled states at given global and ma…
Additivity and chain rules for quantum entropies via multi-index Schatten norms
Inria（法国国家信息与自动化研究所）；ENS Lyon（里昂高等师范学院）；UCBL（里昂第一大学）；LIP（计算机科学实验室）；Télécom Paris - LTCI（巴黎电信学院-通信与图像实验室）；Institut Polytechnique de Paris（巴黎理工学院）；Inria Paris（法国国家信息与自动化研究所巴黎分部）
Indeterminacy associated with probing of a quantum state is commonly expressed through spectral distances (metric) featured in the outcomes of repeated experiments. Here we express it as an effective amount (measure) of distinct outcomes instead. The resulting $μ$-uncertainties are described by the effective number theory [1] whose central result, the existence of a minimal amount, leads to a well-defined notion of intrinsic irremovable uncertainty. We derive $μ$-uncertainty formulas for arbitrary set of commuting operators, including the cases with continuous spectra. The associated entropy-l…
