UWSpace will be migrating to a new version of its software from July 29th to August 1st. UWSpace will be offline for all UW community members during this time.

Show simple item record

dc.contributor.authorKuroiwa, Kohdai
dc.date.accessioned2021-07-29 15:06:20 (GMT)
dc.date.available2022-07-30 04:50:07 (GMT)
dc.date.issued2021-07-29
dc.date.submitted2021-07-22
dc.identifier.urihttp://hdl.handle.net/10012/17174
dc.description.abstractIn this thesis, we investigate a variation of quantum information processing tasks, blind data compression, and we analyze an approximation of a structure of a set of quantum states closely related to the task, which is called the Koashi-Imoto (KI) decomposition. While various quantum information processing tasks have been extensively investigated in the framework of quantum Shannon theory, a problem called blind quantum data compression is considered as one of the most general forms of quantum data compression. It is known that its optimal compression rate within an asymptotically vanishing error is given by using the KI decomposition. However, it is also argued that allowing even an extremely small approximation causes a significant change in the compression rate. The sensitivity of the compression rate to approximations originates from the sensitivity of the KI decomposition. In this thesis, taking advantage of the sensitivity, we construct a novel protocol for blind quantum data compression that may perform remarkably well under the existence of finite approximations. Furthermore, to acquire insights into the instability of the KI decomposition and to analyze an approximation of the KI decomposition with finite approximations allowed, we investigate a structure of quantum channels that may lead to further understanding of an approximate structure of quantum states that is essential for more sophisticated error analysis of blind compression. Our results shed light on an instability of the rate of blind quantum data compression against approximations. Our compression protocol makes the data transmission with approximations much more efficient. Furthermore, our results on the approximation of the KI decomposition provides us with insights into an approximate KI decomposition of quantum states that is essential to conduct more rigorous and general analysis of blind data compression, as well as contributes to foundation of quantum mechanics from the perspective of what restrictions are imposed to quantum operations when they cause a small disturbance. We believe that our work paves the way to further investigation of blind quantum data compression with finite approximations, and our results make substantial progress towards the general analysis of approximate KI decomposition, which is essential not only for the study of blind quantum data compression but also for investigation of other quantum phenomena characterized by the KI decomposition.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectquantum Shannon theoryen
dc.subjectblind quantum data compressionen
dc.subjectKoashi-Imoto decompositionen
dc.subjectquantum information processingen
dc.subjectquantum information theoryen
dc.titleQuantum Blind Data Compression and Structure of Quantum Operations Approximately Preserving Quantum Statesen
dc.typeMaster Thesisen
dc.pendingfalse
uws-etd.degree.departmentPhysics and Astronomyen
uws-etd.degree.disciplinePhysics (Quantum Information)en
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.degreeMaster of Scienceen
uws-etd.embargo.terms1 yearen
uws.contributor.advisorLeung, Debbie
uws.contributor.affiliation1Faculty of Scienceen
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages