2008/10/07 by E. Agliari, E Agliari, A. Blumen +3 · 1 citation
Computer Science · Engineering · Physics and Astronomy · #Molecular Junctions and Nanostructures #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.1088/1751-8113/41/44/445301
published as J. Phys. A 41, 445301 (2008) · 25 pages, 13 figures
arxiv created 2008/10/07 · openalex publication_date 2008/10/07 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average displacement of the walker as a function of time. Indeed, a fast growth of the average displacement can be advantageously exploited to build up efficient search algorithms. By means of analytical and numerical investigations, we show that the finiteness and the inhomogeneity of the substrate jointly weaken the quantum walk performance. We further highlight the interplay between the quantum-walk dynamics and the underlying topology by studying the temporal evolution of the transfer probability distribution and the lower bound of long time averages.