Benoît Collins

most citedSymmetry reduction for testing

k

-block-positivity via extendibility

64 citations · 64 across the 2 of their papers we have counts for

collaborators

2 papers

quant-ph2026

The complexity of semidefinite programs for testing $k$ -block-positivity

Qian Chen, Benoît Collins

We extend \cite{chen2025srkbp} by analyzing the complexity of the $k$ -block-positivity testing algorithm that stems from the optimization problem in Definition \ref{definition:SDP-…

quant-ph2025★ 64 cited

Symmetry reduction for testing $k$ -block-positivity via extendibility

Qian Chen, Benoît Collins, Omar Fawzi

We study the problem of testing $k$ -block-positivity via symmetric $N$ -extendibility by taking the tensor product with a $k$ -dimensional maximally entangled state. We exploit the u…

The complexity of semidefinite programs for testing k-block-positivity

Symmetry reduction for testing k-block-positivity via extendibility

The complexity of semidefinite programs for testing $k$ -block-positivity

Symmetry reduction for testing $k$ -block-positivity via extendibility