The Gilbert-Varshamov Bound for Stabilizer Codes Over <inline-formula> <tex-math notation="LaTeX">$\mathbb{Z}_m$ </tex-math></inline-formula>

Quantum codes over finite rings have received a great deal of attention in recent years. Compared with quantum codes over finite fields, a notable advantage of quantum codes over finite rings is that they can adapt to quantum physical systems of arbitrary order. Moreover, operations are much easier...

Full description

Bibliographic Details
Main Authors: Nianqi Tang, Zhuo Li, Lijuan Xing, Ming Zhang
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8438874/
Description
Summary:Quantum codes over finite rings have received a great deal of attention in recent years. Compared with quantum codes over finite fields, a notable advantage of quantum codes over finite rings is that they can adapt to quantum physical systems of arbitrary order. Moreover, operations are much easier to execute in finite rings than they are in fields. The modulo m residue class ring &#x2124;<sub>m</sub> is the most common finite ring. This paper investigates stabilizer codes over &#x2124;<sub>m</sub> and presents the Gilbert-Varshamov (GV) bound. The GV bound shows that surprisingly good quantum codes exist over &#x2124;<sub>m</sub>, which makes quantum coding feasible for arbitrary quantum physical system. We also provide an enhanced version of the GV bound for non-degenerate stabilizer codes over &#x2124;<sub>m</sub>. The enhanced GV bound has an asymptotical form and ensures the existence of asymptotically good stabilizer codes over &#x2124;<sub>m</sub>. Finally, these two bounds are well suited for computer searching.
ISSN:2169-3536