Paper
25 April 2007 Optimization of algorithmic cooling for NMR quantum computers
Author Affiliations +
Abstract
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alexei Kaltchenko "Optimization of algorithmic cooling for NMR quantum computers", Proc. SPIE 6573, Quantum Information and Computation V, 657309 (25 April 2007); https://doi.org/10.1117/12.720147
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data compression

Quantum communications

Binary data

Computing systems

Quantum computing

Probability theory

Molecules

Back to Top