A. Nayak and J. Salzman. On communication over an entanglement-assisted quantum channel. In Proceedings of the 34th ACM Symposium on the Theory of Computing, 2002. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Quantum Communication Complexity of Symmetric Predicates - Razborov (2002) (6 citations) (Correct)
....D( 1) Then Q (f n;k;D ) k ) Remark 1 Nayak and Shi have observed (personal communication) that our lower bound extends to a more general model in which the entanglement need not necessarily be given in the form of shared EPR pairs. More speci cally, in this model (considered e.g. in [NS02] the input vector Input(x; y) has the form e j0; x; eij0ije; y; 0i; 5) where f e j e 2 E g is an arbitrary unitary vector (the case (4) of EPR pairs corresponds to e = 1=2 ) With their kind permission, we include in Section 5.1 the adjustments to our basic proof needed for this ....
A. Nayak and J. Salzman. On communication over an entanglement-assisted quantum channel. In Proceedings of the 34th ACM Symposium on the Theory of Computing, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC