Saturating Quantum Relative Entropy Inequalities

Simple item page
dc.contributor.advisorVershynina, Anna
dc.contributor.committeeMemberBodmann, Bernhard G.
dc.contributor.committeeMemberKalantar, Mehrdad
dc.contributor.committeeMemberBrannan, Michael
dc.creatorChehade, Sarah
dc.date.accessioned2021-09-03T20:26:28Z
dc.date.createdMay 2021
dc.date.issued2021-05
dc.date.submittedMay 2021
dc.date.updated2021-09-03T20:26:30Z
dc.description.abstractThis dissertation describes the progress made towards understanding several quantum entropies and their mathematical properties. Here, we shall focus on various quantum relative entropies, that measure distinguishability between two quantum states (or two entities). In particular, we will focus all details towards understanding the widely used data processing inequality for quantum relative entropy. The data processing inequality describes how knowledge about quantum states (that describe a quantum system) cannot increase whenever the states undergo some noisy action (or a local operation). In chapter 3, we give a detailed explanation of the existing framework for the Umegaki relative entropy, the α− R´enyi relative entropy, the α− sandwiched R´enyi relative entropy, and a more general family of quantum relative entropies, namely the α − z R´enyi relative entropy. Chapter 4 is dedicated to the mathematical framework and tools we use to contribute towards saturating the data processing inequality of the α − z R´enyi relative entropy. In particular, we focus on jointly concave and jointly convex trace functionals. In Chapter 5, we describe and prove our main results with regards to saturating the data processing inequality for the α − z R´enyi relative entropy, under certain parameters, α and z. We prove necessary and algebraically sufficient conditions to saturate the data processing inequality for the α−z R´enyi relative entropy whenever 1 < α ≤ 2 and α/2 ≤ z ≤ α, provided that z > 1. Moreover, these conditions coincide whenever α = z.
dc.description.departmentMathematics, Department of
dc.format.digitalOriginborn digital
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/10657/8157
dc.language.isoeng
dc.rightsThe author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s).
dc.subjectentropy, relative entropy, trace functionals, joint convexity, data processing, saturation, recovery
dc.titleSaturating Quantum Relative Entropy Inequalities
dc.type.dcmiText
dc.type.genreThesis
local.embargo.lift2023-05-01
local.embargo.terms2023-05-01
thesis.degree.collegeCollege of Natural Sciences and Mathematics
thesis.degree.departmentMathematics, Department of
thesis.degree.disciplineMathematics
thesis.degree.grantorUniversity of Houston
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
CHEHADE-DISSERTATION-2021.pdf
Size:
1.73 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
4.43 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.81 KB
Format:
Plain Text
Description:
Download

Collections

Published ETD Collection