Name
Abstract | ||
|---|---|---|
The nature of discrete-time quantum walks in the presence of multiple marked states can be found in the literature. An exceptional configuration of clustered marked states, which is a variant of multiple marked states, may be defined as a cluster of k marked states arranged in a
$$\sqrt{k} \times \sqrt{k}$$
array within a
$$\sqrt{N} \times \sqrt{N}$$
grid, where
$$k=n^{2}$$
and n an odd integer. In this article, we establish through numerical simulation that for lackadaisical quantum walks, which is the analogue of a three-state discrete-time quantum walks on a line, the success probability to find a vertex in the marked region of this exceptional configuration is nearly 1 with smaller run-time. We also show that the weights of the self-loop suggested for multiple marked states in the state-of-the-art works are not optimal for this exceptional configuration of clustered marked states. We propose a weight of the self-loop which gives the desired result for this configuration. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s11128-022-03606-6 | Quantum Information Processing |
Keywords | DocType | Volume |
Lackadaisical quantum walks, Multiple marked state, Quantum walks, Clustered-marked states | Journal | 21 |
Issue | ISSN | Citations |
8 | 1573-1332 | 0 |
PageRank | References | Authors |
0.34 | 3 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amit Saha | 1 | 3 | 2.76 |
| Ritajit Majumdar | 2 | 0 | 0.34 |
| Debasri Saha | 3 | 0 | 0.68 |
| Amlan Chakrabarti | 4 | 0 | 1.35 |
| Susmita Sur-Kolay | 5 | 333 | 39.50 |