Shallow Circuit Implementation for the Phase Form of Quantum Hashing and Local-Sensitive Hashing on IBMQ Noisy Emulators

In this work, we consider a well-known quantum hashing technique, and focus on its circuit representation. We implemented a shallow circuit for a phase form of the quantum hashing on a noisy emulator of IBMQ quantum devices using 8 qubits and showed that we can solve a problem MOD131 that cannot be solved classically using 8 bits. Our result demonstrates the power of the quantum algorithm in the case of restricted memory. Additionally, we suggest a local-sensitive hashing technique based on the phase form of the quantum hashing. The technique can be used for checking a distance between two integers x and y whether it is less than d. We present an example of the implementation of the algorithm for 5 qubits and d at most 5.

Authors

Institutions

Publication Details

Journal
Russian Microelectronics
Published
2025-12-01
DOI
https://doi.org/10.1134/s106373972560219x
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Shallow Circuit Implementation for the Phase Form of Quantum Hashing and Local-Sensitive Hashing on IBMQ Noisy Emulators

K. R. Altynbaev, K. R. Khadiev, A. I. Khadieva, D. Melnikov
Russian Microelectronics
Quantum Computing Algorithms and Architecture
article

Shallow Circuit Implementation for the Phase Form of Quantum Hashing and Local-Sensitive Hashing on IBMQ Noisy Emulators

K. R. Altynbaev, K. R. Khadiev, A. I. Khadieva, D. Melnikov
article en

Abstract

In this work, we consider a well-known quantum hashing technique, and focus on its circuit representation. We implemented a shallow circuit for a phase form of the quantum hashing on a noisy emulator of IBMQ quantum devices using 8 qubits and showed that we can solve a problem MOD131 that cannot be solved classically using 8 bits. Our result demonstrates the power of the quantum algorithm in the case of restricted memory. Additionally, we suggest a local-sensitive hashing technique based on the phase form of the quantum hashing. The technique can be used for checking a distance between two integers x and y whether it is less than d. We present an example of the implementation of the algorithm for 5 qubits and d at most 5.

Russian MicroelectronicsVol. 54(8)
Kazan Federal University (RU), Kazan Scientific Center (RU)
Openalex Percentile: Top 12%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.