Related papers: Strong NP-Hardness of the Quantum Separability Pro…
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon…
We analyse the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view this problem is equivalent to that of embedding a simplex of points whose distances are maximal with…
One of the many interesting features of quantum nonlocality is that the states of a multipartite quantum system cannot always be distinguished as well by local measurements as they can when all quantum measurements are allowed. In this…
We exhibit a two-parameter family of bipartite mixed states $\rho_{bc}$, in a $d\otimes d$ Hilbert space, which are negative under partial transposition (NPT), but for which we conjecture that no maximally entangled pure states in $2\otimes…
Quantum entanglement has been regarded as one of the key physical resources in quantum information sciences. However, the determination of whether a mixed state is entangled or not is generally a hard issue, even for the bipartite system.…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…
We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all…
Entanglement, and quantum correlation, are precious resources for quantum technologies implementation based on quantum information science, such as, for instance, quantum communication, quantum computing, and quantum interferometry.…
Compelling evidence-though yet no formal proof--has been adduced that the probability that a generic two-qubit state ($\rho$) is separable is $\frac{8}{33}$ (arXiv:1301.6617, arXiv:1109.2560, arXiv:0704.3723). Proceeding in related…
For a given density matrix $\rho$ of a bipartite quantum system an asymptotical separability criterion is suggested. Using the continuous ensemble method, a sequence of separable density matrices is built which converges to $\rho$ if and…
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.…
A map $\mathcal{P}$ is tensor stable positive (tsp) if $\mathcal{P}^{\otimes n}$ is positive for all $n$, and essential tsp if it is not completely positive or completely co-positive. Are there essential tsp maps? Here we prove that there…
For a given Hamiltonian $H$ on a multipartite quantum system, one is interested in finding the energy $E_0$ of its ground state. In the separability approximation, arising as a natural consequence of measurement in a separable basis, one…
The geometric measure of entanglement of a pure quantum state is defined to be its distance to the space of product (seperable) states. Given an $n$-partite system composed of subsystems of dimensions $d_1,\ldots, d_n$, an upper bound for…
This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled…
Detection of entanglement in quantum states is one of the most important problems in quantum information processing. However, it is one of the most challenging tasks to find a universal scheme which is also desired to be optimal to detect…
To determine whether a given multipartite quantum state is separable with respect to some partition we construct a family of entanglement measures R_m. This is done utilizing generalized concurrences as building blocks which are defined by…
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…
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…
In this work, we explore the space of quantum states composed of $N$ particles. To investigate the entanglement resistant to particles loss, we introduce the notion of $m$-resistant states. A quantum state is $m$-resistant if it remains…