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

Advances in Applied Mathematics

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

慧 何

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.12677/aam.2026.154150

Related papers

Quantum discord of states arising from graphs

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

arXiv:1702.06360•Quantum Information Processing•Jun 17, 2017•9 citations

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

Condition for zero and nonzero discord in graph Laplacian quantum states

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that every combinatorial graph corresponds to quantum states whose characteristics are reflected in the structure of the underlined graph. A number of combinatorial relations between quantum discord and simple graphs were studied. To extend the scope of these studies, we need to generalize the earlier concepts applicable to simple graphs to weighted graphs, corresponding to a diverse class of quantum states. To this effect, 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 call them graph Laplacian quantum states. We find the graph theoretic conditions for zero and nonzero quantum discord for these states. We apply these results on some important pure two qubit states, as well as a number of mixed quantum states, such as the Werner, Isotropic, and [Formula: see text]-states. We also consider graph Laplacian states corresponding to simple graphs as a special case.

arXiv:1705.00808•International Journal of Quantum Information•Mar 1, 2019•4 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

A study on quantum discord in Gaussian states

Xiong Yang, Guo Hui Huang, Mao Fa Fang

Optics Communications•Nov 25, 2014•9 citations

Hilbert–Schmidt Measure of Pairwise Quantum Discord for Three-Qubit X States

Mohammed Daoud A, R. Ahl Laamara, S. Seddik

The Hilbert-Schmidt distance between a mixed three-qubit state and its closest state is used to quantify the amount of pairwise quantum correlations in a tripartite system.Analytical expressions of geometric quantum discord are derived.A particular attention is devoted to two special classes of three-qubit X states.They include three-qubit states of W, GHZ and Bell type.We also discuss the monogamy property of geometric quantum discord in some mixed three-qubit systems.

•Oct 1, 2015•2 citations
This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that every combinatorial graph corresponds to quantum states whose characteristics are reflected in the structure of the underlined graph. A number of combinatorial relations between quantum discord and simple graphs were studied. To extend the scope of these studies, we need to generalize the earlier concepts applicable to simple graphs to weighted graphs, corresponding to a diverse class of quantum states. To this effect, 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 call them graph Laplacian quantum states. We find the graph theoretic conditions for zero and nonzero quantum discord for these states. We apply these results on some important pure two qubit states, as well as a number of mixed quantum states, such as the Werner, Isotropic, and [Formula: see text]-states. We also consider graph Laplacian states corresponding to simple graphs as a special case.
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.