Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Quantum Theory and Symmetries (QTS)

ALGORITHMIC COOLING AND SCALABLE QUANTUM COMPUTERS: WAYS TO IMPROVE THE SPACE-TIME REQUIREMENTS OF THE ALGORITHM

Tal Mor, Yossi Weinstein

Published Jun 1, 2002• 0 citations
Publisher

Abstract

The "algorithmic cooling" of Boykin, Mor, Roychowdhury, Vatan and Vrijen (BMRVV) is a powerful cooling method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. The cooling is done by compressing the antropy of a string into a portion of it and then swaping that portion with rapidly thermal-relaxing bits, which transfers the antropy quickly to the environment. Algorithmic cooling could enable cooling spins to a very low temperature without cooling the environment and could resolve the scaling problem of NMR quantum computing devices. The BMRVV cooling algorithm is described in a simplified model in which all spins have identical bias (the minimum over all the different biases of the spins), and using blocks of m bits, hence the resulting cooling technique is non-optimal. We present here initial analysis of two improvements of the algorithm: working with variable-size blocks in the cooling process, and using better the fact that initial biases are not equal. As result, much less cooling steps are required in order to yield more spins which are highly polarized (with the desired bias).

DOI
10.1142/9789812777850_0012

Related papers

Algorithmic cooling and scalable NMR quantum computers

P. Oscar Boykin, Tal Mor, Vwani Roychowdhury +2 more

We present here algorithmic cooling (via polarization heat bath)-a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our "spin-refrigerating" method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.

arXiv:quant-ph/0106093•Proceedings of the National Academy of Sciences•Mar 19, 2002•201 citations

ALGORITHMIC COOLING OF SPINS: A PRACTICABLE METHOD FOR INCREASING POLARIZATION

José M. Fernandez, Seth Lloyd, Tal Mor +1 more

An efficient technique to generate ensembles of spins that are highly polarized by external magnetic fields is the Holy Grail in Nuclear Magnetic Resonance (NMR) spectroscopy. Since spin-half nuclei have steady-state polarization biases that increase inversely with temperature, spins exhibiting high polarization biases are considered cool, even when their environment is warm. Existing spin-cooling techniques are highly limited in their efficiency and usefulness. Algorithmic cooling is a promising new spin-cooling approach that employs data compression methods in open systems. It reduces the entropy of spins on long molecules to a point far beyond Shannon's bound on reversible entropy manipulations, thus increasing their polarization. Here we present an efficient and experimentally feasible algorithmic cooling technique that cools spins to very low temperatures even on short molecules. This practicable algorithmic cooling could lead to breakthroughs in high-sensitivity NMR spectroscopy in the near future, and to the development of scalable NMR quantum computers in the far future. Moreover, while the cooling algorithm itself is classical, it uses quantum gates in its implementation, thus representing the first short-term application of quantum computing devices.

arXiv:quant-ph/0401135•International Journal of Quantum Information•Dec 1, 2004•88 citations

Paramagnetic materials and practical algorithmic cooling for NMR quantum computing

Jose M. Fernandez, Tal Mor, Yossi Weinstein

