Robustness-of-magic upper bound for bipartite separable ENM states

Prove that every bipartite separable entirely nonlocal magic state with n qubits per party has robustness of magic at most O(2^n).

Background

The paper constructs bipartite separable entirely nonlocal magic (ENM) states with n qubits per party whose robustness of magic grows exponentially as approximately 2^n/n^2. This lower bound is obtained by reversibly embedding highly magical n-qubit states into separable ENM states, showing that the absence of locally accessible magic does not prevent substantial global magic.

The paper contrasts this construction with known bounds for arbitrary 2n-qubit states, whose maximum robustness of magic can scale between order 2^{2n}/n^2 and order 2^{2n}. It then formulates the unresolved conjecture that separability together with locally stabilizer marginals imposes the stronger order-2^n upper bound.