  An upper bound on the low-entanglement remote state preparation (RSP) ebits
vs. bits tradeoff curve (Bennett et al.,quant-ph/0006044) is found using
techniques of classical information theory. We prove our coding scheme to be
optimal amongst an important class of protocols, and conjecture the bound to be
tight.
