Physics – Quantum Physics
Scientific paper
1996-03-07
Physics
Quantum Physics
37 pages, no figures
Scientific paper
10.1103/PhysRevA.54.2636
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(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; however, space-saving techniques based on those proposed by Bennett are developed which reduce this workspace to $O(\sqrt{n})$ while increasing the running time by less than a factor of two.
Cleve Richard
DiVincenzo David P.
No associations
LandOfFree
Schumacher's quantum data compression as a quantum computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Schumacher's quantum data compression as a quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Schumacher's quantum data compression as a quantum computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-330674