Related papers: Computational hardness of estimating quantum entro…
This manuscript introduces a computationally efficient method to calculate the nonlinearity of a quantum feature map, as well as a method for determining whether a quantum feature map will have a high concentration of quantum states. The…
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…
This paper intends to give some new estimates for Tsallis relative operator entropy ${{T}_{v}}\left( A|B \right)=\frac{A{{\natural}_{v}}B-A}{v}$. Let $A$ and $B$ be two positive invertible operators with the spectra contained in the…
In local quantum circuits with charge conservation, we initialize the system in random product states and study the dynamics of the Renyi entanglement entropy $R_\alpha$. We rigorously prove that $R_\alpha$ with Renyi index $\alpha>1$ at…
Quantum relative entropy, a quantum generalization of the renowned Kullback-Leibler divergence, serves as a fundamental measure of the distinguishability between quantum states and plays a pivotal role in quantum information science.…
The resource theories of quantum coherence attract a lot of attention in recent years. Especially, the monotonicity property plays a crucial role here. In this paper we investigate the monotonicity property for the coherence measures…
We show that odd order R\'enyi entropies $S^{(2q+1)}$ of a system of interacting scalar fields can be calculated as the free energy of $2q+1$ replicas of the system with additional quadratic inter-replica couplings in the subsystem at the…
We calculate the entropies of the system of classical particles and a quantum scalar field by using the brick wall method in thermal bath in a charged Kerr black hole spacetime. Their leading terms at Hartle-Hawking temperature $T_H =…
Entanglement criteria for an $n$-partite quantum system with continuous variables are formulated in terms of R\'{e}nyi entropies. R\'{e}nyi entropies are widely used as a good information measure due to many nice properties. Derived…
Analytic representation of both position as well as momentum waveforms of the two-dimensional (2D) circular quantum dots with the Dirichlet and Neumann boundary conditions (BCs) allowed an efficient computation in either space of Shannon…
A framework for deriving R\'enyi entropy-power inequalities (EPIs) is presented that uses linearization and an inequality of Dembo, Cover, and Thomas. Simple arguments are given to recover the previously known R\'enyi EPIs and derive new…
We show that the quantum $\alpha$-relative entropies with parameter $\alpha\in (0,1)$ can be represented as generalized cutoff rates in the sense of [I. Csiszar, IEEE Trans. Inf. Theory 41, 26-34, (1995)], which provides a direct…
The concept of Logical Entropy, $S_L = 1- \sum_{i=1}^n p_i^2$, where the $p_i$ are normalized probabilities, was introduced by David Ellerman in a series of recent papers. Although the mathematical formula itself is not new, Ellerman…
Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived from it. Here we prove a new inequality…
Concepts of information theory are increasingly used to characterize collective phenomena in condensed matter systems, such as the use of entanglement entropies to identify emergent topological order in interacting quantum many-body…
The quantum entropy power inequality, proven by K\"onig and Smith (2012), states that $\exp(S(\rho \boxplus \sigma)/m)\geq \frac 12 (\exp(S(\rho)/m) + \exp(S(\sigma)/m))$ for two $m$-mode bosonic quantum states $\rho$ and $\sigma$. One…
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…
We consider the entanglement entropy in critical one-dimensional quantum systems with open boundary conditions. We show that the second R\'enyi entropy of an interval away from the boundary can be computed exactly, provided the same…
Maximum entropy inference and learning of graphical models are pivotal tasks in learning theory and optimization. This work extends algorithms for these problems, including generalized iterative scaling (GIS) and gradient descent (GD), to…
We construct upper bounds on entanglement entropies of many-body quantum states that have fixed energy expectation values with respect to geometrically local Hamiltonians. Our focus is on entanglement entropies of subsystems that make up…