Well I'm not as clued up on entanglement as you guys are so forgive me for being a layman, this is how I see it...
If it were possible to set a specific state for a particular particle, then perhaps the following method would work...
Referring to each particle as a bit, for ease of understanding.
According to what I've read about about entanglement, a bit can either be in one state or another, but we can't tell which state it will be in until we observe it.
What we can tell, is that the other bit will be in the opposite state than the bit we've just observed.
Hence, an array of bits will either be an image, or a negative image, at any given time of observation. The state of all bits in the array would have to be synced, and set at the same time to their appropriate values in order to get a complete image.
It's easy enough to determine if the image is negative and to correct it on one side or the other, so it doesn't really matter if the bits are constantly switching states, just as long as they're all switching at the same time.
The big question is, can a bit be set to a specific state in comparison to the other bits in the same array.
For instance, can I set all bits to State-A, and then the last 3 bits to State-B?
So that I have five particles, who's state represents X and three particles who's state represents Y?
This would mean that my entangled particles on the other side, at any given moment in time,
will read either 00000111, or 11111000.
If so, then the next thing is to have have two separate arrays, for sending and receiving, in each device.
We'll also set specific time constants for sending and receiving.
(Using minutes as an example time interval...)
Alice can only set her sender-bits on the first time constant, and Bob can
only read his receiver-bits on the second time constant.
Bob and Alice's devices must obviously be synced in time exactly.
It's also important that Bob reads his receiver bits continuously, whether Alice's bits have changed or not, (meaning he will get the same image until Alice changes her bits)
Another example. I send an image on my device.
At 1:00am my sender-bits are encoded with the image.
(I can encode my message at 1:00, 1:02, 1:04, etc)
At 1:01am the other device checks its receiver bits (as it would on 1:03, 1:05 etc) and finds and update has been made.
Whether the bits are in their first state or second state is irrelevant, as long as their states are consistent among each other.
This way we get a full image, either negative or normal.
If the image is negative after compiling all the bits, then we simple correct it programatically.