Condition for zero and nonzero discord in graph Laplacian quantum states

DOI10.1142/S0219749919500187zbMath1412.81016arXiv1705.00808MaRDI QIDQ4633661

Subhashish Banerjee, Supriyo Dutta, Bibhas Adhikari

Publication date: 3 May 2019

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

density matrixweighted graphquantum discordmixed statecombinatorial and signless Laplacian matrices of graph

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Signed and weighted graphs (05C22) Quantum coherence, entanglement, quantum correlations (81P40) Quantum state spaces, operational and probabilistic concepts (81P16) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Related Items

Construction of cospectral graphs ⋮ Permutation symmetric hypergraph states and multipartite quantum entanglement

Cites Work

• A graph theoretical approach to states and unitary operations
• Symmetric Laplacians, quantum density matrices and their von-Neumann entropy
• Laplacian matrices of weighted digraphs represented as quantum states
• Classical, quantum and total correlations
• Necessary and Sufficient Condition for Nonzero Quantum Discord
• Geometric measure of quantum discord
• “Classical” quantum states
• A new criterion for zero quantum discord
• Computing quantum discord is NP-complete
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
• Sudden decoherence transitions for quantum discord
• A combinatorial approach to multipartite quantum systems: basic formulation