Cooling algorithms based on the 3-bit majority

Details Cooling algorithms based on the 3-bit majority Cooling algorithms based on the 3-bit majority

2007-03-21

arxiv.org/abs/quant-ph/0703194v3

Physics

Quantum Physics

25 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cooling algorithms based on the 3-bit majority does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cooling algorithms based on the 3-bit majority, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cooling algorithms based on the 3-bit majority will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-382971