Related papers: Entanglement marginal problems
A fundamental problem in quantum physics is to establish whether a multiparticle quantum state can be uniquely determined from its local marginals. In theory, this problem has been addressed in the exact case where the marginals are…
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.…
Quantum entanglement between several particles is essential for applications like quantum metrology or quantum cryptography, but it is also central for foundational phenomena like quantum non-locality. This leads to the problem of…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces.…
Most states in the Hilbert space are maximally entangled. This fact has proven useful to investigate - among other things - the foundations of statistical mechanics. Unfortunately, most states in the Hilbert space of a quantum many body…
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show…
Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is challenging when it interacts with its…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
We present a numerical method for solving the separability problem of Gaussian quantum states in continuous-variable quantum systems. We show that the separability problem can be cast as an equivalent problem of determining the feasibility…
For many applications the presence of a quantum advantage crucially depends on the availability of resourceful states. Although the resource typically depends on the particular task, in the context of multipartite systems entangled quantum…
We introduce and discuss the concept of modular entanglement. This is the entanglement that is established between the end points of modular systems composed by sets of interacting moduli of arbitrarily fixed size. We show that end-to-end…
According to usual definitions, entangled states cannot be given a separable decomposition in terms of products of local density operators. If we relax the requirement that the local density operators be positive, then an entangled quantum…
Reduced density matrices are a powerful tool in the analysis of entanglement structure, approximate or coarse-grained dynamics, decoherence, and the emergence of classicality. It is straightforward to produce a reduced density matrix with…
We examine k-minimal and k-maximal operator spaces and operator systems, and investigate their relationships with the separability problem in quantum information theory. We show that the matrix norms that define the k-minimal operator…
The relation between entanglement entropy and the computational difficulty of classically simulating Quantum Mechanics is briefly reviewed. Matrix product states are proven to provide an efficient representation of one-dimensional quantum…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can…
A general and computable criterion for k-(in)separability in continuous multipartite quantum systems is presented. The criterion can be experimentally implemented with a finite and comparatively low number of local observables. We discuss…
Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is…
We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…