Schumacher's quantum data compression as a quantum computation

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-330674

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.