2015/09/23 by Nikolajs Nahimovs, Nahimovs, Nikolajs, Alexander Rivosh +1 · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.1509.06862
14 pages, 9 figures, 3 tables
arxiv created 2015/09/23 · openalex publication_date 2015/09/23 · arxiv updated 2015/09/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation - Grover's diffusion transformation - has a wide class of exceptional configurations of marked locations, for which the probability of finding any of the marked locations does not grow over time. This extends the class of known exceptional configurations; until now the only known such configuration was the "diagonal construction" by Ambainis and Rivosh [AR08]