\begin{thebibliography}{10}

\bibitem{aaronson:advicecommj}
S.~Aaronson.
\newblock Limitations of quantum advice and one-way communication.
\newblock {\em Theory of Computing}, 1:1--28, 2005.
\newblock Earlier version in Complexity'04. quant-ph/0402095.

\bibitem{aaronson:qlearnability}
S.~Aaronson.
\newblock The learnability of quantum states.
\newblock {\em Proceedings of the Royal Society of London}, A463(2088), 2007.
\newblock quant-ph/0608142.

\bibitem{ambainis:3computer}
A.~Ambainis.
\newblock Communication complexity in a 3-computer model.
\newblock {\em Algorithmica}, 16(3):298--301, 1996.

\bibitem{babai&kimmel:simultaneous}
L.~Babai and P.~G. Kimmel.
\newblock Randomized simultaneous messages: Solution of a problem of {Y}ao in
  communication complexity.
\newblock In {\em Proceedings of the 12th IEEE Conference on Computational
  Complexity}, pages 239--246, 1997.

\bibitem{bjk:q1way}
Z.~{Bar-Yossef}, T.~S. Jayram, and I.~Kerenidis.
\newblock Exponential separation of quantum and classical one-way communication
  complexity.
\newblock In {\em Proceedings of 36th ACM STOC}, pages 128--137, 2004.

\bibitem{bcww:fp}
H.~Buhrman, R.~Cleve, J.~Watrous, and R.~{de} Wolf.
\newblock Quantum fingerprinting.
\newblock {\em Physical Review Letters}, 87(16), September 26, 2001.
\newblock quant-ph/0102001.

\bibitem{dam:commsmp}
W.~{van} Dam.
\newblock Personal communication, May 2007.

\bibitem{gkkrw:1way}
D.~Gavinsky, J.~Kempe, I.~Kerenidis, R.~Raz, and R.~{de} Wolf.
\newblock Exponential separations for one-way quantum communication complexity,
  with applications to cryptography.
\newblock In {\em Proceedings of 39th ACM STOC}, pages 516--525, 2007.
\newblock quant-ph/0611209.

\bibitem{gkrw:identification}
D.~Gavinsky, J.~Kempe, O.~Regev, and R.~{de} Wolf.
\newblock Bounded-error quantum state identification and exponential
  separations in communication complexity.
\newblock In {\em Proceedings of 38th ACM STOC}, pages 594--603, 2006.
\newblock quant-ph/0511013.

\bibitem{kushilevitz&nisan:cc}
E.~Kushilevitz and N.~Nisan.
\newblock {\em Communication Complexity}.
\newblock Cambridge University Press, 1997.

\bibitem{newman:random}
I.~Newman.
\newblock Private vs.~common random bits in communication complexity.
\newblock {\em Information Processing Letters}, 39(2):67--71, 1991.

\bibitem{newman&szegedy:1round}
I.~Newman and M.~Szegedy.
\newblock Public vs.~private coin flips in one round communication games.
\newblock In {\em Proceedings of 28th ACM STOC}, pages 561--570, 1996.

\bibitem{nielsen&chuang:qc}
M.~A. Nielsen and I.~L. Chuang.
\newblock {\em Quantum Computation and Quantum Information}.
\newblock Cambridge University Press, 2000.

\bibitem{wolf:qccsurvey}
R.~{de} Wolf.
\newblock Quantum communication and complexity.
\newblock {\em Theoretical Computer Science}, 287(1):337--353, 2002.

\bibitem{yao:unified}
A.~C-C. Yao.
\newblock Probabilistic computations: Toward a unified measure of complexity.
\newblock In {\em Proceedings of 18th IEEE FOCS}, pages 222--227, 1977.

\end{thebibliography}
