Skip to main content
Share Your Experience: Take the 2024 Developer Survey
6 votes
Accepted

Semi-definite program for smooth min-entropy

You do not need a double objective function to solve this. Given $\rho_{AB}$ let $\rho_{ABC}$ be any purification of $\rho_{AB}$. Then we can write the smooth min-entropy as the following SDP \begin{...
Rammus's user avatar
  • 5,853
4 votes
Accepted

Semi-definite program for conditional smooth max-entropy

Yes, you can formulate the smooth max-entropy as an SDP. The author of the book you linked notes this when they explain how to derive the SDP for the smooth min-entropy that you reference on page 91. ...
Rammus's user avatar
  • 5,853
3 votes
Accepted

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

A simple counterexample but perhaps I'm misinterpreting "one affine equation". Take the map $\Lambda$ to be the identity map and let $Y$ be any mixed state. Then the set of states satisfying ...
Rammus's user avatar
  • 5,853
2 votes

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

I think I have an answer. The following should be the CVX code for one of the formulations found in this link. ...
QuestionEverything's user avatar
1 vote

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

This is generally not the case. One example is the set of CPTP maps. Under the Choi-Jamiołkowski isomorphism, this set corresponds to a set of quantum states intersected with an affine hyperplane ...
Markus Heinrich's user avatar
1 vote

$3 \rightarrow 1$ QRAC encoding for XOR functions

I found a way to do it for the $2\to1$ QRAC. I simply guessed that we could leave the measurement bases as they are, $Z$ for the first bit, and $X$ for the second bit, and added $Y$ as the basis with ...
Mateus Araújo's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible