Related papers: Entangled graphs: A classification of four-qubit e…
The following comment is based on an article by M. Jafarpour and L. Assadi [Eur. Phys. J. D 70, 62 (2016), doi:10.1140/epjd/e2016-60555-5] which with an exploitation of Scott measure (or generalized Meyer-Wallach measure) the entanglement…
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.…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
We propose a new approach to the geometry of the four-qubit entanglement classes depending on parameters. More precisely, we use invariant theory and algebraic geometry to describe various stratifications of the Hilbert space by SLOCC…
Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring…
A classification of multipartite entanglement in qubit systems is introduced for pure and mixed states. The classification is based on the robustness of the said entanglement against partial trace operation. Then we use current machine…
Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…
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,…
Classifying states as entangled or separable is a highly challenging task, while it is also one of the foundations of quantum information processing theory. This task is higly nontrivial even for relatively simple cases, such as two-qutrit…
A general framework is developed for separating classical and quantum correlations in a multipartite system. Entanglement is defined as the difference in the correlation information encoded by the state of a system and a suitably defined…
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
The notion of entanglement is the most well-known nonclassical correlation in quantum mechanics and a fundamental resource in quantum information and computation. This correlation, which is displayed by certain classes of quantum states, is…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in…
It is well known that the number of entanglement classes in SLOCC (stochastic local operations and classical communication) classifications increases with the number of qubits and is already infinite for four qubits. Bearing in mind the…
We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ''two-colorable'' graphs. The upper bound of entanglement for five vertices ring graph state is improved to 2.9275, less than upper…
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…