Related papers: Improved Semidefinite Programming Upper Bound on D…
Genuine high-dimensional entanglement, i.e. the property of having a high Schmidt number, constitutes a resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT), on…
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the…
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this work, we study the non-asymptotic…
We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice ${\bf Z}^n$. We present a simple semidefinite programming (SDP) relaxation for obtaining a nontrivial lower bound on the optimal value of the…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
We present a practical entanglement distillation protocol (EDP) with linear optics for a genuine mixed state. Each components of the genuine mixed state is a pure less-entangled state. After successfully performing this EDP, we can obtain a…
A bipartite subspace $S$ is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer $k$, there is no PPT operator supporting on the orthogonal complement of $S^{\otimes k}$. We show that a…
Semidefinite programs (SDP) are one of the most versatile frameworks in numerical optimization, serving as generalizations of many conic programs and as relaxations of NP-hard combinatorial problems. Their main drawback is their…
Quantum entanglement lies at the heart of quantum information science, yet its reliable detection in high-dimensional or noisy systems remains a fundamental computational challenge. Semidefinite programming (SDP) hierarchies, such as the…
Entanglement distillation is a key task in quantum-information processing. In this paper, we distill non-positive-partial-transpose (NPT) bipartite states of some given Schmidt rank and matrix rank. We show that all bipartite states of…
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…
Complex Semi-Definite Programming (SDP) is introduced as a novel approach to phase retrieval enabled control of monochromatic light transmission through highly scattering media. In a simple optical setup, a spatial light modulator is used…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
In bipartite quantum systems of dimension 3x3 entangled states that are positive under partial transposition (PPT) can be constructed with the use of unextendible product bases (UPB). As discussed in a previous publication all the lowest…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the…
In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assistance. Notably, we utilize the isotropic subgroup of the…
Higher-dimensional quantum systems are attracting interest for improving quantum protocol performance by increasing memory space. Characterizing quantum resources of such systems is fundamental but experimentally costly. We tackle the first…
It is shown that, if the loss of entanglement along a quantum channel is sufficiently small, then approximate quantum error correction is possible, thereby generalizing what happens for coherent information. Explicit bounds are obtained for…
In general the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the the convex semi-definite programming method, the robustness of entanglement of some mixed…