skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Fidelity-Based Smooth Min-Relative Entropy: Properties and Applications
The fidelity-based smooth min-relative entropy is a distinguishability measure that has appeared in a variety of contexts in prior work on quantum information, including resource theories like thermodynamics and coherence. Here we provide a comprehensive study of this quantity. First we prove that it satisfies several basic properties, including the data-processing inequality. We also establish connections between the fidelity-based smooth min-relative entropy and other widely used information-theoretic quantities, including smooth min-relative entropy and smooth sandwiched Rényi relative entropy, of which the sandwiched Rényi relative entropy and smooth max-relative entropy are special cases. After that, we use these connections to establish the second-order asymptotics of the fidelity-based smooth min-relative entropy and all smooth sandwiched Rényi relative entropies, finding that the first-order term is the quantum relative entropy and the second-order term involves the quantum relative entropy variance. Utilizing the properties derived, we also show how the fidelity-based smooth min-relative entropy provides one-shot bounds for operational tasks in general resource theories in which the target state is mixed, with a particular example being randomness distillation. The above observations then lead to second-order expansions of the upper bounds on distillable randomness, as well as the precise second-order asymptotics of the distillable randomness of particular classical-quantum states. Finally, we establish semi-definite programs for smooth max-relative entropy and smooth conditional min-entropy, as well as a bilinear program for the fidelity-based smooth min-relative entropy, which we subsequently use to explore the tightness of a bound relating the last to the first.  more » « less
Award ID(s):
2315398
PAR ID:
10534464
Author(s) / Creator(s):
;
Publisher / Repository:
IEEE
Date Published:
Journal Name:
IEEE Transactions on Information Theory
Volume:
70
Issue:
6
ISSN:
0018-9448
Page Range / eLocation ID:
4170 to 4196
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, IEEE Transactions on Information Theory)
    Estimation of Shannon and Rényi entropies of unknown discrete distributions is a fundamental problem in statistical property testing. In this paper, we give the first quantum algorithms for estimating α-Rényi entropies (Shannon entropy being 1-Rényi entropy). In particular, we demonstrate a quadratic quantum speedup for Shannon entropy estimation and a generic quantum speedup for α-Rényi entropy estimation for all α ≥ 0, including tight bounds for the Shannon entropy, the Hartley entropy (α = 0), and the collision entropy (α = 2). We also provide quantum upper bounds for estimating min-entropy (α = +∞) as well as the Kullback-Leibler divergence. We complement our results with quantum lower bounds on α- Rényi entropy estimation for all α ≥ 0. Our approach is inspired by the pioneering work of Bravyi, Harrow, and Hassidim (BHH) [1], however, with many new technical ingredients: (1) we improve the error dependence of the BHH framework by a fine-tuned error analysis together with Montanaro’s approach to estimating the expected output of quantum subroutines [2] for α = 0, 1; (2) we develop a procedure, similar to cooling schedules in simulated annealing, for general α ≥ 0; (3) in the cases of integer α ≥ 2 and α = +∞, we reduce the entropy estimation problem to the α-distinctness and the ⌈log n⌉-distinctness problems, respectively. 
    more » « less
  2. ; ; (, Journal of High Energy Physics)
    A bstract Since the work of Ryu and Takayanagi, deep connections between quantum entanglement and spacetime geometry have been revealed. The negative eigenvalues of the partial transpose of a bipartite density operator is a useful diagnostic of entanglement. In this paper, we discuss the properties of the associated entanglement negativity and its Rényi generalizations in holographic duality. We first review the definition of the Rényi negativities, which contain the familiar logarithmic negativity as a special case. We then study these quantities in the random tensor network model and rigorously derive their large bond dimension asymptotics. Finally, we study entanglement negativity in holographic theories with a gravity dual, where we find that Rényi negativities are often dominated by bulk solutions that break the replica symmetry. From these replica symmetry breaking solutions, we derive general expressions for Rényi negativities and their special limits including the logarithmic negativity. In fixed-area states, these general expressions simplify dramatically and agree precisely with our results in the random tensor network model. This provides a concrete setting for further studying the implications of replica symmetry breaking in holography. 
    more » « less
  3. ; ; (, International Journal of Mathematics)
    We revisit the connection between von Neumann algebra index and relative entropy. We observe that the Pimsner-Popa index connects to maximal sandwiched p-R\'enyi relative entropy for all p between 1/2 and infinity, including the Umegaki's relative entropy at p=1. Based on that, we introduce a new notation of maximal relative entropy for a inclusion of finite von Neumann algebras. These maximal relative entropy generalizes subfactors index and has application in estimating decoherence time of quantum Markov semigroup 
    more » « less
  4. ; ; (, Lithuanian mathematical journal)
    We explore asymptotically optimal bounds for deviations of distributions of independent Bernoulli random variables from the Poisson limit in terms of the Shannon relative entropy and Rényi/relative Tsallis distances (including Pearson’s χ2). This part generalizes the results obtained in Part I and removes any constraints on the parameters of the Bernoulli distributions. 
    more » « less
  5. ; (, Probability Surveys)
    We give an overview of various results and methods related to information-theoretic distances of Rényi type in the light of their applications to the central limit theorem (CLT). The first part (Sections 1–9) is devoted to the total variation and the Kullback-Leibler distance (relative entropy). In the second part (Sections 10–15) we discuss general properties of Rényi and Tsall is divergences of order alpha > 1, and then in the third part (Sections 16–21) we turn to the CLT and non-uniform local limit theorems with respect to these strong distances. In the fourth part (Sections 22–31), we discuss recent results on strictly subgaussian distributions and describe necessary and sufficient conditions which ensure the validity of the CLT with respect to the Rényi divergence of infinite order. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email