We provide a procedure to construct entanglement-assisted Calderbank-Shor-Steane (CSS) codes over qudits from the parity check matrices of two classical codes over Fq, where q = pk, p is prime, and k is a positive integer. The construction procedure involves the proposed Euclidean Gram-Schmidt orthogonalization algorithm, followed by a procedure to extend the quantum operators to obtain stabilizers of the code. Using this construction, we provide a construction of entanglement-assisted tensor product codes from classical tensor product codes over Fq. We further show that a nonzero rate entanglement-assisted tensor product code can be obtained from a classical tensor product code whose component codes yield zero rate entanglement-assisted CSS codes. We view this result as the coding analog of superadditivity.
We demonstrate a general procedure to construct entanglement witnesses for any entangled state. This procedure is based on the trace inequality and a general form of entanglement witnesses, which is in the form $W=\ensuremath{\rho}\ensuremath{-}{c}_{\ensuremath{\rho}}I$, where $\ensuremath{\rho}$ is a density matrix, ${c}_{\ensuremath{\rho}}$ is a non-negative number related to $\ensuremath{\rho}$, and
I is the identity matrix. The general form of entanglement witnesses is deduced from Choi-Jamio\l{}kowski isomorphism, that can be reinterpreted as that all quantum states can be obtained by a maximally quantum entangled state pass through certain completely positive maps. Furthermore, we provide the necessary and sufficient condition of the entanglement witness $W=\ensuremath{\rho}\ensuremath{-}{c}_{\ensuremath{\rho}}I$ in operation, as well as in theory.