We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Szegedy's quantum walk with queries.
- Authors
Santos, Raqueline
- Abstract
When searching for a marked vertex in a graph, Szegedy's usual search operator is defined by using the transition probability matrix of the random walk with absorbing barriers at the marked vertices. Instead of using this operator, we analyze searching with Szegedy's quantum walk by using reflections around the marked vertices, that is, the standard form of quantum query. We show we can boost the probability to 1 of finding a marked vertex in the complete graph. Numerical simulations suggest that the success probability can be improved for other graphs, like the two-dimensional grid. We also prove that, for a certain class of graphs, we can express Szegedy's search operator, obtained from the absorbing walk, using the standard query model.
- Subjects
ATOMIC transition probabilities; GEOMETRIC vertices; QUANTUM states; SPATIAL analysis (Statistics); COMPUTER simulation
- Publication
Quantum Information Processing, 2016, Vol 15, Issue 11, p4461
- ISSN
1570-0755
- Publication type
Article
- DOI
10.1007/s11128-016-1427-4