Tensor 2-sums and entanglement

DOI10.1088/1751-8113/43/21/212001MaRDI QIDQ3569241zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar, Simone Severini

Publication date 18 June 2010

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

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

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Operator algebra methods applied to problems in quantum theory (81R15)

Abstract: To define a minimal mathematical framework for isolating some of the characteristic properties of quantum entanglement, we introduce a generalization of the tensor product of graphs. Inspired by the notion of a density matrix, the generalization is a simple one: every graph can be obtained by addition modulo two, possibly with many summands, of tensor products of adjacency matrices. In this picture, we are still able to prove a combinatorial analogue of the Peres-Horodecki criterion for testing separability.

Recommendations

• A combinatorial approach to multipartite quantum systems: basic formulation
• Separability of density matrices of graphs for multipartite systems
• Entangled Graphs
• Separability of PE-matching graphs
• Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs

Cited in

(8)

• Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
• Entangleability of cones
• Walk entropies in graphs
• CLASSICAL TENSORS AND QUANTUM ENTANGLEMENT II: MIXED STATES
• Entangled Graphs
• Extended tensor products and generalization of the notion of entanglement
• Graded tensor products and entangelement
• The tensor Harish-Chandra-Itzykson-Zuber integral. II: Detecting entanglement in large quantum systems

This page was built for publication: Tensor 2-sums and entanglement

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