Efficient Decoupling Schemes Based on Hamilton Cycles

Details Efficient Decoupling Schemes Based on Hamilton Cycles Efficient Decoupling Schemes Based on Hamilton Cycles

2004-08-11

arxiv.org/abs/quant-ph/0408078v1

Physics

Quantum Physics

4 pages, 1 figure, uses revtex 4

Scientific paper

Decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian is a well-studied problem. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed which use selective pulses. In this paper we consider an additional requirement on these pulse sequences: as few {\em different} control operations as possible should be used. This requirement is motivated by the fact that optimizing each individual selective pulse will be expensive, i. e., it is desirable to use as few different selective pulses as possible. For an arbitrary $d$-dimensional system we show that the ability to implement only two control operations is sufficient to turn off the time evolution. In case of a bipartite system with local control we show that four different control operations are sufficient. Turning to networks consisting of several $d$-dimensional nodes which are governed by a pair-interaction Hamiltonian, we show that decoupling can be achieved if one is able to control a number of different control operations which is logarithmic in the number of nodes.

Affiliated with

Also associated with

No associations

Rating

Efficient Decoupling Schemes Based on Hamilton Cycles 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 Efficient Decoupling Schemes Based on Hamilton Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Decoupling Schemes Based on Hamilton Cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575641