Related papers: Computational hardness of estimating quantum entro…
R\'enyi transfer entropy (RTE) is a generalization of classical transfer entropy that replaces Shannon's entropy with R\'enyi's information measure. This, in turn, introduces a new tunable parameter $\alpha$, which accounts for sensitivity…
The quantum relative entropy is a fundamental quantity in quantum information science, characterizing the distinguishability between two quantum states. However, this quantity is not additive in general for correlated quantum states,…
We study the properties of Tsallis entropy and Shannon entropy from the point of view of algorithmic randomness. In algorithmic information theory, there are two equivalent ways to define the program-size complexity K(s) of a given finite…
In the study of quantum limits to parameter estimation, the high dimensionality of the density operator and that of the unknown parameters have long been two of the most difficult challenges. Here we propose a theory of quantum…
We investigate boundary critical phenomena from a quantum information perspective. Bipartite entanglement in the ground state of one-dimensional quantum systems is quantified using the Renyi entropy S_alpha, which includes the von Neumann…
We develop a geometric realization of a broad class of generalized black hole entropy functionals by establishing their direct correspondence with the Misner$-$Sharp quasilocal mass and the Wald Noether$-$charge entropy in scalar$-$tensor…
Quantum entropy is an important measure for describing the uncertainty of a quantum state, more uncertainty in subsystems implies stronger quantum entanglement between subsystems. Our goal in this work is to quantify bipartite entanglement…
Recently, many experiments have been conducted with the goal of demonstrating a quantum advantage over classical computation. One popular framework for these experiments is Gaussian Boson Sampling, where quadratic photonic input states are…
Entanglement entropy is a fundamental measure of quantum entanglement for pure states, but for large-scale many-body systems, R\'{e}nyi entanglement entropy is much more computationally accessible. For mixed states, logarithmic negativity…
A critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB…
The R\'enyi entropies $R_{p}[\rho], 0<p<\infty$ of the probability density $\rho_{n,l,m}(\vec{r})$ of a physical system completely characterize the chemical and physical properties of the quantum state described by the three integer quantum…
The entanglement entropy, ${\cal S}$, is an indicator of quantum correlations in the ground state of a many body quantum system. At a second-order quantum phase-transition point in one dimension ${\cal S}$ generally has a logarithmic…
R\'enyi complexity ratio of two density functions is introduced for three and multidimensional quantum systems. Localization property of several density functions are defined and five theorems about near continuous property of R\'enyi…
In this thesis, we study aspects of entanglement theory of quantum field theories from an algebraic point of view. The main motivation is to gain insights about the general structure of the entanglement in QFT, towards a definition of an…
This paper gives improved R\'{e}nyi entropy power inequalities (R-EPIs). Consider a sum $S_n = \sum_{k=1}^n X_k$ of $n$ independent continuous random vectors taking values on $\mathbb{R}^d$, and let $\alpha \in [1, \infty]$. An R-EPI…
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing…
Integral representations of quantum relative entropy, and of the directional second and higher order derivatives of von Neumann entropy, are established, and used to give simple proofs of fundamental, known data processing inequalities: the…
A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum $\rho$-th moment of the number of performed…
The aim of this work is to compute the entanglement entropy of real and virtual particles by rewriting the generating functional of $\phi ^{4}$ theory as a mean value between states and observables defined through the correlation functions.…
Entropy is one of the most basic concepts in thermodynamics and statistical mechanics. The most widely used definition of statistical mechanical entropy for a quantum system is introduced by von Neumann. While in classical systems, the…