Related papers: A Graph-Theoretical Framework to Analyse Zero Disc…
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…
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…
Quantum discord goes beyond entanglement and exists in a wide range of quantum states that may be separable, playing a crucial role in quantum information tasks. In this paper, we firstly proposed a zero-discord criterion for two-qubit…
Quantum discord is a measure of the quantumness of correlations. After reviewing its different versions and properties, we apply it to the questions of quantum information processing. First we show that changes in discord in the processed…
We investigate the undetermined sets consisting of two-level, multi-partite pure quantum states, whose reduced density matrices give absolutely no information of their original states. Two approached of finding these quantum states are…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
We propose a new criterion to judge zero quantum discord for arbitrary bipartite states. A bipartite quantum state has zero quantum discord if and only if all blocks of its density matrix are normal matrices and commute with each other.…
Quantum discord characterizes "non-classicality" of correlations in quantum mechanics. It has been proposed as the key resource present in certain quantum communication tasks and quantum computational models without containing much…
The description of the dynamics of a system that may be correlated with its environment is only meaningful within the context of a specific framework. Different frameworks rely upon different assumptions about the initial system-environment…
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…
We introduce a simple and efficient technique to verify quantum discord in unknown Gaussian states and a certain class of non-Gaussian states. We show that any separation in the peaks of the marginal distributions of one subsystem…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
Graph states are used to represent mathematical graphs as quantum states on quantum computers. They can be formulated through stabilizer codes or directly quantum gates and quantum states. In this paper we show that a quantum graph neural…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…