8 citations · 20 across the 9 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
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…
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…
Quantum walk search for exceptional configurations
Pulak Ranjan Giri
There exist two types of configurations of marked vertices on a two-dimensional grid, known as the {\it exceptional configurations}, which are hard to find by the discrete-time qua…
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…
Quantum walk search by Grover search on coin space
Pulak Ranjan Giri
Quantum walk followed by some amplitude amplification technique has been successfully used to search for marked vertices on various graphs. Lackadaisical quantum walk can search fo…
Quantum negative sampling strategy for knowledge graph embedding with variational circuit
Pulak Ranjan Giri, Mori Kurokawa, Kazuhiro Saito
Knowledge graph is a collection of facts, known as triples(head, relation, tail), which are represented in form of a network, where nodes are entities and edges are relations among…