pith. sign in

arxiv: 1008.5337 · v3 · pith:23CUN4BVnew · submitted 2010-08-31 · 🪐 quant-ph

Entanglement of stabilizer codewords

classification 🪐 quant-ph
keywords entanglementcodesboundsequalstabilizeralgorithmcodecodeword
0
0 comments X
read the original abstract

The geometric measure, the logarithmic robustness and the relative entropy of entanglement are proved to be equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined with the generators of code. The entanglement of dual-containing CSS codes, Gottesman codes and the related codes are given. An iterative algorithm is developed to determine the exact value of the entanglement when the two bounds are not equal.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.