Algorithmic cooling is a method devised by Boykin, Mor Rowchodhury, Vatan and Vrijen (PNAS Mar '02) for initializing NMR systems in general and NMR quantum computers in particular. The algorithm recursively employs two steps. The first is an adiabatic entropy compression of the computation qubits of the system. The second step is an isothermal heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. We investigated the effect of the paramagnetic material Chromium Acetylacetonate on the thermalization times of computation qubits (carbons) and reset qubit (hydrogen). We report here the accomplishment of an improved ratio of the thermalization times from T1(H)/T1(C) of approximately 5 to around 15. The magnetic ions from the Chromium Acetylacetonate interact with the reset qubit reducing their thermalization time, while their effect on the less exposed computation qubits is found to be weaker. An experimental demonstrating of non adiabatic cooling by thermalization and magnetic ion is currently performed by our group based on these results.

arXiv:quant-ph/0511153•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 5, 2003•2 citations

PARAMAGNETIC MATERIALS AND PRACTICAL ALGORITHMIC COOLING FOR NMR QUANTUM COMPUTING

José M. Fernandez, Tal Mor, Yossi Weinstein

Algorithmic cooling is a method that uses novel data compression techniques and simple quantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A reversible entropy compression of computation quantum-bits (qubits) of the system and an irreversible heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. Is it possible to experimentally demonstrate algorithmic cooling using existing technology? To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. However, such high thermalization-times ratios have yet to be reported. We investigate here the effect of a paramagnetic salt on the thermalization-times ratio of computation qubits (carbons) and a reset qubit (hydrogen). We show that the thermalization-times ratio is improved by approximately three-fold. Based on this result, an experimental demonstration of algorithmic cooling by thermalization and magnetic ions has been performed by the authors and collaborators.

International Journal of Quantum Information•Dec 16, 2004•15 citations

Optimization of algorithmic cooling for NMR quantum computers

Alexei Kaltchenko

To achieve scalability of NMR computers, one needs a large number of highly polarized spins in liquid nuclearspin systems at finite temperature. In quantum computing terminology, such spin-half states are (almost) pure qubit states. Producing highly polarized spins (almost pure qubit states) out of non-polarized spins (non-pure qubit states) is sometimes called "purification". From a thermodynamic point of view, purification can be viewed as cooling spins to a very low temperature. In this work, we study how classical data compression codes can be used to design cooling algorithms for both short and long molecules. We argue that so designed cooling (purification) algorithms potentially outperform other methods in terms of the closeness of the output state to the ideal pure state, which in turn implies lower output temperature. We also analyze how the mismatch of the algorithm's computational basis and the actual eigenbasis of the spins' density matrix will affect the cooling (purification) performance.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Apr 27, 2007•0 citations

Improved algorithmic cooling for scalable NMR quantum computers

Alexei Kaltchenko

The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices. To achieve scalability, one needs a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. In quantum computing terminology, such spin-half states are (almost) pure qubit states. Producing highly polarized spins (almost pure qubit states) out of non-polarized spins (non-pure qubit states) is sometimes called "purification". From a thermodynamic point of view, purification can be viewed as cooling spins to a very low temperature. In this preliminary work, we study the optimality of purification as a tradeoff between the number of cooled spins and the closeness of their quantum state to the ideal pure state.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 5, 2006•0 citations
The "algorithmic cooling" of Boykin, Mor, Roychowdhury, Vatan and Vrijen (BMRVV) is a powerful cooling method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. The cooling is done by compressing the antropy of a string into a portion of it and then swaping that portion with rapidly thermal-relaxing bits, which transfers the antropy quickly to the environment. Algorithmic cooling could enable cooling spins to a very low temperature without cooling the environment and could resolve the scaling problem of NMR quantum computing devices. The BMRVV cooling algorithm is described in a simplified model in which all spins have identical bias (the minimum over all the different biases of the spins), and using blocks of m bits, hence the resulting cooling technique is non-optimal. We present here initial analysis of two improvements of the algorithm: working with variable-size blocks in the cooling process, and using better the fact that initial biases are not equal. As result, much less cooling steps are required in order to yield more spins which are highly polarized (with the desired bias).
We present here algorithmic cooling (via polarization heat bath)-a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our "spin-refrigerating" method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.
An efficient technique to generate ensembles of spins that are highly polarized by external magnetic fields is the Holy Grail in Nuclear Magnetic Resonance (NMR) spectroscopy. Since spin-half nuclei have steady-state polarization biases that increase inversely with temperature, spins exhibiting high polarization biases are considered cool, even when their environment is warm. Existing spin-cooling techniques are highly limited in their efficiency and usefulness. Algorithmic cooling is a promising new spin-cooling approach that employs data compression methods in open systems. It reduces the entropy of spins on long molecules to a point far beyond Shannon's bound on reversible entropy manipulations, thus increasing their polarization. Here we present an efficient and experimentally feasible algorithmic cooling technique that cools spins to very low temperatures even on short molecules. This practicable algorithmic cooling could lead to breakthroughs in high-sensitivity NMR spectroscopy in the near future, and to the development of scalable NMR quantum computers in the far future. Moreover, while the cooling algorithm itself is classical, it uses quantum gates in its implementation, thus representing the first short-term application of quantum computing devices.
Algorithmic cooling is a method devised by Boykin, Mor Rowchodhury, Vatan and Vrijen (PNAS Mar '02) for initializing NMR systems in general and NMR quantum computers in particular. The algorithm recursively employs two steps. The first is an adiabatic entropy compression of the computation qubits of the system. The second step is an isothermal heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. We investigated the effect of the paramagnetic material Chromium Acetylacetonate on the thermalization times of computation qubits (carbons) and reset qubit (hydrogen). We report here the accomplishment of an improved ratio of the thermalization times from T1(H)/T1(C) of approximately 5 to around 15. The magnetic ions from the Chromium Acetylacetonate interact with the reset qubit reducing their thermalization time, while their effect on the less exposed computation qubits is found to be weaker. An experimental demonstrating of non adiabatic cooling by thermalization and magnetic ion is currently performed by our group based on these results.
Algorithmic cooling is a method that uses novel data compression techniques and simple quantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A reversible entropy compression of computation quantum-bits (qubits) of the system and an irreversible heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. Is it possible to experimentally demonstrate algorithmic cooling using existing technology? To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. However, such high thermalization-times ratios have yet to be reported. We investigate here the effect of a paramagnetic salt on the thermalization-times ratio of computation qubits (carbons) and a reset qubit (hydrogen). We show that the thermalization-times ratio is improved by approximately three-fold. Based on this result, an experimental demonstration of algorithmic cooling by thermalization and magnetic ions has been performed by the authors and collaborators.
To achieve scalability of NMR computers, one needs a large number of highly polarized spins in liquid nuclearspin systems at finite temperature. In quantum computing terminology, such spin-half states are (almost) pure qubit states. Producing highly polarized spins (almost pure qubit states) out of non-polarized spins (non-pure qubit states) is sometimes called "purification". From a thermodynamic point of view, purification can be viewed as cooling spins to a very low temperature. In this work, we study how classical data compression codes can be used to design cooling algorithms for both short and long molecules. We argue that so designed cooling (purification) algorithms potentially outperform other methods in terms of the closeness of the output state to the ideal pure state, which in turn implies lower output temperature. We also analyze how the mismatch of the algorithm's computational basis and the actual eigenbasis of the spins' density matrix will affect the cooling (purification) performance.
The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices. To achieve scalability, one needs a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. In quantum computing terminology, such spin-half states are (almost) pure qubit states. Producing highly polarized spins (almost pure qubit states) out of non-polarized spins (non-pure qubit states) is sometimes called "purification". From a thermodynamic point of view, purification can be viewed as cooling spins to a very low temperature. In this preliminary work, we study the optimality of purification as a tradeoff between the number of cooled spins and the closeness of their quantum state to the ideal pure state.