2 papers
quant-ph2026
The complexity of semidefinite programs for testing -block-positivity
Qian Chen, Benoît Collins
We extend \cite{chen2025srkbp} by analyzing the complexity of the -block-positivity testing algorithm that stems from the optimization problem in Definition \ref{definition:SDP-…
quant-ph2025
Symmetry reduction for testing -block-positivity via extendibility
Qian Chen, Benoît Collins, Omar Fawzi
We study the problem of testing -block-positivity via symmetric -extendibility by taking the tensor product with a -dimensional maximally entangled state. We exploit the u…