See this document in CiteSeerX!

quant-ph/9603009  (Make Corrections)  
Mar schums1.tex; submitted to Phys. Rev. A 3/7/96 Schumacher's quantum data...



  Home/Search   Context   Related

 
View or download:
pages.cpsc.ucalgary...schumacher_qph.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pages.cpsc.ucalgary.ca/~cleve/... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 ) two- and three-bit primitive reversible operations, where n is the length of the qubit strings to be compressed. Also, the algorithm makes... (Update)

Active bibliography (related documents):   More   All
1.6:   schums1.tex; submitted to Phys. Rev. A 3/7/96.. - As Quantum Computation   (Correct)
0.8:   Schumacher's Quantum Data Compression as a Quantum Computation - Cleve, DiVincenzo (1996)   (Correct)
0.4:   Efficient and Exact Quantum Compression and Molecular Scale O° K.. - Reif   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ tex-quantph,
  author = "Mar Schums Tex",
  title = "quant-ph/9603009",
  url = "citeseer.ist.psu.edu/763120.html" }
Citations (may not include all citations):
1447   A mathematical theory of communication (context) - Shannon - 1948
124   Elementary gates for quantum computation - Barenco, Bennett et al. - 1995
122   Computer arithmetic algorithms (context) - Koren - 1993
49   Two-bit gates are universal for quantum computation - DiVincenzo - 1995
33   Quantum cryptography (context) - Bennett, Brassard et al. - 1992
30   Reversible Computing (context) - Toffoli - 1980
28   Quantum information and computation (context) - Bennett - 1995
25   Quantum coding - Schumacher - 1995
24   A new proof of the quantum noiseless coding theorem - Jozsa, Schumacher - 1994
23   Maintaining coherence in quantum computers (context) - Unruh - 1995
17   Quantum computation and Shor's factoring algorithm (context) - Ekert, Jozsa - 1996
16   Quantum networks for elementary arithmetic operations (context) - Vedral, Barenco et al. - 1995
15   Time/space trade-offs for reversible computation (context) - Bennett - 1973
10   A simple quantum computer (context) - Chuang, Yamamoto - 1995
7   One-way functions in reversible computation (context) - See, Chau et al. - 1995
6   Efficient Networks for Quantum Factoring (context) - also, Beckman et al. - 1996
4   Quantum computation and dissipation (context) - Palma, Suominen et al. - 1996
2   We adopt a notation which is common in textbooks on algorith.. (context) - notation, common et al. - 1974

Documents on the same site (http://pages.cpsc.ucalgary.ca/~cleve/pubs/):   More
The query complexity of order-finding - Richard Cleve Department   (Correct)
quant-ph/9802049 - Sep Quantum Lower   (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC