Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1702.06360 · Quantum Information Processing

Quantum discord of states arising from graphs

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

Published Jun 17, 2017• 9 citations
arXivHTMLPDF
DOI
10.1007/s11128-017-1636-5

Related papers

Hierarchy of graph-diagonal states based on quantum discord and entanglement classification

M. A. Jafarizadeh, Naser Karimi, D. Amidi +2 more

The European Physical Journal D•Oct 1, 2017•2 citations

A graph-theoretical framework to analyze zero discord quantum states

Anoopa Joshi, Parvinder Singh, Atul Kumar

Quantum Information Processing•Apr 9, 2025•0 citations

Study on Quantum Discord in Mixed Three-Level States via Quantum Graph Scattering

慧 何

Advances in Applied Mathematics•Jan 1, 2026•0 citations

Quantum Discord of Certain Two-Qubit States

Jianming Zhou, Xiaoli Hu, Naihuan Jing

arXiv:2004.11668•International Journal of Theoretical Physics•Nov 19, 2019•14 citations

Zero discord quantum states arising from weighted digraphs.

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

In this paper we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and we call them graph Laplacian quantum states. Then we obtain structural properties of these graphs such that the corresponding graph Laplacian states have zero quantum discord by investigating structural properties of clustered graphs which provide a family of commuting normal matrices formed by the blocks of its Laplacian matrices. We apply these results on some important mixed quantum states, such as the Werner, Isotropic, and $X$-states.

•May 2, 2017•4 citations

On the quantum discord of general X states

Mikhail A. Yurischev

arXiv:1503.00840•Quantum Information Processing•Jun 12, 2015•43 citations
In this paper we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and we call them graph Laplacian quantum states. Then we obtain structural properties of these graphs such that the corresponding graph Laplacian states have zero quantum discord by investigating structural properties of clustered graphs which provide a family of commuting normal matrices formed by the blocks of its Laplacian matrices. We apply these results on some important mixed quantum states, such as the Werner, Isotropic, and XXX-states.