Efficient and exact quantum compression

Authors:
John H. Reif;Sukhendu Chakraborty
Affiliations:
Department of Computer Science, Duke University, Durham, NC 27708-0129, USA;Department of Computer Science, Duke University, Durham, NC 27708-0129, USA
Venue:
Information and Computation
Year:
2007

Citing 8
Cited 0

Time/space trade-offs for reversible computation

SIAM Journal on Computing
Elements of information theory

Elements of information theory
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Reversible Computing

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Irreversibility and heat generation in the computing process

IBM Journal of Research and Development
Logical reversibility of computation

IBM Journal of Research and Development
A quantum analog of Huffman coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a divide and conquer based algorithm for optimal quantum compression/decompression, using O(n(log^4n)loglogn) elementary quantum operations. Our result provides the first quasi-linear time algorithm for asymptotically optimal (in size and fidelity) quantum compression and decompression. We also outline the quantum gate array model to bring about this compression in a quantum computer. Our method uses various classical algorithmic tools to significantly improve the bound from the previous best known bound of O(n^3) for this operation.