Related papers: Bipartite entanglement in AJL's algorithm for thre…
Absolutely Maximally Entangled (AME) states are important resources in quantum information processing; however, a general systematic approach for constructing these states remains a formidable challenge. We identify a finite-field rank…
We present methods for detecting entanglement around symmetric Dicke states. In particular, we consider N-qubit symmetric Dicke states with N/2 excitations. In the first part of the paper we show that for large N these states have the…
A complete analysis of entangled bipartite qutrit pure states is carried out based on a simple entanglement measure. An analysis of all possible extremally entangled pure bipartite qutrit states is shown to reduce, with the help of SLOCC…
We propose a directly measurable criterion for the entanglement of two qubits. We compare the criterion with other criteria, and we find that for pure states, and some mixed states, it coincides with the state's concurrency. The measure can…
We develop a concept of entanglement percolation for long-distance singlet generation in quantum networks with neighboring nodes connected by partially entangled bipartite mixed states. We give a necessary and sufficient condition on the…
The wedge product of vectors has been shown to yield the generalised entanglement measure I-concurrence, wherein the separability of the multiparty qubit system arises from the parallelism of vectors in the underlying Hilbert space of the…
Inspired by the `computable cross norm' or `realignment' criterion, we propose a new point of view about the characterization of the states of bipartite quantum systems. We consider a Schmidt decomposition of a bipartite density operator.…
Experimental determination of entanglement is important not only to characterize the state and use it in quantum information, but also in understanding complicated phenomena such as phase transitions. In this paper we show that in many…
In [Science 340, 1205, 7 June (2013)], via polytopes Michael Walter et al. proposed a sufficient condition detecting the genuinely entangled pure states. In this paper, assume that a state with six non-zero coefficients is not a trivially…
We use the linear programming algorithm introduced by Akulin et al. [V. M. Akulin, G. A. Kabatiansky, and A. Mandilara, Phys. Rev. A 92, 042322 (2015)] to perform best separable approximation on two-qutrit random density matrices. We…
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…
Employing the Pauli matrices, we have constructed a set of operators, which can be used to distinguish six inequivalent classes of entanglement under SLOCC (stochastic local operation and classical communication) for three-qubit pure…
If only limited control over a multiparticle quantum system is available, a viable method to characterize correlations is to perform random measurements and consider the moments of the resulting probability distribution. We present…
We show that the entanglement of a $2\times 2$ bipartite state can be improved and maximized probabilistically through single-qubit operations only. An experiment is proposed and it is numerically simulated.
Quantifying entanglement is an important issue in quantum information theory. Here we consider the entanglement measures through the trace norm in terms of two methods, the modified measure and the extended measure for bipartite states. We…
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…
We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the…
We investigate the entanglement properties in the symmetric subspace of $N$-partite $d$-dimensional systems (qudits). For diagonal symmetric states, we show that there is no bound entanglement for $d = 3,4 $ and $N = 3$. Further, we present…
We design and successfully implement artificial neural networks (ANNs) to detect and classify entanglement for three-qubit systems using limited state features. The overall design principle is a feed forward neural network (FFNN), with the…
We firstly investigate the multipartite entanglement features of the quantum states, including the iteration states achieved by repeated application of Grover iteration and the Oracle ones into which the above iteration states evolve by…