Non-binary entanglement-assisted stabilizer codes

Using pre-shared entangled states between the encoder and the decoder, we provide a previously unreported coding-theoretic framework for constructing entanglement-assisted stabilizer codes over qudits of dimension p(k) from first principles, where p is prime and k is an element of Z(+). We introduce the concept of mathematically decomposing a qudit of dimension p(k) into k subqudits, each of dimension p. Our contributions toward the entanglement-assisted stabilizer coding framework over qudits are multi-fold as follows: (a) We study the properties of the code and derive an analytical expression for the minimum number of pre-shared entangled subqudits required to construct the code. (b) We provide a code construction procedure that involves obtaining the explicit form of the stabilizers of the code. (c) We show that the proposed entanglement-assisted qudit stabilizer codes are analogous to classical additive codes over F-pk. (d) We provide the quantum coding bounds, such as the quantum Hamming bound, the quantum Singleton bound, and the quantum Gilbert-Varshamov bound for non-degenerate entanglement-assisted stabilizer codes over qudits. (e) We finally demonstrate that the error correction capability of the code can be increased with entanglement assistance. The proposed framework is useful for realizing coded quantum computing and communication systems over p(k)-dimensional qudits.