Scholarlink

Abstract <p>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 MOD<sub>131</sub> that cannot be solved classically using 8 bits. Our result demonstrates the power of the quantum algorithm in the case of restricted memory.</p> <p>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 <i>x</i> and <i>y</i> whether it is less than <i>d</i>. We present an example of the implementation of the algorithm for 5 qubits and <i>d</i> at most 5.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 发表日期：

    2025年12月1日

查看全文
  • K. R. Khadiev,
  • D. Melnikov,
  • K. R. Altynbaev,
  • A. I. Khadieva

摘要

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.