Abstract
We introduce the notion of entanglement of subspaces as a measure that quantifies the entanglement of bipartite states in a randomly selected subspace. We discuss its properties and in particular we show that for maximally entangled subspaces it is additive. Furthermore, we show that maximally entangled subspaces can play an important role in the study of quantum error-correction codes. We discuss both degenerate and nondegenerate codes and show that the subspace spanned by the logical code words of a nondegenerate code is a $k$-totally- (maximally) entangled subspace. As for non-degenerate codes, we provide a mathematical definition in terms of subspaces and, as an example, we analyze Shor's 9-qubit code in terms of 22 mutually orthogonal subspaces.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
