Farid Ablayev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Farid Ablayev has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Vasiliev
Kazan Federal University
9 shared publications - Kamil Khadiev
Institute of Computational Mathematics and IT Kazan Federal University Kazan, Russia Zavoisky Physical-Technical Institute FRC Kazan Scientific Center of RAS Kazan,Russia
7 shared publications - Aida Gainutdinova
Kazan Federal University
6 shared publications - Abuzer Yakaryılmaz
Center for Quantum Computer Science University of Latvia Street LV-1586 Rīga Latvia
3 shared publications Marat Ablayev
Kazan Federal University
3 shared publicationsMarek Karpinski
3 shared publications
Latest Publications
- 29 August 2025
- Published by Pleiades Publishing Ltd in Physics of Particles and Nuclei
- Vol. 56 (4) , 967-969
Efficient Dictionary Search Quantum Algorithms
In this paper, we consider the problem of searching for an element in a dictionary. Various approaches to solving this problem have been proposed in recent decades: classical and quantum algorithms. We present two algorithms: a hybrid classical-quantum algorithm [1], that implements Grover’s search, and a “pure” quantum algorithm based on the quantum fingerprinting technique. Both algorithms work (a) with a high probability of obtaining the correct result and (b) with a quadratic query acceleration compared to the classical one. Our algorithms are much more memory efficient in terms of the number of qubits used compared to previously known quantum algorithms.
- 29 August 2025
- Published by Pleiades Publishing Ltd in Physics of Particles and Nuclei
- Vol. 56 (4) , 967-969
Efficient Dictionary Search Quantum Algorithms
In this paper, we consider the problem of searching for an element in a dictionary. Various approaches to solving this problem have been proposed in recent decades: classical and quantum algorithms. We present two algorithms: a hybrid classical-quantum algorithm [1], that implements Grover’s search, and a “pure” quantum algorithm based on the quantum fingerprinting technique. Both algorithms work (a) with a high probability of obtaining the correct result and (b) with a quadratic query acceleration compared to the classical one. Our algorithms are much more memory efficient in terms of the number of qubits used compared to previously known quantum algorithms.
- Open Access
- 15 May 2025
- Published by MDPI AG in Quantum Reports
- Vol. 7 (2) , 24
Theory and Applications of Quantum Hashing
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.
- 15 May 2025
- Published by MDPI AG in Quantum Reports
- Vol. 7 (2) , 24
Open AccessTheory and Applications of Quantum Hashing
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.
- 1 January 2022
- Published by Keldysh Institute of Applied Mathematics
- p. 52-54
Multiqidit quantum hashing
In this paper, we show the possible development of the technique of quantum hashing, which brings it closer to practical implementation, namely we propose a modified version of the quantum hash function, using the structure of one-photon multidimensional quantum states in basis of the orbital angular momentum.
- 1 January 2022
- Published by Keldysh Institute of Applied Mathematics
- p. 52-54
Multiqidit quantum hashing
In this paper, we show the possible development of the technique of quantum hashing, which brings it closer to practical implementation, namely we propose a modified version of the quantum hash function, using the structure of one-photon multidimensional quantum states in basis of the orbital angular momentum.
- 11 November 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (5) , 052606
Quantum hashing via single-photon states with orbital angular momentum
Quantum hashing is a promising generalization of the cryptographic hashing concept on the quantum domain. In this paper, we construct a quantum hash via a sequence of single-photon states and perform a proof-of-principle experiment using orbital angular momentum (OAM) encoding. We experimentally verify the collision resistance of the quantum hash function depending on the number of qubits in use. Based on these results, we conclude that theoretical estimates are confirmed for different bases of OAM states and the proposed technique can be useful in computational and cryptographic scenarios. The possibility of multiplexing different OAM bases can make this approach even more efficient.
- 11 November 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (5) , 052606
Quantum hashing via single-photon states with orbital angular momentum
Quantum hashing is a promising generalization of the cryptographic hashing concept on the quantum domain. In this paper, we construct a quantum hash via a sequence of single-photon states and perform a proof-of-principle experiment using orbital angular momentum (OAM) encoding. We experimentally verify the collision resistance of the quantum hash function depending on the number of qubits in use. Based on these results, we conclude that theoretical estimates are confirmed for different bases of OAM states and the proposed technique can be useful in computational and cryptographic scenarios. The possibility of multiplexing different OAM bases can make this approach even more efficient.
- 22 June 2020
- Published by Springer Nature
- p. 1-15
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
- 22 June 2020
- Published by Springer Nature
- p. 1-15
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
- Open Access
- 1 January 2020
- Published by Kazan Federal University in Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki
- Vol. 162 (3) , 259-268
Universal Hash Functions from Quantum Procedures
- 1 January 2020
- Published by Kazan Federal University in Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki
- Vol. 162 (3) , 259-268
Open AccessUniversal Hash Functions from Quantum Procedures
- 20 September 2018
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 39 (7) , 957-960
Quantum-Assisted Blockchain
Bitcoin and blockchain in general is a hot topic nowadays. In the paper we propose a quantum empowering of this technology and show how to speed-up the mining procedure using the modified Grover’s...
- 20 September 2018
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 39 (7) , 957-960
Quantum-Assisted Blockchain
Bitcoin and blockchain in general is a hot topic nowadays. In the paper we propose a quantum empowering of this technology and show how to speed-up the mining procedure using the modified Grover’s...
- 9 August 2018
- Published by Springer Nature
- p. 129-155
Classical and Quantum Computations with Restricted Memory
- 9 August 2018
- Published by Springer Nature
- p. 129-155
Classical and Quantum Computations with Restricted Memory
- Open Access
- 30 May 2018
- Published by IntechOpen
On Quantum Fingerprinting and Quantum Cryptographic Hashing
Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, whereas hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, whereas quantum fingerprinting and quantum hashing have a short history. In this chapter, we investigate quantum fingerprinting and quantum hashing. We present computational aspects of quantum fingerprinting and quantum hashing and discuss cryptographical properties of quantum hashing.
- 30 May 2018
- Published by IntechOpen
Open AccessOn Quantum Fingerprinting and Quantum Cryptographic Hashing
Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, whereas hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, whereas quantum fingerprinting and quantum hashing have a short history. In this chapter, we investigate quantum fingerprinting and quantum hashing. We present computational aspects of quantum fingerprinting and quantum hashing and discuss cryptographical properties of quantum hashing.
- Open Access
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The "memoryless" term means that players forget history from previous rounds, and their behavior is obtained only by input and message from the opposite player. The model is interesting because this allows us to get lower bounds for models like automata, Ordered Binary Decision Diagrams and streaming algorithms. At the same time, we can prove stronger results with this restriction. We present a lower bound for quantum memoryless protocols. Additionally, we show a lower bound for Disjointness function for this model. % As an application of communication complexity results, we consider Quantum Ordered Read-$k$-times Branching Programs ($k$-QOBDD). Our communication complexity result allows us to get lower bound for $k$-QOBDD and to prove hierarchies for sublinear width bounded error $k$-QOBDDs, where $k=o(\sqrt{n})$. Furthermore, we prove a hierarchy for polynomial size bounded error $k$-QOBDDs for constant $k$. This result differs from the situation with an unbounded error where it is known that an increase of $k$ does not give any advantage.Open AccessLower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The "memoryless" term means that players forget history from previous rounds, and their behavior is obtained only by input and message from the opposite player. The model is interesting because this allows us to get lower bounds for models like automata, Ordered Binary Decision Diagrams and streaming algorithms. At the same time, we can prove stronger results with this restriction. We present a lower bound for quantum memoryless protocols. Additionally, we show a lower bound for Disjointness function for this model. % As an application of communication complexity results, we consider Quantum Ordered Read-$k$-times Branching Programs ($k$-QOBDD). Our communication complexity result allows us to get lower bound for $k$-QOBDD and to prove hierarchies for sublinear width bounded error $k$-QOBDDs, where $k=o(\sqrt{n})$. Furthermore, we prove a hierarchy for polynomial size bounded error $k$-QOBDDs for constant $k$. This result differs from the situation with an unbounded error where it is known that an increase of $k$ does not give any advantage.