Coarse-grained entanglement classification through orthogonal arrays
From MaRDI portal
Publication:4583103
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 subsystems with an arbitrary number of internal levels each, based on properties of orthogonal arrays with 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.
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
Cites work
- scientific article; zbMATH DE number 6486637 (Why is no real title available?)
- scientific article; zbMATH DE number 578417 (Why is no real title available?)
- scientific article; zbMATH DE number 1516969 (Why is no real title available?)
- scientific article; zbMATH DE number 1560708 (Why is no real title available?)
- scientific article; zbMATH DE number 1419975 (Why is no real title available?)
- All maximally entangled four-qubit states
- An algebraic classification of entangled states
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
- Classification of orthogonal arrays by integer programming
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Discriminants, resultants, and multidimensional determinants
- Entanglement in many-body systems
- Entanglement of four-qubit systems: A geometric atlas with polynomial compass II (the tame world)
- Equivalence of fractional factorial designs
- Generalised confounding with Grobner bases
- Generalized resolution for orthogonal arrays
- Geometric isomorphism and minimum aberration for factorial designs with quantitative factors
- Higher order Schmidt decompositions
- Hilbert Bases and the Facets of Special Knapsack Polytopes
- Hilbert bases for orthogonal arrays
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Minimum \(G_2\)-aberration for nonregular fractional factorial designs
- Multipartite entanglement and hyperdeterminants
- Normaliz: Algorithms for affine monoids and rational cones
- On local invariants of pure three-qubit states.
- On the foundations of linear and integer linear programming I
- Orthogonal arrays. Theory and applications
- Polytopes, Rings, and K-Theory
- Practical graph isomorphism. II.
- Quantum cryptography
- Quantum entanglement
- Theory of \(J\)-characteristics for fractional factorial designs and projection justification of minimum \(G_2\)-aberration
Cited in
(1)
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)
