Related papers: Improved Semidefinite Programming Upper Bound on D…
We present a lower bound of concurrence for arbitrary dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient…
Positive maps that are not decomposable are a key resource in entanglement theory because they can detect bound entangled states, yet systematic methods for constructing them remain limited. We introduce an optimization framework based on…
In this thesis there are two topics: On the entangling capacity, in terms of negativity, of quantum operations, and on the supremum of negativity for symmetric Gaussian states. Positive partial transposition (PPT) states are an important…
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the…
Quantum channel discrimination is a fundamental task in quantum information processing. In the one-shot regime, discrimination between two candidate channels is characterized by the diamond norm. Beyond this basic setting, however, many…
We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as Robust Semidefinite Programs (RSDP). We propose, using well known properties of RSDP, several…
It is known that he bipartite quantum states, with rank strictly smaller than the maximum of the ranks of its two reduced states, are distillable by local operations and classical communication. Our first main result is that this is also…
We consider the problem of existence of bound entangled states with non-positive partial transpose (NPT). As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover it would rule out…
A matrix optimization problem over an uncertain linear system on finite horizon (abbreviated as MOPUL) is studied, in which the uncertain transition matrix is regarded as a decision variable. This problem is in general NP-hard. By using the…
In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate `high-level' theory and glued together self-consistently by a less accurate `low-level' theory at the…
We study optimization programs given by a bilinear form over non-commutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical…
The distillable randomness of a bipartite quantum state is an information-theoretic quantity equal to the largest net rate at which shared randomness can be distilled from the state by means of local operations and classical communication.…
We investigate so-called localisable information of bipartite states and a parallel notion of information deficit. Localisable information is defined as the amount of information that can be concentrated by means of classical communication…
The sum-rank metric provides a unifying framework that generalizes both the celebrated Hamming and rank metrics, and has found applications in areas such as network coding, distributed storage, and space-time coding. A central problem is to…
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…
Low-rank methods for semidefinite programming (SDP) have gained a lot of interest recently, especially in machine learning applications. Their analysis often involves determinant-based or Schatten-norm penalties, which are hard to implement…
The goal of entanglement distillation is to turn a large number of weakly entangled states into a smaller number of highly entangled ones. Practical entanglement distillation schemes offer a tradeoff between the fidelity to the target…
An important open problem in quantum information theory is the question of the existence of NPT bound entanglement. In the past years, little progress has been made, mainly because of the lack of mathematical tools to address the problem.…
We show that bipartite quantum states of any dimension, which do not have a positive partial transpose, become 1-distillable when one adds an infinitesimal amount of bound entanglement. To this end we investigate the activation properties…
We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of…