On the Construction for Quantum Code ((n,K, d))p via Logic Function over Fp

Abstract

This paper studies the construction for quantum codes with parameters $((n,K,d){)}_p$ by use of an \textit{n}-variable logic function with APC distance $d^{\prime }\ge 2$ over ${\mathbb{F}}_p$, where $d$ is related to $d^{\prime }$. We obtain $d\le d^{\prime }$ and the maximal $K$ for all $d=d^{\prime }-k$, $0\le k\le d^{\prime }-2$. We also discuss the basic states and the equivalent conditions of saturating quantum Singleton bound.

5 pages

References in corpus (2)

• A Theory of Fault-Tolerant Quantum Computation
• Boolean Functions, Projection Operators and Quantum Error Correcting Codes