Related papers: Entanglement in eight-qubit graph states
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
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…
The familiar Greenberger-Horne-Zeilinger (GHZ) states can be rewritten by entangling the Bell states for two qubits with a state of the third qubit, which is dubbed entangled entanglement. We show that in this way we obtain all 8…
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),…
Grid states form a discrete set of mixed quantum states that can be described by graphs. We characterize the entanglement properties of these states and provide methods to evaluate entanglement criteria for grid states in a graphical way.…
As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties…
In quantum information context, the groups generated by Pauli spin matrices, and Dirac gamma matrices, are known as the single qubit Pauli group P, and two-qubit Pauli group P2, respectively. It has been found [M. Socolovsky, Int. J. Theor.…
In this letter we have established the physical character of pure bipartite states with the same amount of entanglement in the same Schmidt rank that either they are local unitarily connected or they are incomparable. There exist infinite…
Nonlocal unitary operations can create quantum entanglement between distributed particles, and the quantification of created entanglement is a hard problem. It corresponds to the concepts of entangling and assisted entangling power when the…
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…
We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for…
The Schmidt coefficients capture all entanglement properties of a pure bipartite state and therefore determine its usefulness for quantum information processing. While the quantification of the corresponding properties in mixed states is…
We show that the manifold of quantum states is endowed with a rich and nontrivial geometric structure. We derive the Fubini-Study metric of the projective Hilbert space of a multi-qubit quantum system, endowing it with a Riemannian metric…
Quantum entanglement is an important resource in many modern technologies, like quantum computation or quantum communication and information processing. Therefore, most interest is given to detect and quantify entangled states. Entanglement…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
The name graph state is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computing, and which has a natural graphical description. We present the…
Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics, and has been widely explored with…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
Graph states are a key resource for measurement-based quantum computation and quantum networking, but state-preparation costs limit their practical use. Graph states related by local complement (LC) operations are equivalent up to…
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measurement-only quantum computation. We focus in this paper on the…