Ziyatdinov Mansur Tagirovich (архив)
Зиятдинов Мансур Тагирович
2023
- International scientific conference QScience Days 2023
29.05.2023 - 31.05.2023
Название докладаQJudge: Automated Testing of Students Solutions for Quantum Algorithms Courses
АннотацияWe describe QJudge, an automated testing system tailored for problems with quantum circuit solutions. QJudge allows you to prepare problems and accept solutions in the form of quantum circuits. It can be used in introductory quantum courses when students do not have knowledge of quantum programming
ЭкспонатыQJudge: https://qjudge.gltronred.info Talk Recording: https://youtu.be/eFGoCvbaOyA Booklet: https://qworld.net/wp-content/uploads/2023/06/QSD2023-version-june-1.2MB.pdf - International scientific conference 16th International Conference on Automata and Formal Languages
Kazan KFU
05.09.2023 - 07.09.2023
Название докладаGAPs for Shallow Implementation of Quantum Finite Automata
АннотацияQuantum fingerprinting is a technique that maps classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses less resources, making it useful in quantum algorithms, communication, and cryptography. One of the examples of quantum
ЭкспонатыMansur Ziiatdinov, Aliya Khadieva and Abuzer Yakaryilmaz. GAPs for Shallow Implementation of Quantum Finite Automata https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?AFL2023.21
2022
- International scientific conference 22th Asian Quantum Information Science Conference (AQIS'22)
Hefei University of Science and Technology of China
17.12.2022 - 18.12.2022
Название докладаDeterministic Construction of QFAs based on the Fingerprinting
АннотацияDeterministic Construction of QFAs based on the Fingerprinting
ЭкспонатыAliya Khadieva, Mansur Ziatdinov, "Deterministic Construction of QFAs based on the Fingerprinting" - International scientific conference 22th Asian Quantum Information Science Conference (AQIS'22)
Hefei University of Science and Technology of China
17.12.2022 - 18.12.2022
Название докладаQuantum Algorithm and Lower Bound for String Sorting Problem
АннотацияQuantum Algorithm and Lower Bound for String Sorting Problem
ЭкспонатыKamil Khadiev, Nikita Savelyev and Mansur Ziatdinov, "Quantum Algorithm and Lower Bound for String Sorting Problem"
2019
- International scientific symposium Workshop on Quantum Computing and Quantum Information
Tokyo The University of Electro-Communications
03.06.2019 - 03.06.2019
Название докладаDeterministic Construction of QFAs based on the Quantum Fingerprinting Technique
2018
- International research and practice conference 21th Annual Conference on Quantum Information Processing(QIP) 2018
Delft Technical University of Delft
13.01.2018 - 19.01.2018
Название докладаQuantum Online Algorithms with Advice Bits and Restricted Memory
АннотацияIn this paper, we consider online algorithms. Typically the model is investigated with respect to competitive ratio. We consider algorithms with restricted memory (space) and explore their power. We focus on quantum and classical online algorithms with advice. We consider special problem $P_k$. This
ЭкспонатыKamil Khadiev, Ilnaz Mannapov and Mansur Ziatdinov "Quantum Online Algorithms with Advice Bits and Restricted Memory" - International scientific conference 44th International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM 2018)
Krems an der Donau Donau-Universität Krems
29.01.2018 - 02.02.2018
Название докладаAttacking Quantum Hashing. Protocols and their Cryptanalysis
АннотацияQuantum hash functions are similar to classical (cryptographic) hash functions and their security is guaranteed by physical laws. However, security of a primitive does not automatically mean that protocols based on this primitive are secure. We propose protocols and assess their security - International scientific conference 76th International scientific conference of University of Latvia
Riga University of Latvia
16.02.2018 - 16.02.2018
Название докладаQuantum Online Streaming Algorithms with Advice
АннотацияA streaming algorithm is a well-known computational model that has a relationship with automata and branching programs models. We consider a quantum version of streaming algorithms for solving online minimization problems. We call the model quantum online streaming algorithm. Our Results: -a quant
Экспонаты"Quantum Online Streaming Algorithms with Advice" - International scientific seminar Algorithms and complexity
Paris Paris Diderot University
27.03.2018 - 27.03.2018
Название докладаQuantum online algorithms with restricted memory
АннотацияAn online algorithm is a well-known computational model for solving optimization problems. The defining property of this model is following. An algorithm reads an input piece by piece and should return output variables after some of the input variables immediately, even if the answer depends on the
ЭкспонатыQuantum online algorithms with restricted memory - International scientific conference 10th International Conference "Discrete Models in Control Systems Theory"
Moscow Lomonosov Moscow State University
23.05.2018 - 25.05.2018
Название докладаOn Quantum Online Algorithms with Restricted Memory and Advice - International scientific conference The 14th Biennial IQSA Conference "Quantum Structures 2018"
Kazan KFU
16.07.2018 - 20.07.2018
Название докладаThe Structure of Quantum Hash Functions for Groups
ЭкспонатыThe Structure of Quantum Hash Functions for Groups
2017
- International conference young scholars 3rd International Conference for Young Quantum Information Scientists
Erlangen Max Planck Institute for the science of light
03.10.2017 - 06.10.2017
Название докладаThe Security of the Quantum MAC
АннотацияQuantum MAC allows two parties with a shared secret key to authenticate messages. The main advantage over classical MAC is that security of quantum MAC is guaranteed by laws of physics. Formally [3], quantum MAC is a function that accepts a key and a (classical) input and outputs a (quantum) tag. - International scientific seminar school Quantum Fingerprinting and Quantum Walks
Riga Latvian University
09.10.2017 - 22.10.2017
Название докладаQuantum Hashing. Cryptographical Aspects
2015
- International scientific conference school Summer School on Lower Bounds Prague Charles University 28.06.2015 - 02.07.2015
- International scientific conference Computer Science in Russia 2015 Listvyanka ISU 13.07.2015 - 18.07.2015
2014
- International scientific symposium Computer Science in Russia 2014 05.06.2014 - 12.06.2014
2010
- International scientific symposium Computer Science in Russia 2010 Kazan KSU 14.06.2010 - 22.06.2010
| Work address: | 35 Kremlevskaya Str., Kazan, Building №14 (unit # 2) |
| Office number: | 902 |
| Phone: | +79276707260, +7(927)670-72-60 |
| E-mail: | 1Mansur.Ziyatdinov@kpfu.ru |
- General information
- Areas of research
- Taught disciplines
- Performance
- Scientific events
- Professional results
- Association participation
