Related papers: Entangled graphs: A classification of four-qubit e…
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,…
We show that a single polynomial entanglement measure is enough to verify equivalence between generic $n$-qubit states under Stochastic Local Operations with Classical Communication (SLOCC). SLOCC operations may be represented geometrically…
Quantifying the entanglement generation of a multipartite unitary operation is a key problem in quantum information processing. We introduce the definition of multipartite entangling, assisted entangling, and disentangling power, which is a…
A multipartite entanglement measure called the ent is presented and shown to be an entanglement monotone, with the special property of automatic normalization. Necessary and sufficient conditions are developed for constructing maximally…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY.…
Understanding the structure of multi-qubit quantum states is essential for both quantum information research and education, yet intuitive visualization beyond the single-qubit Bloch sphere remains challenging. In this work, we propose a…
We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell's inequality without performing a partial trace operation. This proposal is demonstrated by bridging the maximum violation of the…
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 analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…
We present a package of mathematical theorems, which allow to construct multipartite entanglement criteria. Importantly, establishing bounds for certain classes of entanglement does not take an optimization over continuous sets of states.…
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…
The aim of the paper is to propose geometric descriptions of multipartite entangled states using algebraic geometry. In the context of this paper, geometric means each stratum of the Hilbert space, corresponding to an entangled state, is an…
A generic scheme for the parametrization of mixed state systems is introduced, which is then adapted to bipartite systems, especially to a 2-qubit system. Various features of 2-qubit entanglement are analyzed based on the scheme. Our…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be…
We derive a classification and a measure of classical- and quantum-correlation of multipartite qubit, qutrit, and in general, $n$-level systems, in terms of SU$(n)$ representations of density matrices. We compare the measure for the case of…
We prove that the vast majority of symmetric states of qubits can be decomposed in a unique way into a superposition of spin 1/2 coherent states. For the case of two qubits, the proposed decomposition reproduces the Schmidt decomposition…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…
The work is intended to represent some interesting and apparently peculiar features of entangled system in both pure as well as mixed states level. In the pure state level, we are largely concerned about the existence and characteristics of…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…