189 citations · 986 across the 27 of their papers we have counts for
4 papers · 2 filters
Quantum-walk search in motion
Himanshu Sahu, Kallol Sen
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional sear…
Complexity for one-dimensional discrete time quantum walk circuits
Aranya Bhattacharya, Himanshu Sahu, Ahmadullah Zahed +1
We compute the complexity for the mixed state density operator derived from a one-dimensional discrete-time quantum walk (DTQW). The complexity is computed using a two-qubit quantu…
Exploring localization with a step dependent coin
Kallol Sen
We generalize the coin operator of \cite{Zahed_2023}, to include a step dependent feature which induces localization in . This is evident from the probability distributions whi…
A simple coin for a entangled walk
Ahmadullah Zahed, Kallol Sen
We analyze the effect of a simple coin operator, built out of Bell pairs, in a Discrete Quantum Random Walk (DQRW) problem. The specific form of the coin enables us to find an…