25 citations · 65 across the 16 of their papers we have counts for
17 papers
Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path
Kamil Khadiev, Aliya Khadieva, Vadim Sagitov +2
One of the obstacles to the widespread adoption of quantum computing is the problem of efficient circuit synthesis. Current quantum hardware has limited connections between qubits,…
Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle
Kamil Khadiev, Vladislav Remidovskii, Timur Bikmullin +1
In the paper, we consider the problem of searching for the Largest empty rectangle in a 2D map, and the one-dimensional version of the problem is the problem of searching for the l…
Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs
Kamil Khadiev, Aliya Khadieva, Vadim Sagitov +1
In the paper, we consider quantum circuits for the Quantum Fourier Transform (QFT) algorithm. The QFT algorithm is a very popular technique used in many quantum algorithms. We pres…
Implementation of Quantum Fourier Transform and Quantum Hashing for a Quantum Device with Arbitrary Qubits Connection Graphs
Kamil Khadiev, Aliya Khadieva, Zeyu Chen +1
In the paper, we consider quantum circuits for Quantum fingerprinting (quantum hashing) and quantum Fourier transform (QFT) algorithms. Quantum fingerprinting (quantum hashing) is…
Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata
Mansur Ziiatdinov, Aliya Khadieva, Kamil Khadiev
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…
Quantum hashing algorithm implementation
Aliya Khadieva
We implement a quantum hashing algorithm which is based on a fingerprinting technique presented by Ambainis and Frievalds, 1988, on gate-based quantum computers. This algorithm is…
A Representative Framework for Implementing Quantum Finite Automata on Real Devices
Aliya Khadieva, Özlem Salehi, Abuzer Yakaryılmaz
We present a framework for the implementation of quantum finite automata algorithms designed for the language on gate-based quantum com…
Quantum Circuit for Random Forest Prediction
Liliia Safina, Kamil Khadieva, Ilnar Zinnatullina +1
In this work, we present a quantum circuit for a binary classification prediction algorithm using a random forest model. The quantum prediction algorithm is presented in our previo…
GAPs for Shallow Implementation of Quantum Finite Automata
Mansur Ziiatdinov, Aliya Khadieva, 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…
Deterministic Construction of QFAs based on the Quantum Fingerprinting Technique
Aliya Khadieva, Mansur Ziatdinov
It is known that for some languages quantum finite automata are more efficient than classical counterparts. Particularly, a QFA recognizing the language has an exponential…
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies
Kamil Khadiev, Aliya Khadieva, Alexander Knop
In this paper, we study quantum Ordered Binary Decision Diagrams() model; it is a restricted version of read-once quantum branching programs, with respect to "width" complexi…
Affine automata verifiers
Aliya Khadieva, Abuzer Yakaryılmaz
We initiate the study of the verification power of AfAs as part of Arthur-Merlin (AM) proof systems. We show that every unary language is verified by a real-valued AfA verifier. Th…
Quantum versus Classical Online Streaming Algorithms with Advice
Kamil Khadiev, Aliya Khadieva, Mansur Ziatdinov +4
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorit…
Quantum versus Classical Online Streaming Algorithms with Logarithmic Size of Memory
Kamil Khadiev, Aliya Khadieva, Dmitry Kravchenko +3
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorit…
Quantum Online Algorithms with Respect to Space Complexity
Kamil Khadiev, Aliya Khadieva, Ilnaz Mannapov
Online algorithm is a well-known computational model. We introduce quantum online algorithms and investigate them with respect to a competitive ratio in two points of view: space c…
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
Kamil Khadiev, Aliya Khadieva
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to "width" complexity. It is known that maximal complexity gap betwee…
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
Farid Ablayev, Andris Ambainis, Kamil Khadiev +1
We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The "memoryless" term means that pla…