关于[[n,k,d]]量子码存在性的若干结论

A LOT OF CONCLUSIONS ABOUT THE EXISTENCE OF QUANTUM CODES

本文给出了纯稳定量子码存在性的一个条件,而且证明了当n=k+2(d-1),d≥2,p是奇素数时,图量子码[ [n,1,d] ]p与[ [n+1,0,d+1] ]p的存在性等价.

In this paper, we present a condition about the existence of pure stabilizer quantum codes. When n=k+2(d-1), d≥2, p is and odd prime number, we have proved the existence of the graphic quantum codes [[ n,1,d ]] p are equivalent to that of [[ n+1,0,d+1 ]] p .