Related papers: The Structure of Circle Graph States
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…
We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of…
Improving the simulation of quantum circuits on classical computers is important for understanding quantum advantage and increasing development speed. In this paper, we explore a new way to express stabilizer states and further improve the…
Scaled graphs (SGs) offer a geometric framework for feedback stability analysis. This paper develops containment conditions for SGs within multiplier-defined regions, addressing both circular and conic geometries. For circular regions, we…
Efficient methods for the representation and simulation of quantum states and quantum operations are crucial for the optimization of quantum circuits. Decision diagrams (DDs), a well-studied data structure originally used to represent…
Model checking large networks of processes is challenging due to state explosion. In many cases, individual processes are isomorphic, but there is insufficient global symmetry to simplify model checking. This work considers the verification…
The study of state transformations under local operations and classical communication (LOCC) plays a crucial role in entanglement theory. While this has been long ago characterized for pure bipartite states, the situation is drastically…
$k$-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realization of $k$-uniform states, at scale, faces major obstacles:…
Central in entanglement theory is the characterization of local transformations among pure multipartite states. As a first step towards such a characterization, one needs to identify those states which can be transformed into each other via…
Local complementation of a graph $G$ on vertex $v$ is an operation that results in a new graph $G*v$, where the neighborhood of $v$ is complemented. Two graph are locally equivalent if on can be reached from the other one through local…
Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and…
This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the…
Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…
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…
We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirected edges, as the density matrix stabilized by the associated…
We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of…
We investigate the equivalence of quantum states under local unitary transformations. A complete set of invariants under local unitary transformations is presented for a class of mixed states. It is shown that two states in this class are…
An equitable coloring of a graph is a proper coloring where the sizes of any two distinct color classes differ by at most one. The celebrated Chen-Lih-Wu Conjecture (CLWC for short) states that every connected graph $G$ that is neither an…
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…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…