Publications
Preprint · SSRN Electronic Journal · January 1, 2023
Lower Bound and Hierarchies for Quantum Ordered Read-K-Times Branching Programs
Kamil Ravilevich Khadiev, Farid Mansurovich Ablayev, Aliya Khadieva, Rishat Ibrahimov
Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in GraphsComputability, Logic, AI Algorithmsordered binary decision diagramslower boundssubfunctions
More by Kamil Khadiev
- Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering PatharXiv · 2026
- Quantum k-means based on Quantum Local Sensitive Hashing with Application to Irrigation Machine Sensors Data ClusteringIEEE International Conference on Smart Computing Workshops and Other Affiliated Events · 2026
- Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity GrapharXiv · 2026
- Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs Based on 1-Cover PathInternational Conference on Quantum Communications, Networking, and Computing · 2026 · Citations: 1