Coarse-grained entanglement classification through orthogonal arrays

DOI10.1063/1.5006890zbMATH Open1402.81060arXiv1709.05916OpenAlexW3103262892WikidataQ112266744 ScholiaQ112266744MaRDI QIDQ4583103FDOQ4583103

Authors: Luigi Seveso, Dardo Goyeneche, Karol Życzkowski 

Publication date: 27 August 2018

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1709.05916

Recommendations

• Classification of the entangled states of \(2 \times N \times N\)
• Classification of the entangled states \(2 \times M \times N\)
• Classification of the entangled states of \(2 \times L \times M \times N\)
• Classification of arbitrary-dimensional multipartite pure states under stochastic local operations and classical communication using the rank of coefficient matrix
• Classification of multipartite systems featuring only \(|W\rangle\) and \(|GHZ\rangle\) genuine entangled states

zbMATH Keywords

entanglementorthogonal arraysqubitsmultipartite quantum systems

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Practical graph isomorphism. II.
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Title not available (Why is that?)
• Polytopes, Rings, and K-Theory
• Normaliz: Algorithms for affine monoids and rational cones
• Orthogonal arrays. Theory and applications
• Quantum entanglement
• Title not available (Why is that?)
• Entanglement in many-body systems
• On the foundations of linear and integer linear programming I
• Quantum cryptography
• Minimum \(G_2\)-aberration for nonregular fractional factorial designs
• Geometric isomorphism and minimum aberration for factorial designs with quantitative factors
• Discriminants, resultants, and multidimensional determinants
• Generalized resolution for orthogonal arrays
• Complete enumeration of pure-level and mixed-level orthogonal arrays
• Theory of \(J\)-characteristics for fractional factorial designs and projection justification of minimum \(G_2\)-aberration
• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher order Schmidt decompositions
• Generalised confounding with Grobner bases
• On local invariants of pure three-qubit states.
• Multipartite entanglement and hyperdeterminants
• Equivalence of fractional factorial designs
• Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
• An algebraic classification of entangled states
• All maximally entangled four-qubit states
• Entanglement of four-qubit systems: A geometric atlas with polynomial compass II (the tame world)
• Classification of orthogonal arrays by integer programming
• An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
• Hilbert Bases and the Facets of Special Knapsack Polytopes
• Title not available (Why is that?)
• Hilbert bases for orthogonal arrays

Cited In (1)

• The role of entanglement for enhancing the efficiency of quantum kernels towards classification

This page was built for publication: Coarse-grained entanglement classification through orthogonal arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583103)