Entanglement and separability of graph Laplacian quantum states
From MaRDI portal
Publication:2107117
Recommendations
- Separability of Pure and Mixed States of the Quantum Network of Four Nodes
- Separability of density matrices of graphs for multipartite systems
- Entanglement and symmetry in multiple-qubit states: a geometric approach
- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
- Separability of Pure States of the Quantum Network of Three Nodes
Cites work
- A combinatorial approach to multipartite quantum systems: basic formulation
- A graph theoretical approach to states and unitary operations
- Combinatorial laplacians and positivity under partial transpose
- Concurrence and three-tangle of the graph
- Eigenvalue Inequalities for Matrix Product
- Entangled three-qubit states without concurrence and three-tangle
- Entanglement of formation and concurrence
- Entanglement of formation of an arbitrary state of two qubits
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3717339 (Why is no real title available?)
- scientific article; zbMATH DE number 7099395 (Why is no real title available?)
- Introduction to quantum graphs
- INTRODUCTION TO THE BASICS OF ENTANGLEMENT THEORY IN CONTINUOUS-VARIABLE SYSTEMS
- Laplacian matrices of weighted digraphs represented as quantum states
- Maximal thermal entanglement using three-spin interactions
- Mixed-state entanglement and quantum error correction
- On a product of positive semidefinite matrices
- Partial transpose of permutation matrices
- Products of positive semidefinite matrices
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
- Quantum Theory for Mathematicians
- Random quantum correlations and density operator distributions
- Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
- Some eigenvalue inequalities for positive semidefinite matrix power products
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
Cited in
(15)- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
- Multipartite separability of density matrices of graphs
- Geometric properties of evolutionary graph states and their detection on a quantum computer
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- Quantum classifier with entangled subgraph states
- Entanglement and nonclassical properties of hypergraph states
- Entanglement and symmetry in multiple-qubit states: a geometric approach
- Entanglement in valence-bond-solid states on symmetric graphs
- Condition for zero and nonzero discord in graph Laplacian quantum states
- A graph-separation theorem for quantum causal models
- A bonding model of entanglement for N-qubit graph states
- Separability of Pure and Mixed States of the Quantum Network of Four Nodes
- Generalized graph states based on Hadamard matrices
- Shor–Laflamme distributions of graph states and noise robustness of entanglement
- A graph-theoretical framework to analyze zero discord quantum states
This page was built for publication: Entanglement and separability of graph Laplacian quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107117)
