most citedQuantum hash function using discrete-time quantum walk on Hanoi network

1 citations · 1 across the 2 of their papers we have counts for

collaborators

9 papers

quant-ph2026

Grover's algorithm for image edge detection

Pulak Ranjan Giri, Kazuhiro Saito

Grover's algorithm is one of the most significant quantum algorithms, enabling the search for a marked element in an unsorted database quadratically faster than classical search al…

quant-ph20261 cited

Quantum hash function using discrete-time quantum walk on Hanoi network

Pulak Ranjan Giri

Quantum walk based hash functions have attracted a lot of attention in recent years because of its faster execution time and robust resistance against attacks compared to classical…

quant-ph2026

Quantum walk search for exceptional configurations on one- and two-dimensional lattice with extra long-range edges of Hanoi network of degree four

Satoshi Watanabe, Pulak Ranjan Giri

There exist several types of configurations of marked vertices, referred to as the exceptional configurations, on one- and two-dimensional periodic lattices with additional long-ra…

quant-ph2025

Multi-target quantum walk search on Johnson graph

Pulak Ranjan Giri

The discrete-time quantum walk on the Johnson graph is a useful tool for performing target vertex searches with high success probability. This graph is defined by dist…

quant-ph2025

Quantum walk search based edge detection of images

Pulak Ranjan Giri, Rei Sato, Kazuhiro Saito

Quantum walk has emerged as an essential tool for searching marked vertices on various graphs. Recent advances in the discrete-time quantum walk search algorithm have enabled it to…

quant-ph2025

Fast variational knowledge graph embedding

Pulak Ranjan Giri, Mori Kurokawa, Kazuhiro Saito

Embedding of a knowledge graph(KG) entities and relations in the form of vectors is an important aspect for the manipulation of the KG database for several downstream tasks, such a…