Entanglement of stabilizer codewords
arXiv:1008.5337
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.
9 pages
References in corpus (6)
- Multi-party entanglement in graph states
- Codeword Stabilized Quantum Codes
- Entanglement of multiparty stabilizer, symmetric, and antisymmetric states
- Entanglement and symmetry in permutation symmetric states
- Entanglement and local information access for graph states
- Relative entropy of entanglement for certain multipartite mixed states