Related papers: Entangled graphs: A classification of four-qubit e…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
We prove that there is a unique graph with four edges which is the Gruenberg-Kegel graph of a solvable cut group. This contributes to the classification of the Gruenberg-Kegel graphs of solvable cut groups initiated in [A. B\"achle, A.…
We investigate the geometry of the four qubit systems by means of algebraic geometry and invariant theory, which allows us to interpret certain entangled states as algebraic varieties. More precisely we describe the nullcone, i.e., the set…
Given a finite group G with a bilocal representation, we investigate the bipartite entanglement in the state constructed from the group algebra of G acting on a separable reference state. We find an upper bound for the von Neumann entropy…
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite…
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
We study the entanglement in tripartite quantum systems by using the principal basis matrix representations of density matrices. Using the Schmidt decomposition and local unitary transformation, we first convert the general states to…
Genuine multipartite entanglement is crucial for quantum information and related technologies but quantifying it has been a long-standing challenge. Most proposed measures do not meet the ``genuine'' requirement, making them unsuitable for…
We propose two classes of the generalized concurrence vectors of the multipartite systems consisting of qubits. Making use of them, we are able to, respectively, describe and quantify GHZ-class and W-class entanglement both in total and…
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation,…
A connected graph is 4-connected if it contains at least five vertices and removing any three of them does not disconnect it. A frequent preprocessing step in graph drawing is to decompose a plane graph into its 4-connected components and…
We consider two measures of entanglement, the logarithmic negativity and the entanglement entropy, between regions of space in excited states of many-body systems formed by a finite number of particle excitations. In parts I and II of the…
In recent years, the import of quantum information techniques in quantum gravity opened new perspectives in the study of the microscopic structure of spacetime. We contribute to such a program by establishing a precise correspondence…
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the…
A maximally entangled state is a quantum state which has maximum von Neumann entropy for each bipartition. Through proposing a new method to classify quantum states by using concurrences of pure states of a region, one can apply Bell's…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
We find an operational interpretation for the 4-tangle as a type of residual entanglement, somewhat similar to the interpretation of the 3-tangle. Using this remarkable interpretation, we are able to find the class of maximally entangled…
It has been recently shown (Bartlett et al. 2003) that information encoded into relative degrees of freedom enables communication without a common reference frame using entangled bipartite states. In this case the relative information…
Although quantum entanglement is an important resource, its characterization is quite challenging. The partial transposition is a common method to detect bipartite entanglement. In this paper, the authors study the…