As of May 31, 2023, we have updated our Code of Conduct.

# 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)

4 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
99 views

### Forbidden/allowed outputs of a quantum channel

The coherent information of a channel $\mathcal{E}_{A'\rightarrow B}$ is defined as the maximum value obtained by the following function where the maximization is over all input states I_{\rm{coh}}(...
• 2,367
397 views

### How can I implement partial transpose on a variable in Picos (Python, trying to solve an SDP)?

I try to optimise a quantity via an SDP. I optimise over all PPT measurement operators and hence have the constraints $\Pi_k^{T_B} \succeq 0$ (PPT) for my measurement operators. The part of the code ...
• 121
70 views

### Quantum Optimization algorithms

The Harrow-Hassidim-Lloyd (HHL) algorithm for quantum matrix inversion (linear algebra) bridges classical math to quantum math and has been adopted for quantumizing many classical applications, such ...
• 945
1 vote
I am trying to minimize the largest component of a vector $x = [x_1, x_2, x_3, x_4]$, where $x_1 \ge x_2 ... \ge x_4$, such that it satisfies a set of linear inequalities $A, b$ in the following way: \$...