Sojourn Times for the One Dimensional Grover Walk
Abstract
Using the technique of path counting we show non-existence of sojourn times in the Grover walk which is related to the Grover's algorithm in computer science.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.