Related papers: Improved Semidefinite Programming Upper Bound on D…
Using a geometric measure of entanglement quantification based on Euclidean distance of the Hermitian matrices, we obtain the minimum distance between a bipartite bound entangled $n$- qudit density matrix and the maximally mixed state.This…
We introduce a new class of semidefinite programming (SDP) relaxations for sparse box-constrained quadratic programs, obtained by a novel integration of the Reformulation Linearization Technique into standard SDP relaxations while…
With a probability of success of $95 \%$ we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally…
A lower bound on the amount of noise that must be added to a GHZ-like entangled state to make it separable (also called the random robustness) is found using the transposition condition. The bound is applicable to arbitrary numbers of…
We show that all quantum states that do not have a positive partial transpose are distillable via channels, which preserve the positivity of the partial transpose. The question whether NPT bound entanglement exist is therefore closely…
Motivated by applications in wireless communications, this paper develops semidefinite programming (SDP) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation…
The notion of distillable entanglement is one of the fundamental concepts of quantum information theory. Unfortunately, there is an apparent mismatch between the intuitive and rigorous definitions of distillable entanglement. To be precise,…
Historically, the focus in entanglement distillation has predominantly been on the distillable entanglement, and the framework assumes complete knowledge of the initial state. In this paper, we study the reliability function of entanglement…
We investigate optimal separable approximations (decompositions) of states rho of bipartite quantum systems A and B of arbitrary dimensions MxN following the lines of Ref. [M. Lewenstein and A. Sanpera, Phys. Rev. Lett. 80, 2261 (1998)].…
A deep understanding of quantum entanglement is vital for advancing quantum technologies. The strength of entanglement can be quantified by counting the degrees of freedom that are entangled, which results in a quantity called Schmidt…
We introduce a reversible theory of exact entanglement manipulation by establishing a necessary and sufficient condition for state transfer under trace-preserving transformations that completely preserve the positivity of partial transpose…
Quantum Internet relies on quantum entanglement as a fundamental resource for secure and efficient quantum communication, reshaping data transmission. In this context, entanglement distillation emerges as a crucial process that plays a…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…
Semidefinite programs (SDPs) are a particular class of convex optimization problems with applications in combinatorial optimization, operational research, and quantum information science. Seminal work by Brand\~{a}o and Svore shows that a…
A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438] in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their…
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta-Borderi-Fawzi-Scholz, Mathematical Programming, 2021]…
The discovery of entangled quantum states from which one cannot distill pure entanglement constitutes a fundamental recent advance in the field of quantum information. Such bipartite bound-entangled (BE) quantum states \emph{could} fall…
Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and…
Bipartite entangled quantum states with a positive partial transpose (PPT), i.e., PPT entangled states, are usually considered very weakly entangled. Since no pure entanglement can be distilled from them, they are also called bound…
We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS) states. First, we show that separability in the case of DS in $C^d\otimes C^d$ (symmetric qudits) can be…