Efficient and exact quantum compression

www.elsevier.com/locate/ic We present a divide and conquer based algorithm for optimal quantum compression/decompression, using O(n(log 4 n) log log n) 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. © 2007 Elsevier Inc. All rights reserved

Abstract Efficient and Exact Quantum Compression

We present a divide and conquer based algorithm for optimal quantum compression / decompression, using O(n(log 4 n) log log n) 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)(R. Cleve, D. P. DiVincenzo, Schumacher’s quantum data compression as a quantum computation, Phys. Rev. A, 54, 1996, 2636-2650) for this operation