Journal of Applied Sciences1812-56541812-5662Asian Network for Scientific Information10.3923/jas.2007.3567.3571Al-DaoudEssam122007722A new adaptive quantum lossless compression algorithm is introduced, the suggested algorithm does not need a priori estimation of probabilities and it is more useful in real applications. The main idea of the proposed algorithm is that the corresponding probabilities of the symbols are assumed to be identical and after each iteration; all the corresponding probabilities are updated. These probabilities will become closer to the actual distribution after few iterations. Moreover the complexity of the proposed algorithm can be reduced if we consider the general properties of the given data]]>Al-Daoud, E.,2007Bostroem, K. and T. Felbinge,2002Braunstein, S.L., C.A. Fuchs, D. Gottesmann and H.K. Lo,2000Jozsa, R., M. Horodecki, P. Horodecki and R. Horodecki,1998Lee, H., D. Ahn and S.W. Hwang,2002Panthong, P.,2005Reif, J.H. and S. Chakraborty,2007Schumacher, B.,1995Shannon, C.E.,1948