2022/07/04 by Gamal Mograby, Mograby, Gamal, Radhakrishnan Balu +5
Computer Science · #05C22 #81P45 #81Q10 #81Q35 #FOS: Physical sciences #Mathematical Physics (math-ph) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2207.01686
openalex publication_date 2022/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding specific graph topologies convenient for the related quantum walk, we fix the graph topology and vary the underlying graph Laplacians. As a result, we search for the most appropriate analytical structure on graphs endowed with fixed topologies yielding better search outcomes. We discuss strategies to investigate the optimality of Grover's algorithm and provide an example with an easy tunable graph Laplacian to investigate our ideas.