Given two parties Alice and Bob, a state $\rho_{AB}$ is said to be separable if it can be written as $\rho_{AB}=\sum_i p_i\rho^i_A\otimes\rho^i_B$, with $p_i$ being probabilities and $\rho^i_A,\rho^i_B$ being density matrices on Alice and Bob respectively. State is entangled iff it is not separable.
Define transpose operation $T(|i\rangle\langle j|) = |j\rangle\langle i|$. A state $\rho_{AB}$ satisfies Positive Partial Transpose (PPT) criteria if $T_A\otimes I_B(\rho_{AB})$ is also a density matrix (has positive eigenvalues, and trace is 1). Such state is called a PPT state. Else the state is a NPT state (its partial transpose has negative eigenvalues).
I have following questions:
Is there an operational difference between separable and entangled states? To be more precise: is there a shared task, in which Alice and Bob can perform upto a limit 'L' if they share a separable state, but can always perform better than 'L' if they have an entangled state? 'L' may be understood as the amount of some resource (shared classical bits/quantum entanglement etc etc) extracted in above task.
Is there an operational difference between PPT and NPT states as well?