Premium
Optimal Algorithmic Cooling of Spins
Author(s) -
Elias Yuval,
Fernandez José M.,
Mor Tal,
Weinstein Yossi
Publication year - 2007
Publication title -
israel journal of chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.908
H-Index - 54
eISSN - 1869-5868
pISSN - 0021-2148
DOI - 10.1560/ijc_46_4_371
Subject(s) - spins , chemistry , molecule , entropy (arrow of time) , spin (aerodynamics) , statistical physics , physics , quantum mechanics , thermodynamics , condensed matter physics , organic chemistry
Algorithmic cooling (AC) is a recent spin‐cooling approach that employs entropy compression methods in open systems . AC reduces the entropy of spins on suitable molecules beyond Shannon's bound on the degree of entropy compression by reversible manipulations. Remarkably, AC makes use of thermalization, a generally destructive facet of spin systems, as an integral part of the cooling scheme. AC is capable of cooling spins to very low temperatures and provides significant cooling for molecules containing as few as 5–7 spins. Application of AC to slightly larger molecules could lead to breakthroughs in high‐sensitivity NMR spectroscopy in the near future. Furthermore, AC may be germane to the development of scalable NMR quantum computers. We introduce here a new practicable algorithm, “PAC3”, and several new exhaustive cooling algorithms, such as the Tribonacci and k ‐bonacci algorithms. In particular, we present the “all‐bonacci” algorithm, which appears to reach the maximal degree of cooling obtainable by the optimal AC approach. AC is potentially beneficial for NMR‐derived biomedical applications, which involve bio‐molecules with isotope enrichments, such as 13 C ‐ and 15 N ‐labeled amino acids. We briefly survey AC experiments, including a recent 3‐spin experiment in which Shannon's bound was bypassed. The difficulties associated with cooling molecules bearing a greater number of spins are explained. Finally, the potential of selected cooling algorithms (practicable, exhaustive, and optimal algorithms) is illustrated with regard to a highly relevant bio‐medical target— 13 C ‐labeled glucose.