Sojourn Times for the One Dimensional Grover Walk
classification
🧮 math-ph
math.MPquant-ph
keywords
groversojourntimeswalkalgorithmcomputercountingdimensional
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.