The communication cost is 0(log m)=0(logn) We have thus proved the following theorem. Theorem 5.The quantum communication complexity of EQn in the private-coin SMP model is o(logn). Note Communication complexity is a very interesting subject on its own and has numerous applications to other algorithm and complexity theories.For a general introduction,see [KN97]. Reference [KN97]Eyal Kushilevitz and Noam Nisan,Communication Complexity,Cambridge University Press,1997. Exercise 1. 2.The communication cost is O(log 𝑚) = 𝑂(log 𝑛). We have thus proved the following theorem. Theorem 5. The quantum communication complexity of 𝐄𝐐𝑛 in the private-coin SMP model is O(log 𝑛). Note Communication complexity is a very interesting subject on its own and has numerous applications to other algorithm and complexity theories. For a general introduction, see [KN97]. Reference [KN97] Eyal Kushilevitz and Noam Nisan, Communication Complexity, Cambridge University Press, 1997. Exercise 1. 2