Coarse-grained entanglement classification through orthogonal arrays
From MaRDI portal
Publication:4583103
DOI10.1063/1.5006890zbMath1402.81060arXiv1709.05916OpenAlexW3103262892WikidataQ112266744 ScholiaQ112266744MaRDI QIDQ4583103
Karol Życzkowski, Luigi Seveso, Dardo Goyeneche
Publication date: 27 August 2018
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.05916
Orthogonal arrays, Latin squares, Room squares (05B15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normaliz: Algorithms for affine monoids and rational cones
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Orthogonal arrays. Theory and applications
- Minimum \(G_2\)-aberration for nonregular fractional factorial designs
- Geometric isomorphism and minimum aberration for factorial designs with quantitative factors
- Higher order Schmidt decompositions
- Hilbert bases for orthogonal arrays
- Practical graph isomorphism. II.
- Classification of orthogonal arrays by integer programming
- Discriminants, resultants, and multidimensional determinants
- Generalized resolution for orthogonal arrays
- On local invariants of pure three-qubit states
- Theory of J-characteristics for fractional factorial designs and projection justification of minimum G2-aberration
- An algebraic classification of entangled states
- Entanglement of four-qubit systems: A geometric atlas with polynomial compass II (the tame world)
- Quantum entanglement
- Entanglement in many-body systems
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Polytopes, Rings, and K-Theory
- Generalised confounding with Grobner bases
- On the foundations of linear and integer linear programming I
- Hilbert Bases and the Facets of Special Knapsack Polytopes
- All maximally entangled four-qubit states
- Quantum cryptography
This page was built for publication: Coarse-grained entanglement classification through orthogonal arrays