Related papers: The Structure of Circle Graph States

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…

An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical [n,k,d \ge…

We classify local unitary equivalence classes of symmetric states via a classification of their local unitary stabilizer subgroups. For states whose local unitary stabilizer groups have a positive number of continuous degrees of freedom,…

We classify, up to local unitary equivalence, the set of $n$-qubit states that is stabilized by the diagonal subgroup of the local unitary group. We exhibit a basis for this set, parameterized by diagrams of nonintersecting chords…

We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d-dimensional cluster states (d = 1,2,3), the Greenberger-Horne-Zeilinger states, and some related mixed states. The entanglement…

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…

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 present a fine-structure entanglement classification under stochastic local operation and classical communication (SLOCC) for multiqubit pure states. To this end, we employ specific algebraic-geometry tools that are SLOCC invariants,…

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),…

We introduce an open-source software library Graphix, which optimizes and simulates measurement-based quantum computation (MBQC). By combining the measurement calculus with an efficient graph state simulator, Graphix allows the classical…

Extending upon the observations of the emergence of quantum-like states from classical complex synchronized networks, this work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the…

Graph states are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also used for many quantum protocols (error correction, secret sharing, etc.). The main focus of this paper is to provide a…

We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semi-local Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical…

In [Phys. Rev. A 69, 022316 (2004)] we presented a description of the action of local Clifford operations on graph states in terms of a graph transformation rule, known in graph theory as \emph{local complementation}. It was shown that two…

In this paper we study the equivalence of quantum stabilizer codes via symplectic isometries of stabilizer codes. We define monomially and symplectically equivalent stabilizer codes and determine how different the two notions can be.…

One of the key ingredients of many LOCC protocols in quantum information is a multiparticle (locally) maximally entangled quantum state, aka a critical state, that possesses local symmetries. We show how to design critical states with…

Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum distance…

Graph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure. They are also intimately related to IQP circuits, which have applications in quantum…

Local unitary invariants allow one to test whether multipartite states are equivalent up to local basis changes. Equivalently, they specify the geometry of the "orbit space" obtained by factoring out local unitary action from the state…

Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to…