A combinatorial approach to multipartite quantum systems: basic formulation
From MaRDI portal
Abstract: In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of pure and mixed states, Von-Neumann entropy, separability of multipartite quantum states and quantum operations in terms of the graphs associated with quantum states. In order to address the separability and entanglement questions using graphs, we introduce a modified tensor product of weighted graphs, and establish its algebraic properties. In particular, we show that Werner's definition [1] of a separable state can be written in terms of a graphs, for the states in a real or complex Hilbert space. We generalize the separability criterion (degree criterion) due to S.L. Braunstein, S. Ghosh, T. Mansour, S. Severini, R.C. Wilson [2], to a class of weighted graphs with real weights. We have given some criteria for the Laplacian associated with a weighted graph to be positive semidefinite.
Recommendations
- Combinatory-algebraic perspective on multipartiteness, entanglement and quantum localization
- The Compositional Structure of Multipartite Quantum Entanglement
- Complementarity relations for multi-qubit systems
- Algebraic structures of multipartite quantum systems
- Complementary quantum correlations among multipartite systems
- Separability of multipartite quantum systems
- Combinatorial topology of multipartite entangled states
- The invariant-comb approach and its relation to the balancedness of multipartite entangled states
- A combinatorial approach for studying local operations and classical communication transformations of multipartite states
- Multipartite entanglement in qubit systems
Cited in
(17)- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
- Concurrence and three-tangle of the graph
- Combinatorial entanglement
- Entanglement and separability of graph Laplacian quantum states
- Laplacian matrices of weighted digraphs represented as quantum states
- Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
- Separability of PE-matching graphs
- Entangled graphs
- On the degree conjecture for separability of multipartite quantum states
- Tensor 2-sums and entanglement
- Separability of density matrices of graphs for multipartite systems
- Condition for zero and nonzero discord in graph Laplacian quantum states
- A note on the degree conjecture for separability of multipartite quantum states
- The invariant-comb approach and its relation to the balancedness of multipartite entangled states
- Quantum entanglement \& purity testing: a graph zeta function perspective
- A graph-theoretical framework to analyze zero discord quantum states
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
This page was built for publication: A combinatorial approach to multipartite quantum systems: basic formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757666)
