Title:  Classical and quantum methods of information processing and transmission (current state and plans)

By Professor Farid Ablayev

Time：3:30-4:30 PM, Thursday March 15, 2018

Location：Room 623, Big Data Institute, College of Computer Science & Software Engineering, Shenzhen University

Abstract

Quantum computations and quantum cryptography is a new rapidly developing area (”hot area") of theoretical and applied Informatics.

Problematics we are working are:

1.      Comparative complexity of realization of computations in classical and quantum models of algorithms.

2.      Quantum cryptography.

3.      Development of systems for quantum programming.

4.      Efficient classical and quantum data processing, machine learning.

The topics listed in the research questions, are important basic mathematical problems of quantum Informatics. Thus, the task of studying the possibilities of comparison of classical and quantum models of computations is the first task that is set in the development of quantum algorithms. Cryptography is one of the first practical areas in which quantum methods are already widely used. At the same time, the development of quantum cryptographic protocols involves close interaction with experts in the field of quantum physical technologies and quantum optics.

The results of recent years show that one of the breakthrough applications of quantum methods of information processing can be the processing of large amounts of data and machine learning.

Our group has been conducting research and educational activities in the field of quantum computer science for more than fifteen years. Our first WoS articles were published in 2000, 2001 (LNCS Springer). Over the years, more than 50 papers have been published in high level journals (indexed by WoS database). Prepared and defended 4 PhD theses, prepared 2, and  preparing 2 PhD theses. We established science and friendly contacts with international and Russia groups and researchers.

At the first stage (from 2018), studies will be conducted in the following three areas:

·         Comparative implementation complexity of discrete functions in the classical (deterministic, nondeterministic, probabilistic) and quantum models of computation such as finite state machines, branching programs, circuits, and communication models.

·         Quantum cryptography. In particular, development and analysis of quantum hashing systems, development and analysis of effective quantum protocols of information transmission.

·         Development of systems for quantum programming.

At present, intensive work is being carried out in these three areas, there is a significant scientific reserve, scientific cooperation with the following groups has been established: groups of mathematicians of the Academy of Cryptography (AK) of Russia, groups of physicists leading the development of quantum technologies, quantum optics (MSU, Institute of Physics and technology RAS (Moscow), Institute of Physics and technology (Kazan)).

In the direction of "development of quantum programming systems" it is necessary to emphasize the breakthrough in the practical implementation of quantum computing since 2016: IBM announced and provided remote access to IBM-Q researchers from around the world. Our group provides training in the use of IBM-Q is a test programming the IBM-Q.

In the next stages it is planned to integrate quantum methods with the areas of research in the field of data processing (Data Science) and machine learning (areas of "Effective classical and quantum data processing, machine learning").  Recent results show a good potential of quantum processing methods for the development Data Science and Machine learning.  Our cooperation (Novosibirsk group, Kazan group, and Shenzhen group) will be provided the opportunity for a broader integration with Computer Science research groups in Russia, China,  and Europe.

Biography

Professor, Dr. Farid Ablayev is the Head of Theoretical Cybernetics Department (1998-present), Kazan Federal University. His research interests are algorithms, complexity theory, especially probabilistic and quantum algorithms, complexity of probabilistic and quantum computational models, quantum cryptography. He has started his research work in a group at Kazan University focused on probabilistic automata. This group was organized by Professor R.Bukharaev and started its activity in 1960-s based on the first famous paper “Probabilistic Automata” published by M. Rabin in 1963 in the journal “Information and control” (now “Information and Computation").