Schumacher's quantum data compression as a quantum computation.

An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using O(${\mathit{n}}^{3}$) two- and three-bit primitive reversible operations, where n is the length of the qubit strings to be compressed. Also, the algorithm makes use of O(n) auxiliary qubits. Space-saving techniques based on those proposed by Bennett are developed which reduce this workspace to O(\ensuremath{\surd}n) while maintaining a running time of O(${\mathit{n}}^{3}$) (albeit with a larger constant). This latter algorithm is of interest because it has a slightly smaller time-space product, which is considered to be the relevant figure of merit for efficiency in some physical models. \textcopyright{} 1996 The American Physical Society.

[1]  M. Gell-Mann,et al.  Physics Today. , 1966, Applied optics.

[2]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[3]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[4]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[5]  Charles H. Bennett.  Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[6]  I. Koren.  Computer arithmetic algorithms , 2018 .

[7]  Benjamin Schumacher,et al.  A new proof of the quantum noiseless coding theorem , 1994 .

[8]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[9]  A. Ekert,et al.  Universality in quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[10]  Lloyd,et al.  Almost any quantum logic gate is universal. , 1995, Physical review letters.

[11]  Unruh.  Maintaining coherence in quantum computers. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[12]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[13]  Chuang,et al.  Simple quantum computer. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[14]  C. H. Bennett,et al.  Quantum Information and Computation , 1995 .

[15]  Schumacher,et al.  Quantum coding. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[16]  R. Jozsa,et al.  Quantum Computation and Shor's Factoring Algorithm , 1996 .

[17]  Barenco,et al.  Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[18]  Preskill,et al.  Efficient networks for quantum factoring. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[19]  A. Ekert,et al.  qu an tph / 9 70 20 01 31 J an 1 99 7 Quantum Computers and Dissipation , 1996 .

[20]  Hoi-Kwong Lo,et al.  One-Way Functions in Reversible Computations , 1997, Cryptologia.