Localization and its consequences for quantum walk algorithms and quantum communication
J. P. Keating, N. Linden, J. C. F. Matthews, A. Winter
Abstract
The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that quantum mechanics can also lead, through the phenomenon of localization, to exponential suppression of motion on these graphs (even in the absence of decoherence). In fact, for physical embodiments of graphs, this will be the generic behaviour. It also has implications for proposals for using spin networks, including spin chains, as quantum communication channels.
Create a lesson
Related papers
Spectral Fingerprints of Gauge Theories on a Quantum Computer
Graham Van Goffrier, Debasish Banerjee, Bipasha Chakraborty et al.
Dynamics of local quantum information in random unitary circuits
Ratul Thakur, Sthitadhi Roy
Factorized Boolean representations for efficient quantum synthesis
Mehul Shah, Robert Fiszer, Marek Perkowski
Detuning- and Stark-robust Rydberg gates
Elie Bataille, Gyohei Nomura, Manuel Endres
Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone
Shunji Matsuura, Yoji Kawamura, Joseph Salfi et al.
Stochastic transport of a Goldstone mode in a self-organized atomic crystal
Zhanhai Yu, Di Xiang, Xiaotian Zhang et al.