Entanglement of stabilizer codewords
Xiao-yu Chen, Li-zhen Jiang
TL;DR
This paper proves the equivalence of several entanglement measures for stabilizer codewords, provides bounds based on code generators, and introduces an algorithm to precisely calculate entanglement in complex cases.
Contribution
It establishes the equality of key entanglement measures for stabilizer codewords and develops an iterative algorithm for exact entanglement calculation.
Findings
Entanglement measures are equal for stabilizer codewords.
Bounds on entanglement are derived from code generators.
An algorithm for exact entanglement computation is proposed.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata