Publications
Code · Zenodo · October 26, 2026
Expected query cost of Grover search under noise: code and data
Abdinabi Mukhamadiyev, Shuhrat Toirov, Norqobil Saydirasulov, Dilmurod Turimov, Sukhbat Abdurakhimov
Abstract
Code and data for “Expected Query Cost of Grover Search under Per-Iteration Depolarizing Noise: Explicit Speedup Bounds and Circuit-Level Validation on Noisy Device Models” (submitted to Mathematics, MDPI). Kaggle-reproduced results; Qiskit 2.6.1, Aer 0.18.0, qiskit-ibm-runtime 0.51.0.
Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and ApplicationsGrover's algorithmquantum searchquery cost
More by Abdinabi Mukhamadiyev
- Comparative Analysis of Methods for Improving the Classification Accuracy of Morphologically Similar Pollen Grain Classes on the CPD-1 DatasetSensors · 2026
- ACE-LTT reproducibility package: Fail-Closed Certification of Multi-Stage AI PoliciesZenodo · 2026
- Exploiting Natural Information Redundancy for Reliability Control in Electronic Document Management: A Formal Framework and an Error-Annotated CorpusInformation · 2026
- Data and analysis code for: Foreign language anxiety and self-perceived progress among Uzbek students at a South Korean English-medium universityZenodo · 2026