Degenerate quantum codes and the quantum Hamming bound

Details Degenerate quantum codes and the quantum Hamming bound Degenerate quantum codes and the quantum Hamming bound

2008-12-14

arxiv.org/abs/0812.2674v2

Phys. Rev. A 81, 032318 (2010)

Physics

Quantum Physics

Reformulated one of the results, corrected an erroneous remark and added a few more results

Scientific paper

10.1103/PhysRevA.81.032318

The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether or not the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this paper we show that Calderbank-Shor-Steane (CSS) codes with alphabet $q\geq 5$ cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes which allows us to strengthen the Rains' bound that an $[[n,k,d]]_2$ code cannot correct more than $\floor{(n+1)/6}$ errors to $\floor{(n-k+1)/6}$. Additionally, we also show that the general quantum codes $[[n,k,d]]_q$ with $k+d\leq {(1-2eq^{-2})n}$ cannot beat the quantum Hamming bound.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-348187