Equivalence of Decoupling Schemes and Orthogonal Arrays

Details Equivalence of Decoupling Schemes and Orthogonal Arrays Equivalence of Decoupling Schemes and Orthogonal Arrays

2004-09-21

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

Physics

Quantum Physics

26 pages, latex, 1 figure in text

Scientific paper

We consider the problem of switching off unwanted interactions in a given multi-partite Hamiltonian. This is known to be an important primitive in quantum information processing and several schemes have been presented in the literature to achieve this task. A method to construct decoupling schemes for quantum systems of pairwise interacting qubits was introduced by M. Stollsteimer and G. Mahler and is based on orthogonal arrays. Another approach based on triples of Hadamard matrices that are closed under pointwise multiplication was proposed by D. Leung. In this paper, we show that both methods lead to the same class of decoupling schemes. Moreover, we establish a characterization of orthogonal arrays by showing that they are equivalent to decoupling schemes which allow a refinement into equidistant time-slots. Furthermore, we show that decoupling schemes for networks of higher-dimensional quantum systems with t-local Hamiltonians can be constructed from classical error-correcting codes.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-328245