Applying quantum information to fingerprinting schemes and algebraic structures

Date
2004
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This research consists of three topics in quantum information science. First is an examination of the advantages that quantum information gives over classical information in very small instances of the fingerprinting problem. The second topic presents the properties of quantum Fourier transforms (QFTs) with respect to finite abelian groups, extends these ideas to finite unitary rings, and demonstrates how these properties characterize QFTs. The final topic applies some of the properties of the QFT to solve an oracle problem defined in terms of scrambled or "hidden" polynomial functions. Understanding quantum information often requires a major change in perspective, and thus has a reputation of being very difficult. Muddled and vague "popular presentations" contribute to the problem. In reaction to these issues, an introduction is presented here which relies on mathematics and supplementary commentary to present the ideas of quantum information, suitable for any reader with basic knowledge of linear algebra.
Description
Bibliography: p. 280-283
Keywords
Citation
de Beaudrap, J. R. (2004). Applying quantum information to fingerprinting schemes and algebraic structures (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/18704
Collections