Papers
Topics
Authors
Recent
2000 character limit reached

Xing-Ling Codes, Duals of their Subcodes, and Good Asymmetric Quantum Codes (1307.4532v2)

Published 17 Jul 2013 in cs.IT and math.IT

Abstract: A class of powerful $q$-ary linear polynomial codes originally proposed by Xing and Ling is deployed to construct good asymmetric quantum codes via the standard CSS construction. Our quantum codes are $q$-ary block codes that encode $k$ qudits of quantum information into $n$ qudits and correct up to $\flr{(d_{x}-1)/2}$ bit-flip errors and up to $\flr{(d_{z}-1)/2}$ phase-flip errors.. In many cases where the length $(q{2}-q)/2 \leq n \leq (q{2}+q)/2$ and the field size $q$ are fixed and for chosen values of $d_{x} \in {2,3,4,5}$ and $d_{z} \ge \delta$, where $\delta$ is the designed distance of the Xing-Ling (XL) codes, the derived pure $q$-ary asymmetric quantum CSS codes possess the best possible size given the current state of the art knowledge on the best classical linear block codes.

Citations (9)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.