On Compression of Non-classically Correlated Bit String

Recently we have worked on a new approach to analyzing correlations.  Two parties: Alice and Bob, each generate a binary string (consisting of 1s and 0s). This string may be generated by flipping a coin or by making projective measurements on a quantum state (such as one arm of a Bell pair). Remarkably, we can analyse the bipartite correlations   independently of how these strings are generated by looking at how well Alice and Bob’s bit strings can be compressed. Check out the video abstract:

and paper:

On compression of non-classically correlated bit strings