# Questions tagged [semidefinite-programming]

Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize) over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron. (Wikipedia)

10 questions
Filter by
Sorted by
Tagged with
69 views

### Are all extremal points of the feasible set of an arbitrary affine equation pure states?

Suppose I have one constraint on quantum states, i.e., $\Lambda(\rho)=Y$ where $Y$ is a Hermitian matrix and $\Lambda$ is a linear and Hermitian preserving map. Note that $\rho$ and $Y$ can in general ...
1 vote
75 views

### Semi-Definite Program to maximise $P(X)$ with a fixed CHSH value

This question should be theoretically simple, yet I'm struggling as something may be incorrect about my code. I am trying to plot a graph of the maximum probability ($P(x)$) of a given system against ...
421 views

### How to calculate the conditional min-entropy via a semidefinite program?

I am trying to formulate the calculation of conditional min-entropy as a semidefinite program. However, so far I have not been able to do so. Different sources formulate it differently. For example, ...
1 vote