Skip to main content

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)

Filter by
Sorted by
Tagged with
5 votes
1 answer
287 views

Semi-definite program for smooth min-entropy

The conditional min-entropy is defined as (wiki): $$ H_{\min}(A|B)_{\rho} \equiv -\inf_{\sigma_B}\inf_{\lambda}\{\lambda \in \mathbb{R}:\rho_{AB} \leq 2^{\lambda} \mathbb{I} \otimes \sigma_B\} $$ And ...
QuestionEverything's user avatar
5 votes
1 answer
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, ...
QuestionEverything's user avatar
5 votes
0 answers
105 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}}(...
user1936752's user avatar
  • 3,043
2 votes
2 answers
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 ...
narip's user avatar
  • 2,999
2 votes
1 answer
157 views

Semi-definite program for conditional smooth max-entropy

I am aware of a SDP formulation for smooth min-entropy: question link. That program for smooth min-entropy was found in this book by Tomachiel: page 91. However, I am yet to come across a semi-...
QuestionEverything's user avatar
2 votes
1 answer
80 views

$3 \rightarrow 1$ QRAC encoding for XOR functions

I'm currently working on QRAC and was wondering if there's an encoding protocol in $3 \rightarrow 1$ such that the receiver is able to retrieve any one of the XOR combinations of the bits, along with ...
Vaisakh M's user avatar
2 votes
0 answers
470 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 ...
root's user avatar
  • 121
2 votes
0 answers
85 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 ...
develarist's user avatar
1 vote
0 answers
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 ...
Largecooler21's user avatar
1 vote
0 answers
68 views

Linear and Logarithmic Constraint in Semidefinite Programming

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: $...
QuestionEverything's user avatar