Related papers: Locally inequivalent four qubit hypergraph states
The entanglement properties of a multiparty pure state are invariant under local unitary transformations. The stabilizer dimension of a multiparty pure state characterizes how many types of such local unitary transformations existing for…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
We study entanglement and non-locality of connected four-qubit hypergraph states. One obtains the SLOCC classification from the known LU-orbits. We then consider Mermin's polynomials and show that all four-qubit hypergraph states exhibit…
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…
Graph states are well-entangled quantum states that are defined based on a graph. Of course, if two graphs are isomorphic their associated states are the same. Also, we know local operations do not change the entanglement of quantum states.…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
Stabilizer states form a ubiquitous family of quantum states that can be graphically represented through the graph state formalism. A fundamental property of graph states is that applying a local complementation - a well-known and…
Hypergraph states are a special kind of multipartite states encoded by hypergraphs relevant in quantum error correction, measurement--based quantum computation, quantum non locality and entanglement. In a series of two papers, we introduce…
The necessary and sufficient conditions for the equivalence of arbitrary n-qubit pure quantum states under Local Unitary (LU) operations derived in [B. Kraus Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…
Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus…
Systems of four nonbinary particles, each having three or more internal states, exhibit maximally entangled states that are inaccessible to four qubits. This breaks the pattern of two- and three-particle systems, in which the existing graph…
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…
Kruszynska and Kraus [Phys. Rev. A 79, 052304 (2009)] have recently introduced the so-called locally maximally entanglable (LME) states of n qubits which can be maximally entangled to local auxiliary qubits using controlled operations. We…
In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and…
The n-qubit real equally weighted states are employed in some quantum algorithms including Deutsch-Jozsa, Grover, Simon, and so on. We qualitatively investigate the entanglement properties of n-qubit real equally weighted states. Firstly,…
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…
We reduce the necessary and sufficient biseparable conditions of the four qubit cluster diagonal state to concise forms. Only 4 out of the 15 parameters are proved to be relevant in specifying the genuine entanglement of the state. Using…