Abstract
We determine all the ensembles that can be remotely prepared in a deterministic and oblivious way using a nonmaximally entangled resource with minimum classical communication cost when Bob's unitary transformations form a cyclic group. We show that the classical communication has maximal informational entropy. We also give a constraint for the shared entangled resource that can be used for remote state preparation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
