Related papers: A Graph-Theoretical Framework to Analyse Zero Disc…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by…
Braunstein et. al. have started the study of entanglement properties of the quantum states through graph theoretical approach. Their idea was to start from a simple unweighted graph $G$ and then they have defined the quantum state from the…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
Distinguishing sets of quantum states shared by two parties using only local operations and classical communication measurements is a fundamental topic in quantum communication and quantum information theory. We introduce a graph-theoretic…
In this thesis, we explore the intersection of two fundamental subfields of quantum information theory: quantum coherence and contextuality. Despite their apparent differences, both areas address key issues relevant to the foundations and…
We introduce a new model of background independent physics in which the degrees of freedom live on a complete graph and the physics is invariant under the permutations of all the points. We argue that the model has a low energy phase in…
We exploit quantum discord to detect quantum correlations for two-state Markov binary, which has broad of applications in quantum information theory. To calculate the correlation in Markov-binary, We wrote a transition matrix elements based…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
Effective state transfer is one of the most important problems in quantum information processing. Typically, a quantum information device is composed of many subsystems with multi-input ports. In this paper, we develop a general theory…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
Quantum discord quantifies quantum correlations beyond entanglement and assumes nonzero values, which are notoriously hard to compute, for almost all quantum states. Here we provide computable tight bounds for the quantum discord for…
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
A continuous-time quantum walk on a graph $X$ is represented by the complex matrix $\exp (-\mathrm{i} t A)$, where $A$ is the adjacency matrix of $X$ and $t$ is a non-negative time. If the graph models a network of interacting qubits,…
Quantum discord provides a measure for quantifying quantum correlations beyond entanglement and is very hard to compute even for two-qubit states because of the minimization over all possible measurements. Recently a simple algorithm to…
Quantum discord, a key indicator of non-classical correlations in bipartite systems, has been recently extended to multipartite scenarios [Phys. Rev. Lett. 2020, 124:110401]. We present exact analytic formulas for the quantum discord of…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum metrology exploits quantum mechanical laws to improve the precision in estimating technologically relevant parameters such as phase, frequency, or magnetic fields. Probe states are usually tailored on the particular dynamics whose…
Fair graph clustering is crucial for ensuring equitable representation and treatment of diverse communities in network analysis. Traditional methods often ignore disparities among social, economic, and demographic groups, perpetuating…
We bring together in one place some of the main results and applications from our recent works in quantum information theory, in which we have brought techniques from operator theory, operator algebras, and graph theory for the first time…
Bipartite and multipartite entangled states are of central interest in quantum information processing and foundational studies. Efficient verification of these states, especially in the adversarial scenario, is a key to various…