Related papers: Improved Semidefinite Programming Upper Bound on D…
A power system unit commitment (UC) problem considering uncertainties of renewable energy sources is investigated in this paper, through a distributionally robust optimization approach. We assume that the first and second order moments of…
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running…
While the detection of entanglement has been proved already to be quite a difficult task, experimental quantification of entanglement is even more challenging. In this work, we derive an analytical lower bound for the concurrence of a…
In this paper, we study a class of fractional semi-infinite polynomial programming problems involving s.o.s-convex polynomial functions. For such a problem, by a conic reformulation proposed in our previous work and the quadratic modules…
We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in $\{0, \pm 1\}$. While semidefinite programming (SDP) techniques are well established for $\{0,1\}$-…
Constraint-solving-based program invariant synthesis takes a parametric invariant template and encodes the (inductive) invariant conditions into constraints. The problem of characterizing the set of all valid parameter assignments is…
In this paper we study the relationship between the optimal value of a homogeneous quadratic optimization problem and that of its Semidefinite Programming (SDP) relaxation. We consider two quadratic optimization models: (1) $\min \{x^* C x…
One of the fundamental concepts of quantum information theory is that of entanglement purification; that is, the transformation of a partially entangled state into a smaller-dimensional, more completely entangled state. Of particular…
There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…
We present an inequality for detecting entanglement and distillability of arbitrary dimensional bipartite systems. This inequality provides a sufficient condition of entanglement for bipartite mixed states, and a necessary and sufficient…
We find a universal lower bound on locally accessible information for arbitrary bipartite quantum ensembles, when one of the parties is two-dimensional. In higher dimensions and in higher number of parties, the lower bound is on accessible…
We study T-semidefinite programming (SDP) relaxation for constrained polynomial optimization problems (POPs). T-SDP relaxation for unconstrained POPs was introduced by Zheng, Huang and Hu in 2022. In this work, we propose a T-SDP relaxation…
Kohn-Sham density functional theory (DFT) has long struggled with the accurate description of strongly correlated and open shell systems and improvements have been minor even in the newest hybrid functionals. In this Letter we treat the…
It is well known that any entangled mixed state in $2\otimes 2$ systems can be purified via infinite copies of the mixed state. But can one distill a pure maximally entangled state from finite copies of a mixed state in any bipartite system…
Quantum entanglement is a useful resource for implementing communication tasks. However, for the resource to be useful in practice, it needs to be accessible by parties with bounded computational resources. Computational entanglement…
The squashed entanglement is a fundamental entanglement measure in quantum information theory, finding application as an upper bound on the distillable secret key or distillable entanglement of a quantum state or a quantum channel. This…
It is very crucial to know that whether the quantum state generated in the experiment is entangled or not. In the literature, this topic was studied extensively and researchers proposed different approaches for the detection of mixed…
We present a semidefinite program (SDP) algorithm to find eigenvalues of Schr\"{o}dinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the…
We introduce systematically with the help of Weyl operators novel classes of multipartite and multidimensional states which are all bound entangled for arbitrary dimension. We find that the entanglement is bound due to different reasons:…
Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable…