Abstract
Recently Lloyd and Zurek studied the algorithmic complexity of the spin-echo effect and concluded that the overall complexity of spins together with the magnetic field grew slowly even during the rephasing stage. In this paper we show that, in contrast to their conclusion, the complexity decreases during the rephasing stage. We also clarify the origin of the disagreement.
References
S. Lloyd and W. H. Zurek, Algorithmic treatment of the spin-echo effect,J. Stat. Phys. 62:819–839 (1991).
E. L. Hahn, Spin echoes,Phys. Rev. 80:580–594 (1950).
W.-K. Rhim, A. Pines, and J. S. Waugh, Time-reversal experiments in dipolar-coupled spin systems,Phys. Rev. B 3:684–696 (1971).
K. Blum,Density Matrix, Theory and Applications (Plenum Press, New York, 1981), Chapter 7.
A. Abragam,The Principles of Nuclear Magnetism (Clarendon Press, Oxford, 1961).
G. J. Chaitin,Algorithm Information Theory (Cambridge University Press, Cambridge, 1987), and references therein.
W. H. Zurek, Algorithmic randomness and physical entropy,Phys. Rev. A 40:4731–4751 (1989).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shizume, K. The decrease in the overall algorithmic complexity of the spin-echo effect. J Stat Phys 70, 1057–1062 (1993). https://doi.org/10.1007/BF01053608
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01053608