Information-Theoretic Tools for Analyzing Non-IID Structures in Quantum Key Distribution

dc.contributor.authorArqand, Amir
dc.date.accessioned2025-09-23T13:00:23Z
dc.date.available2025-09-23T13:00:23Z
dc.date.issued2025-09-23
dc.date.submitted2025-09-22
dc.description.abstractQuantum key distribution (QKD) is the task of establishing an information-theoretically secure key between two parties (Alice and Bob) by exploiting the rules of quantum mechanics. A central goal in QKD is to provide finite-size security proofs against the most general class of attacks—namely, coherent attacks. One approach for obtaining such proofs is through the original entropy accumulation theorem (EAT) and the generalized entropy accumulation theorem (GEAT). In this thesis, we improve and extend these EAT-style techniques in several aspects. We begin by presenting techniques for applying the GEAT in the finite-size analysis of generic prepare-and-measure protocols. We then improve the statistical analysis in these EAT-style techniques, yielding a significant improvement in the key rates obtained by these methods. In addition, these improvements can be applied directly at the level of Rényi entropies if desired, yielding fully-Rényi security proofs. Beyond this, we develop an EAT-style framework that can accommodate specific forms of marginal-state constraints ``compatible'' with the source-replacement scheme. This allows us to overcome the repetition-rate restriction previously imposed on the GEAT when analyzing prepare-and-measure protocols. Furthermore, it yields ``fully adaptive'' protocols that can, in principle, update the entropy estimation procedure during the protocol itself. Finally, we investigate the effect of imperfections in QKD by deriving a number of chain rules for mutual information suited for analyzing protocols involving information leakage from imperfect devices. In particular, we derive chain rules between smooth min-entropy and smooth max-information for characterizing one-shot information leakage caused by an additional conditioning register. Furthermore, we introduce an EAT-style theorem for mutual information to simplify the evaluation of leakage measured by smooth max-information. In addition, we derive suitable chain rules to incorporate the leakage process into the GEAT framework.
dc.identifier.urihttps://hdl.handle.net/10012/22532
dc.language.isoen
dc.pendingfalse
dc.publisherUniversity of Waterlooen
dc.subjectquantum key distribution
dc.subjectrényi entropies
dc.subjectentropy accumulation
dc.subjectinformation theoretic security
dc.subjectquantum cryptography
dc.titleInformation-Theoretic Tools for Analyzing Non-IID Structures in Quantum Key Distribution
dc.typeDoctoral Thesis
uws-etd.degreeDoctor of Philosophy
uws-etd.degree.departmentPhysics and Astronomy
uws-etd.degree.disciplinePhysics (Quantum Information)
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.embargo.terms0
uws.contributor.advisorLutkenhaus, Norbert
uws.contributor.affiliation1Faculty of Science
uws.peerReviewStatusUnrevieweden
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Arqand_Amir.pdf
Size:
1.47 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
6.4 KB
Format:
Item-specific license agreed upon to submission
Description: