Quantum codes from nearly self-orthogonal quaternary linear codes |
| |
Authors: | Petr Lisoněk Vijaykumar Singh |
| |
Affiliation: | 1. Department of Mathematics, Simon Fraser University, Burnaby, BC?, V5A 1S6, Canada
|
| |
Abstract: | Construction X and its variants are known from the theory of classical error control codes. We present instances of these constructions that produce binary stabilizer quantum error control codes from arbitrary quaternary linear codes. Our construction does not require the classical linear code (C) that is used as the ingredient to satisfy the dual containment condition, or, equivalently, (C^{perp _h}) is not required to satisfy the self-orthogonality condition. We prove lower bounds on the minimum distance of quantum codes obtained from our construction. We give examples of record breaking quantum codes produced from our construction. In these examples, the ingredient code (C) is nearly dual containing, or, equivalently, (C^{perp _h}) is nearly self-orthogonal, by which we mean that (dim (C^{perp _h})-dim (C^{perp _h}cap C)) is positive but small. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|