Related papers: On the relation between a graph code and a graph s…
We study the notion of $k$-stabilizer universal quantum state, that is, an $n$-qubit quantum state, such that it is possible to induce any stabilizer state on any $k$ qubits, by using only local operations and classical communications.…
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
In this article, we study finite dynamical systems defined over graphs, where the functions are applied asynchronously. Our goal is to quantify and understand stability of the dynamics with respect to the update sequence, and to relate this…
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic study of the relations between them. As part of this study, we…
We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by…
This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…
A binary state on a graph means an assignment of binary values to its vertices. For example, if one encodes a network of spiking neurons as a directed graph, then the spikes produced by the neurons at an instant of time is a binary state on…
Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed…
The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and matching number (domination number, respectively), and…
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped…
Graph filtering is the cornerstone operation in graph signal processing (GSP). Thus, understanding it is key in developing potent GSP methods. Graph filters are local and distributed linear operations, whose output depends only on the local…
Quantum hypergraph states are the natural generalization of graph states. Here we investigate and analytically quantify entanglement and nonlocality for large classes of quantum hypergraph states. More specifically, we connect the geometric…
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…
In quantum computing and quantum information processing, graph states are a specific type of quantum states which are commonly used in quantum networking and quantum error correction. A recurring problem is finding a transformation from a…
Hypergraph states, a generalization of graph states, constitute a large class of quantum states with intriguing non-local properties and have promising applications in quantum information science and technology. In this paper, we generalize…
In the literature, several identification problems in graphs have been studied, of which, the most widely studied are the ones based on dominating sets as a tool of identification. Hereby, the objective is to separate any two vertices of a…
We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so…
In $2006$, Danielsen and Parker \cite{DP} proved that every self-dual additive code over $GF(4)$ is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method…
Some of the basic properties of any dynamical system can be summarized by a graph. The dynamical systems in our theory run from maps like the logistic map to ordinary differential equations to dissipative partial differential equations. Our…
The power graph $\mathcal{P}(G)$ is the simple undirected graph with group elements as a vertex set and two elements are adjacent if one of them is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph…