Codeword stabilized quantum codes: algorithm and structure

Details Codeword stabilized quantum codes: algorithm and structure Codeword stabilized quantum codes: algorithm and structure

2008-03-21

arxiv.org/abs/0803.3232v1

Physics

Quantum Physics

11 pages, 1 figure

Scientific paper

The codeword stabilized ("CWS") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we prove three structure theorems which reduce the search space, specifying certain admissible and optimal ((n,K,d)) additive codes. In particular, we find there does not exist any ((7,3,3)) CWS code though the linear programming bound does not rule it out. The complexity of the CWS search algorithm is compared with the contrasting method introduced by Aggarwal and Calderbank (arXiv:cs/0610159).

Affiliated with

Also associated with

No associations

Rating

Codeword stabilized quantum codes: algorithm and structure 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 Codeword stabilized quantum codes: algorithm and structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Codeword stabilized quantum codes: algorithm and structure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-596736