Related papers: Improved Semidefinite Programming Upper Bound on D…
Semidefinite programs (SDPs) are convex optimization programs with vast applications in control theory, quantum information, combinatorial optimization and operational research. Noisy intermediate-scale quantum (NISQ) algorithms aim to make…
Quantum coherence is one of the fundamental properties of quantum mechanics and also acts as a valuable resource for a variety of practical applications, which includes quantum computing and quantum information processing. Evaluating the…
Montanari and Richard (2015) asked whether a natural semidefinite programming (SDP) relaxation can effectively optimize $\mathbf{x}^{\top}\mathbf{W} \mathbf{x}$ over $\|\mathbf{x}\| = 1$ with $x_i \geq 0$ for all coordinates $i$, where…
Multipartite entanglement is a valuable resource for quantum technologies. However, detecting this resource can be challenging: for genuine multipartite entanglement, the detection may require global measurements that are hard to implement…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
Quantum communication and computation heavily rely on entanglement distillation protocols. There is a plethora of distillation protocols for Pauli channels and also for some non-Pauli channels. However, an effort to relate the effectiveness…
Although numerous measures of entanglement have been proposed so far, the calculation of a given faithful entanglement measure is a hard work since it is always involved in some optimization process. It is, therefore, important to estimate…
Entanglement distillation is the process of converting noisy entangled states into maximally entangled pure states via local operations and classical communication. A long-standing, unresolved question is which entangled states are amenable…
The framework of Integral Quadratic Constraints (IQC) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to a semi-definite program (SDP). In the case of over-relaxed Alternating Direction…
We show that a von Neumann measurement on a part of a composite quantum system unavoidably creates distillable entanglement between the measurement apparatus and the system if the state has nonzero quantum discord. The minimal distillable…
The Rains relative entropy of a bipartite quantum state is the tightest known upper bound on its distillable entanglement -- which has a crisp physical interpretation of entanglement as a resource -- and it is efficiently computable by…
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we…
We consider the problem of estimating the discrete clustering structures under the Sub-Gaussian Mixture Model. Our main results establish a hidden integrality property of a semidefinite programming (SDP) relaxation for this problem: while…
We characterize the operational task of environment-assisted distillation of quantum coherence under different sets of free operations when only a finite supply of copies of a given state is available. We first evaluate the one-shot…
We present a class of numerical algorithms which adapt a quantum error correction scheme to a channel model. Given an encoding and a channel model, it was previously shown that the quantum operation that maximizes the average entanglement…
The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…
We investigate the extent to which two particles can be maximally entangled when they are also similarly entangled with other particles on a complete graph, focusing on Werner, isotropic, and Brauer states. To address this, we formulate and…
This paper will address the question of the distillation of entanglement from a finite number of multi-partite mixed states. It is shown that if one can distill a pure entangled state from n copies of a mixed state $\sigma _{ABC...}$ there…
We present upper and lower bounds to the relative entropy of entanglement of multi-party systems in terms of the bi-partite entanglements of formation and distillation and entropies of various subsystems. We point out implications of our…
In quantum thermodynamics, a system is described by a Hamiltonian and a list of non-commuting charges representing conserved quantities like particle number or electric charge, and an important goal is to determine the system's minimum…