687 citations
- University of Southern CaliforniaUS6 papers
- National Institute of InformaticsJP4 papers
- KDDI (Japan)JP2 papers
- Osaka Institute of TechnologyJP2 papers
- Shibaura Institute of TechnologyJP2 papers
- Accenture (United States)US1 paper
- California Southern UniversityUS1 paper
- Carnegie Mellon UniversityUS1 paper
- Commonwealth Scientific and Industrial Research OrganisationAU1 paper
- Data61AU1 paper
- Doshisha UniversityJP1 paper
- Escuela Superior Politecnica del LitoralEC1 paper
12 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…