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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Ambainis, M. Mosca, A. Tapp, R. de Wolf, Private quantum channels, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (2000), pp. 547–553
C. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, W. Wootters, Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 70, 1895–1899 (1993)
C.H. Bennett, S.J. Wiesner, Communication via one and two particle operators on Einstein–Podolsky–Rosen states. Phys. Rev. Lett. 69, 2881–2884 (1992)
R. Cleve, D. Gottesman, H.K. Lo, How to share a quantum secret. Phys. Rev. Lett. 83, 648–651 (1999)
R. Jain, J. Radhakrishnan, P. Sen, A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56(6), 1–32 (2009)
D.W. Leung, Quantum Vernam cipher. Quantum Inf. Comput. 2, 14–34 (2002)
H.-K. Lo, H.F. Chau, Is quantum bit commitment really possible? Phys. Rev. Lett. 78, 3410–3413 (1997)
H.-K. Lo, H.F. Chau, Why quantum bit commitment and ideal quantum coin tossing are impossible. Physica D 120, 177–187 (1998)
D.W. Leung, P.W. Shor, Oblivious remote state preparation. Phys. Rev. Lett. 90, 127905 (2003)
U.M. Maurer, Secret key agreement by public discussion from common information. IEEE Trans. Inform. Theory 39, 733–742 (1993)
M. Nielsen, I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)
C.E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J. 27, 623–656 (1948)
C.E. Shannon, Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Stefan Wolf
This work was conducted at University of California at Berkeley, USA where it was supported by an Army Research Office (ARO), North California, grant number DAAD 19-03-1-00082.
Rights and permissions
About this article
Cite this article
Jain, R. Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation. J Cryptol 25, 1–13 (2012). https://doi.org/10.1007/s00145-010-9076-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-010-9076-8