pith. sign in

arxiv: 1709.05916 · v4 · pith:G6OPQ3DSnew · submitted 2017-09-18 · 🧮 math.CO · quant-ph

Coarse-grained entanglement classification through orthogonal arrays

classification 🧮 math.CO quant-ph
keywords systemsclassificationentanglementqubitsarrayscoarse-grainedconsistingfour
0
0 comments X
read the original 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.

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.