pith. sign in

arxiv: 1209.4953 · v2 · pith:JENG4TRGnew · submitted 2012-09-22 · 🪐 quant-ph · cond-mat.stat-mech· math-ph· math.MP· physics.comp-ph

Superdiffusivity of quantum walks: A Feynman sum-over-paths description

classification 🪐 quant-ph cond-mat.stat-mechmath-phmath.MPphysics.comp-ph
keywords quantumwalksfeynmaninterferencesuperdiffusivityalgorithmsallowingallows
0
0 comments X
read the original abstract

Quantum walks constitute important tools in different applications, especially in quantum algorithms. To a great extent their usefulness is due to unusual diffusive features, allowing much faster spreading than their classical counterparts. Such behavior, although frequently credited to intrinsic quantum interference, usually is not completely characterized. Using a recently developed Green's function approach [Phys. Rev. A {\bf 84}, 042343 (2011)], here it is described -- in a rather general way -- the problem dynamics in terms of a true sum over paths history a la Feynman. It allows one to explicit identify interference effects and also to explain the emergence of superdiffusivity. The present analysis has the potential to help in designing quantum walks with distinct transport properties.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.