Data Analytics in Quantum Paradigm: An Introduction

In this introductory material, we will discuss basics of quantum paradigm and how the developments in that area may provide useful pointers in the domain of data analytics. We will discuss about the power of quantum computation with respect to the classical one and try to present the implications of arrival of several quantum technologies in practice. The prime concerns in data analytics are fast computation, fast communication, and security of data. Among these issues, the main focus is naturally on the computation and then the rest of the issues follow. The objective of getting better efficiency can be attained by discrete algorithms with improved (lesser) time complexity and it is now proven that there are quantum algorithms that are indeed much faster than their classical counterparts. However, in all the domains of computation, such improvements may not be available and also fabricating a commercial quantum computer is still elusive. We will try to briefly describe an outline of quantum paradigm in this material with possible implications in several aspects in data analytics.

[1]  Tzonelih Hwang,et al.  New quantum private comparison protocol using EPR pairs , 2011, Quantum Information Processing.

[2]  Christoph Dürr,et al.  A Quantum Algorithm for Finding the Minimum , 1996, ArXiv.

[3]  Peter Wittek,et al.  Quantum Machine Learning: What Quantum Computing Means to Data Mining , 2014 .

[4]  María Naya-Plasencia,et al.  Breaking Symmetric Cryptosystems Using Quantum Period Finding , 2016, CRYPTO.

[5]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[6]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[7]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[8]  A. Montanaro.  Quantum speedup of Monte Carlo methods , 2015, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[9]  Hoi-Kwong Lo,et al.  Is Quantum Bit Commitment Really Possible? , 1996, ArXiv.

[10]  Sanjiv Kapoor,et al.  A Quantum Algorithm for finding the Maximum , 1999, quant-ph/9911082.

[11]  Joe Kilian,et al.  Founding crytpography on oblivious transfer , 1988, STOC '88.

[12]  M. Szegedy,et al.  Quantum Walk Based Search Algorithms , 2008, TAMC.

[13]  D. Dieks.  Communication by EPR devices , 1982 .

[14]  Dominic Mayers.  Unconditionally secure quantum bit commitment is impossible , 1997 .

[15]  T Lunghi,et al.  Practical Relativistic Bit Commitment. , 2014, Physical review letters.

[16]  A. Harrow,et al.  Quantum algorithm for linear systems of equations. , 2008, Physical review letters.

[17]  Mark Steyvers,et al.  Finding scientific topics , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Yehuda Lindell,et al.  Complete Fairness in Secure Two-Party Computation , 2011, JACM.

[19]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[20]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[21]  Hoi-Kwong Lo,et al.  Insecurity of Quantum Secure Computations , 1996, ArXiv.

[22]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[23]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[24]  Mark M. Wilde,et al.  Quantum Markov chains, sufficiency of quantum channels, and Rényi information measures , 2015, ArXiv.

[25]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[26]  Miguel-Angel Martin-Delgado,et al.  Google in a Quantum Network , 2011, Scientific Reports.

[27]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[28]  Gilles Brassard.  Brief history of quantum cryptography: a personal perspective , 2005, IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005..

[29]  Andrew Chi-Chih Yao,et al.  Security of quantum protocols against coherent measurements , 1995, STOC '95.

[30]  H. Neven,et al.  Characterizing quantum supremacy in near-term devices , 2016, Nature Physics.

[31]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[32]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[33]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[34]  Peter Wittek.  4 – Quantum Computing , 2014 .

[35]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[36]  Harry Buhrman,et al.  Quantum verification of matrix products , 2004, SODA '06.

[37]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .