Mansur Ziiatdinov

Dr. Mansur Ziiatdinov

Computer Science and Engineering, University of Messina, Messina, Sicilia, Italy
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2016 in Lobachevskii Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
Mansur ZiiatdinovMansur Ziiatdinov
Mansur Ziiatdinov

3 September 2023 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
Mansur ZiiatdinovMansur Ziiatdinov
Mansur Ziiatdinov
AKAliya Khadieva
Aliya Khadieva
AYAbuzer Yakaryılmaz
Abuzer Yakaryılmaz
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 fingerprinting is quantum automata algorithms for MOD p = {a i•p | i ≥ 0} languages, where p is a prime number. However, implementing such an automaton on the current quantum hardware is not efficient. Quantum fingerprinting maps a word x ∈ {0, 1} n of length n to a state |ψ(x) of O(log n) qubits, and uses O(n) unitary operations. Computing quantum fingerprint using all available qubits of the current quantum computers is infeasible due to a large number of quantum operations. To make quantum fingerprinting practical, we should optimize the circuit for depth instead of width in contrast to the previous works. We propose explicit methods of quantum fingerprinting based on tools from additive combinatorics, such as generalized arithmetic progressions (GAPs), and prove that these methods provide circuit depth comparable to a probabilistic method. We also compare our method to prior work on explicit quantum fingerprinting methods.

1 February 2023 in Lobachevskii Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
AKA. Khadieva
A. Khadieva
Mansur ZiiatdinovMansur Ziiatdinov
Mansur Ziiatdinov
It is known that for some languages quantum finite automata are more efficient than classical counterparts. Particularly, a QFA recognizing the language \(MOD_{p}\) has an exponential advantage over the classical finite automata. However, the construction of such QFA is probabilistic. In the current work, we propose a deterministic construction of the QFA for the language \(MOD_{p}\). We construct a QFA for a promise problem \(Palindrome_{s}\) and implement this QFA on the IBMQ simulator using qiskit library tools.

16 May 2025 in Frontiers in Computer Science
Verified
Journal Article
Open access
PDF file
Mansur ZiiatdinovMansur Ziiatdinov
Mansur Ziiatdinov
AKAliya Khadieva
Aliya Khadieva
KKKamil Khadiev
Kamil Khadiev
Quantum fingerprinting is a technique that maps a classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses fewer resources, making it useful in quantum algorithms, communication, and cryptography. One of the examples of quantum fingerprinting is the quantum automata algorithm for MODp={ai·p∣i≥0} languages, where p is a prime number. However, implementing such an automaton on current quantum hardware is not efficient. Quantum fingerprinting maps a word x∈{0, 1}n of length n to a state |ψ(x)〉 of O(logn) qubits, and uses O(n) unitary operations. Computing quantum fingerprint using all available qubits of the current quantum computers is infeasible due to many quantum operations. To make quantum fingerprinting practical, we should optimize the circuit for depth instead of width, in contrast to the previous works. We propose explicit methods of quantum fingerprinting based on tools from additive combinatorics, such as generalized arithmetic progressions (GAPs), and prove that these methods provide circuit depth comparable to a probabilistic method. We also compare our method to prior work on explicit quantum fingerprinting methods. We provide a series of numerical experiments with implementation of the quantum automata for MOD17 language on noisy simulators of IBMQ quantum devices. We show that shallow implementation based on GAPs produces results with much smaller computational error compared to standard deep circuit implementation. Despite the fact that on the ideal quantum computational device, the opposite situation arises. We show that the shallow circuit for the quantum automaton is better for near-future quantum computational devices.

15 May 2025 in Quantum Reports
Verified
Journal Article
Open access
PDF file
FAFarid Ablayev
Farid Ablayev
KKKamil Khadiev
Kamil Khadiev
AVAlexander Vasiliev
Alexander Vasiliev
Mansur ZiiatdinovMansur Ziiatdinov
Mansur Ziiatdinov
We review recent results on quantum one-way functions, including quantum fingerprinting or quantum hashing (we use these two terms as synonyms even though they have very small difference). This includes the analysis of their properties, different modifications, circuit implementation on an IBM Q platform, as well as on an experimental quantum setup. We discuss computational aspects of quantum hashing, its cryptographic properties and possible usage in communication protocols and algorithms.

20 November 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
KKKamil Khadiev
Kamil Khadiev
NSNikita Savelyev
Nikita Savelyev
Mansur ZiiatdinovMansur Ziiatdinov
Mansur Ziiatdinov
DMDenis Melnikov
Denis Melnikov
We suggest a new technique for developing noisy tree data structures. We call it a “walking tree”. As applications of the technique we present a noisy Self-Balanced Binary Search Tree (we use a Red–Black tree as an implementation) and a noisy segment tree. The asymptotic complexity of the main operations for the tree data structures does not change compared to the case without noise. We apply the data structures in quantum algorithms for several problems on strings like the string-sorting problem and auto-complete problem. For both problems, we obtain quantum speed-up. Moreover, for the string-sorting problem, we show a quantum lower bound.