AAU Student Projects - visit Aalborg University's student projects portal
A master's thesis from Aalborg University
Book cover


Quantum Data Compression

Author

Term

4. term

Publication year

2003

Abstract

Kvanteinformationsteori undersøger, hvordan information er kodet i kvantesystemer, og hvilke særlige egenskaber det giver. Denne afhandling fokuserer på kvantedatakomprimering, som er centralt for lagring og overførsel af data uden tab. Vi giver et overblik over klassisk kodningsteori og de vigtigste begreber i kvantekodningsteori. Dernæst beskriver vi en bestemt støjfri og tabsfri kvantekomprimeringsmetode og tre måder at forbedre den på. Brute Force (BF) er en udtømmende tilgang, der kan være nyttig for små datamængder, men bliver meget beregningstung for større problemer. Improved BF reducerer beregningstiden ved at udnytte fordele ved kvantealgoritmer. Adapted Algorithm bygger på en anderledes måde at ordne sandsynligheder på; den opnår den bedste beregningstid blandt vores forslag, men garanterer i modsætning til de to andre ikke at finde en optimal løsning. Samlet set belyser vi kompromiserne mellem hastighed, problemstørrelse og garanti for optimalitet.

Quantum Information Theory studies how information is encoded in quantum systems and the unique features this enables. This thesis focuses on quantum data compression, which is key to storing and transmitting data without loss. We provide an accessible overview of Classical Coding Theory and the main concepts of Quantum Coding Theory. We then present a specific noiseless, lossless quantum compression scheme and three ways to improve it. Brute Force (BF) uses an exhaustive search that can work well for small datasets but becomes computationally heavy for larger ones. Improved BF lowers running time by leveraging advantages of quantum algorithms. The Adapted Algorithm relies on ordering probabilities differently; it achieves the best running time among our methods but, unlike the other two, does not guarantee an optimal solution. Overall, we highlight trade-offs between speed, problem size, and guaranteed optimality.

[This abstract was generated with the help of AI]