UC Logo
Institute for Quantum Science and Technology

Publications by D. Gavinsky

Refereed Journal Publications

    2009

  1. R. Cleve, D. Gavinsky and R. Jain, Entanglement-resistant two-prover interactive proof systems and non-adaptive PIRs, Quantum Information and Computation 9: 648 - 656, 1 July 2009. PDF.

E-prints on the arXiv

    2006

  1. D. Gavinsky, On the role of shared entanglement, arXiv.org:quant-ph/0604052, 8 April 2006.


  2. D. Gavinsky, J. Kempe and R. de Wolf, Strengths and weaknesses of quantum fingerprinting, arXiv.org:quant-ph/0603173, 20 March 2006.


    3. 2005

  3. D. Gavinsky, J. Kempe, O. Regev and R. de Wolf, Bounded-error quantum state identification and exponential separations in communication complexity, arXiv.org:quant-ph/0511013, 2 November 2005.


  4. D. Gavinsky, A note on shared randomness and shared entanglement in communication, arXiv.org:quant-ph/0505088, 12 May 2005.


Conference Publications

    2006

  1. D. Gavinsky, J. Kempe and R. de Wolf, Strengths and weaknesses of quantum fingerprinting, 16 July 2006, Proceedings of 21st Annual IEEE Conference on Computational Complexity (CCC 2006): 288 - 298, Prague, Czech Republic, 16 Jul 2006 - 20 Jul 2006, Published by IEEE Comput. Soc., Los Alamitos, United States of America, arXiv.org:quant-ph/0603173 (ISBN 0-7695-2596-2).


  2. D. Gavinsky, J. Kempe, O. Regev and R. de Wolf, Bounded-error quantum state identification and exponential separations in communication complexity, 21 May 2006, Proceedings of 38th ACM Symposium on Theory of Computing (STOC '06), Seattle, United States of America, 21 May 2006 - 23 May 2006, Published by Association for Computing Machinery, New York, United States of America, arXiv.org:quant-ph/0511013 (ISBN 1-59593-134-1).


    3. 2003

  3. D. Gavinsky, Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups, 4 September 2003. 2003 ERATO Conference on Quantum Information Processing. (refereed conference, with only publication of abstract).




Book Chapters

    2008

  1. R. Cleve, D. Gavinsky and D. L. Yonge-Mallo, Quantum algorithms for evaluating min-max trees, Lecture Notes in Computer Science 5106: 11 - 15, Proceedings of The 3rd Workshop on Theory of Quantum Computation, Communication and Cryptography (TQC2008), Y. Kawano and M. Mosca, eds., Tokyo, Japan, 30 Jan 2008 - 1 Feb 2008, 2008 (ISBN 978-3-540-89303-5).


Thesis Publications

    2006

  1. D. Gavinsky, Shared randomness and entanglement in communication complexity (PhD Thesis), 1 January 2006. University of Calgary.