Related papers: Computational hardness of estimating quantum entro…
We present a quantum version of the generalized $(h,\phi)$-entropies, introduced by Salicr\'u \textit{et al.} for the study of classical probability distributions. We establish their basic properties, and show that already known quantum…
We consider Shannon entropy, Fisher information, R\'enyi entropy, and Tsallis entropy to study the quantum droplet phase in Bose-Einstein condensates. In the beyond mean-field description, the Gross-Pitaevskii equation with Lee-Huang-Yang…
We study the relative entanglement entropies of one interval between excited states of a 1+1 dimensional conformal field theory (CFT). To compute the relative entropy $S(\rho_1 \| \rho_0)$ between two given reduced density matrices $\rho_1$…
We simulate quench dynamics of the Su-Schrieffer-Heeger (SSH) chain on the IBM quantum computers, calculating the R\'enyi entanglement entropy, the twist order parameter and the Berry phase. The latter two quantities can be deduced from a…
Quantum information quantifiers are indispensable tools for analyzing strongly correlated systems. Consequently, developing efficient and robust numerical methods for their computation is crucial. We propose a general procedure based on the…
The recently introduced resource theory of imaginarity facilitates a systematic investigation into the role of complex numbers in quantum mechanics and quantum information theory. In this work, we propose well-defined measures of…
We investigate the universal inequalities relating the alpha-Renyi entropies of the marginals of a multi-partite quantum state. This is in analogy to the same question for the Shannon and von Neumann entropy (alpha=1) which are known to…
Non-stabilizerness, or magic, is a resource for universal quantum computation in most fault-tolerant architectures; access to states with non-stabilizerness allows for non-classically simulable quantum computation to be performed.…
The entanglement entropy of a subsystem $A$ of a quantum system is expressed, in the replica method, through analytic continuation with respect to n of the trace of the n-th power of the reduced density matrix $\tr\rho_A^n$. We study the…
We study an entropy measure for quantum systems that generalizes the von Neumann entropy as well as its classical counterpart, the Gibbs or Shannon entropy. The entropy measure is based on hypothesis testing and has an elegant formulation…
In classical physics, entropy quantifies the randomness of large systems, where the complete specification of the state, though possible in theory, is not possible in practice. In quantum physics, despite its inherently probabilistic…
We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard the computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round…
In this thesis, we examine in detail the notion of black hole entropy in Quantum Field Theories, with a specific focus on supersymmetric black holes and the perturbative and non-perturbative quantum corrections to the classical area-law of…
We explore a large class of correlation measures called the $\alpha-z$ R\'enyi mutual informations (RMIs). Unlike the commonly used notion of RMI involving linear combinations of R\'enyi entropies, the $\alpha-z$ RMIs are positive…
Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the…
Analytic continuation of numerical data obtained in imaginary time or frequency has become an essential part of many branches of quantum computational physics. It is, however, an ill-conditioned procedure and thus a hard numerical problem.…
Tsallis entropy is a useful one-parameter generalization of the standard von Neumann entropy in information theory. We study the variance of Tsallis entropy of bipartite quantum systems in a random pure state. The main result is an exact…
Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. Here, we examine the hardness of this task for the case of probability distributions or quantum states produced by…
In this paper we introduce an easy to compute upper bound on the Tsallis entropy of a density matrix describing a system coupled to a noise source. This suggests that the Tsallis entropy is most natural in the context of quantum information…
We derive Tsallis entropy, Sq, from universal thermostat independence and obtain the functional form of the corresponding generalized entropy-probability relation. Our result for finite thermostats interprets thermodynamically the subsystem…