Cooling Algorithms Based on the 3-bit Majority |
| |
Authors: | Phillip Kaye |
| |
Affiliation: | (1) Institute for Quantum Computing, University of Waterloo, Waterloo, ON, Canada |
| |
Abstract: | Algorithmic cooling is a potentially important technique for making scalable NMR quantum computation feasible in practice.
Given the constraints imposed by this approach to quantum computing, the most likely cooling algorithms to be practicable
are those based on simple reversible polarization compression (RPC) operations acting locally on small numbers of bits. Several
different algorithms using 2- and 3-bit RPC operations have appeared in the literature, and these are the algorithms I consider
in this note. Specifically, I show that the RPC operation used in all these algorithms is essentially a majority vote of 3 bits,
and prove the optimality of the best such algorithm. I go on to derive some theoretical bounds on the performance of these
algorithms under some specific assumptions about errors.
|
| |
Keywords: | algorithmic cooling NMR quantum computation reversible polarization compression error analysis of cooling algorithms cooling algorithms based on the 3-bit majority |
本文献已被 SpringerLink 等数据库收录! |
|