Communication complexity of remote state preparation with entanglement

Authors:
Rahul Jain
Affiliations:
Computer Science, University of California, Berkeley, California
Venue:
Quantum Information & Computation
Year:
2006

Citing 4
Cited 4

Why quantum bit commitment and ideal quantum coin tossing are impossible

PhysComp96 Proceedings of the fourth workshop on Physics and computation
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Quantum Entanglement and the Communication Complexity of the Inner Product Function

QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Remote preparation of quantum states

IEEE Transactions on Information Theory

A property of quantum relative entropy with an application to privacy in quantum communication

Journal of the ACM (JACM)
A separation between divergence and Holevo information for ensembles

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The communication complexity of correlation

IEEE Transactions on Information Theory
A separation between divergence and holevo information for ensembles

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.07

Visualization

Abstract

We consider the problem of remote state preparation recently studied in several papers. We study the communication complexity of this problem, in the presence of entanglement and in the scenario of single use of the channel.