Concurrence and three-tangle of the graph
From MaRDI portal
Publication:1993873
DOI10.1007/s11128-018-2085-5zbMath1402.81051OpenAlexW2898075428MaRDI QIDQ1993873
Atul Kumar, Anoopa Joshi, Ranveer Singh
Publication date: 5 November 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-018-2085-5
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum state spaces, operational and probabilistic concepts (81P16)
Related Items (2)
Permutation symmetric hypergraph states and multipartite quantum entanglement ⋮ Entanglement and separability of graph Laplacian quantum states
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
- Planar graphs: Theory and algorithms
- Quantum discord of states arising from graphs
- Random quantum correlations and density operator distributions
- Laplacian matrices of weighted digraphs represented as quantum states
- Quantifying entanglement resources
- Quantum entanglement
- Partial transpose of permutation matrices
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Quantum Theory for Mathematicians
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Quantum cryptography
- A combinatorial approach to multipartite quantum systems: basic formulation
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Graphs and matrices
This page was built for publication: Concurrence and three-tangle of the graph