Coarse-grained entanglement classification through orthogonal arrays

Abstract

Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in systems consisting of $N$ subsystems with an arbitrary number of internal levels each, based on properties of orthogonal arrays with $N$ columns. In particular, we investigate in detail a subset of highly entangled pure states which contains all states defining maximum distance separable codes. To illustrate the methods presented, we analyze systems of four and five qubits, as well as heterogeneous tripartite systems consisting of two qubits and one qutrit or one qubit and two qutrits.

38 pages, 1 figure

References in corpus (9)

• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Certified randomness in quantum physics
• Genuinely multipartite entangled states and orthogonal arrays
• All Maximally Entangled Four Qubits States
• Entanglement and quantum combinatorial designs
• Complete enumeration of two-Level orthogonal arrays of strength $d$ with $d+2$ constraints
• Generalized resolution for orthogonal arrays
• Entanglement of four-qubit systems: a geometric atlas with polynomial compass II (the tame world)
• Classifying Quantum Entanglement through Topological Links

Cited by in corpus (2)

• Cut-resistant links and multipartite entanglement resistant to particle loss
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays