In this paper, we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph theoretical counterpart of the familiar PPT criterion for separability, although there are entangled states with positive partial transpose for which degree criterion fails. Here, we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m × n arising from partially symmetric graphs. We identify partially asymmetric graphs which lack the property of partial symmetry. Finally we develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

We consider two non-Markovian models: Random Telegraph Noise (RTN) and non-Markovian dephasing (NMD). The memory in these models is studied from the perspective of quantum Fisher information flow. This is found to be consistent with the other well known witnesses of non-Markovianity. The two noise channels are characterized quantum information theoretically by studying their gate and channel fidelities. Further, the quantum coherence and its balance with mixedness is studied. This helps to put in perspective the role that the two noise channels can play in various facets of quantum information processing and quantum communication.

Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian matrix, what would be the corresponding graph and how does one implement local unitary transformations graphically? We answer this question by developing the notion of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single-qubit Pauli and Hadamard gates. We also show how graph switching can be used to implement the action of the CNOT gate, resulting in a graphical description of Bell state generation.Comment: 20 pages, version very similar to the one published in quantum information processin

Quantum discord refers to an important aspect of quantum correlations for bipartite quantum systems. In our earlier works we have shown that corresponding to every graph (combinatorial) there are quantum states whose properties are reflected in the structure of the corresponding graph. Here, we attempt to develop a graph theoretic study of quantum discord that corresponds to a necessary and sufficient condition of zero quantum discord states which says that the blocks of density matrix corresponding to a zero quantum discord state are normal and commute with each other. These blocks have a one to one correspondence with some specific subgraphs of the graph which represents the quantum state. We obtain a number of graph theoretic properties representing normality and commutativity of a set of matrices which are indeed arising from the given graph. Utilizing these properties we define graph theoretic measures for normality and commutativity that results a formulation of graph theoretic quantum discord. We identify classes of quantum states with zero discord using the said formulation.

No abstract