Please use this identifier to cite or link to this item:
|Title:||Resource requirements of private quantum channels and consequences for oblivious remote state preparation||Authors:||Jain, R.||Keywords:||Entropy
Remote state preparation
|Issue Date:||2012||Citation:||Jain, R. (2012). Resource requirements of private quantum channels and consequences for oblivious remote state preparation. Journal of Cryptology 25 (1) : 1-13. ScholarBank@NUS Repository. https://doi.org/10.1007/s00145-010-9076-8||Abstract:||Shannon (Bell Syst. Tech. J. 27:623-656, 1948; Bell Syst. Tech. J. 28:656-715, 1949) in celebrated work had shown that n bits of shared key are necessary and sufficient to transmit n-bit classical information in an information-theoretically secure way, using one-way communication. Ambainis, Mosca, Tapp and de Wolf in (Proceedings of the 41st Annual IEEE Symposium on Foundation of Computer Science, pp. 547-553, 2000) considered a more general setting, referred to as private quantum channels, in which instead of classical information, quantum states are required to be transmitted and only one-way communication is allowed. They show that in this case 2n bits of shared key is necessary and sufficient to transmit an n-qubit state. We consider the most general setting in which we allow for all possible combinations, in one-way communication, i.e. we let the input to be transmitted, the message sent and the shared resources to be classical/quantum. We develop a general framework by which we are able to show simultaneously tight bounds on communication/shared resources in all of these cases and this includes the results of Shannon and Ambainis et al. As a consequence of our arguments we also show that in a one-way oblivious remote state preparation protocol for transferring an n-qubit pure state, the entropy of the communication must be 2n and the entanglement measure of the shared resource must be n. This generalizes the result of Leung and Shor (Phys. Rev. Lett. 90, 2003) which shows the same bound on the length of communication in the special case when the shared resource is maximally entangled, e.g. EPR pairs, and hence settles an open question asked in their paper regarding protocols without maximally entangled shared resource. © 2010 International Association for Cryptologic Research.||Source Title:||Journal of Cryptology||URI:||http://scholarbank.nus.edu.sg/handle/10635/39438||ISSN:||09332790||DOI:||10.1007/s00145-010-9076-8|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 17, 2019
checked on May 24, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.