Algorithmic cooling and scalable NMR quantum computers

  title={Algorithmic cooling and scalable NMR quantum computers},
  author={P. Oscar Boykin and Tal Mor and Vwani P. Roychowdhury and Farrokh Vatan and Rutger Vrijen},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  pages={3388 - 3393}
  • P. BoykinT. Mor R. Vrijen
  • Published 18 June 2001
  • Physics
  • Proceedings of the National Academy of Sciences of the United States of America
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… 

Figures and Tables from this paper

Improved algorithmic cooling for scalable NMR quantum computers

  • A. Kaltchenko
  • Physics, Computer Science
    SPIE Defense + Commercial Sensing
  • 2006
This preliminary work studies 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.

A pr 2 01 4 Experimental Heat-Bath Cooling of Spins

Algorithmic cooling (AC) is a method to purify quantum systems, such as ensembles of nuclear spins, or cold atoms in an optical lattice. When applied to spins, AC produces ensembles of highly

Optimal Algorithmic Cooling of Spins

The "all-bonacci" algorithm is presented, which appears to reach the maximal degree of cooling obtainable by the optimal AC approach, and several new exhaustive cooling algorithms, such as the Tribonacci and k-honacci algorithms are introduced.

Cooling of Spins via Quantum Data Compression

  • A. KaltchenkoE. Yang
  • Physics, Computer Science
    2007 10th Canadian Workshop on Information Theory (CWIT)
  • 2007
This work studies how classical data compression codes can be used to design cooling algorithms and utilizes fixed-rate block compression codes for long molecules and variable-rate lossless compression codesfor short molecules and provides a rudimentary analysis of cooling performance for both short and long molecules.

Heat Bath Algorithmic Cooling with Spins: Review and Prospects

Application of multiple rounds of Quantum Error Correction (QEC) is an essential milestone towards the construction of scalable quantum information processing devices. The requirements for multiple

Paramagnetic materials and practical algorithmic cooling for NMR quantum computing

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

Strong algorithmic cooling in large star-topology quantum registers

We envisage a star-topology quantum register, wherein a central computation qubit is symmetrically surrounded by a set of reset qubits. The reset qubits cool the computation qubit by transferring its

Algorithmic Cooling of Spins: A Practicable Method for Increasing Polarization

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

Hyperfine spin qubits in irradiated malonic acid: heat-bath algorithmic cooling

By accurately determining the full spin Hamiltonian and performing realistic algorithmic simulations, it is shown that an experimental demonstration of heat-bath algorithmic cooling beyond the Shannon bound is feasible in both three-qu bit and five-qubit variants of this spin system.

Algorithmic Cooling of Nuclear Spin Pairs using a Long-Lived Singlet State.

Algorithmic cooling methods manipulate an open quantum system in order to lower its temperature below that of the environment. We show that significant cooling is achieved on an ensemble of spin-pair



An algorithmic benchmark for quantum information processing

An experimental realization of an algorithmic benchmark using an NMR technique that involves coherent manipulation of seven qubits is reported, which can be used as a reliable and efficient method for creating a standard pseudopure state, the first step for implementing traditional quantum algorithms in liquid state NMR systems.


Liquid crystals offer several advantages as solvents for molecules used for nuclear magnetic resonance quantum computing (NMRQC). The dipolar coupling between nuclear spins manifest in the NMR

Implementation of a quantum search algorithm on a quantum computer

In 1982 Feynman observed that quantum-mechanical systems have an information-processing capability much greater than that of corresponding classical systems, and could thus potentially be used to


Though this result raises questions about NMR quantum computation, further analysis would be necessary to assess the power of the general unitary transformations, which are indeed implemented in these experiments, in their action on separable states.

Bulk Spin-Resonance Quantum Computation

A new approach to quantum computing is introduced based on the use of multiple-pulse resonance techniques to manipulate the small deviation from equilibrium of the density matrix of a macroscopic ensemble so that it appears to be the density Matrix of a much lower dimensional pure state.

The Usefulness of NMR Quantum Computing

In this chapter, Shor's proposed algorithm for finding prime factors in polynomial instead of exponential time is proposed and described.

Elements of Information Theory

The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.

inMethods in Stereochemical analysis

  • A. P. Marchand, Ed.
  • 1988

Real and realistic quantum computers

The first real quantum-mechanical computations have now been made. But current techniques cannot be scaled up to produce useful quantum computers. A radical scheme, using semiconductor physics to

Ensemble quantum computing by NMR spectroscopy

A new computational model is presented, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof, which can solve nondeterministic polynomial-time complete problems inPolynomial time.