Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1112.2614 · Physical Review A

Green-function approach for scattering quantum walks

Fabiano M. Andrade, M. G. E. da Luz

Published Oct 31, 2011• 9 citations
arXivHTMLPDF

Abstract

In this work a Green-function approach for scattering quantum walks is developed. The exact formula has the form of a sum over paths and always can be cast into a closed analytic expression for arbitrary topologies and position-dependent quantum amplitudes. By introducing the step and path operators, it is shown how to extract any information about the system from the Green function. The method's relevant features are demonstrated by discussing in detail an example, a general diamond-shaped graph.

DOI
10.1103/physreva.84.042343

Related papers

Green function approach for general quantum graphs

Alexandre G. M. Schmidt, Bin Kang Cheng, M. G. E. da Luz

We present a recursive prescription to calculate the exact Green function for general quantum graphs. For the closed case, the expression for the poles of G —which gives the individual eigenstates—has the structure of a semiclassical formula, where the sum over the periodic orbit is already performed. As applications we discuss eigenstate localization for a three-arm closed star and filter-like mechanisms for transmission throughout an open trident graph.

Journal of Physics A Mathematical and General•Oct 8, 2003•28 citations

Generalized eigenfunctions for quantum walks via path counting approach

Takashi Komatsu, Norio Konno, Hisashi Morioka +1 more

We consider the time-independent scattering theory for time evolution operators of one-dimensional two-state quantum walks. The scattering matrix associated with the position-dependent quantum walk naturally appears in the asymptotic behavior at the spatial infinity of generalized eigenfunctions. The asymptotic behavior of generalized eigenfunctions is a consequence of an explicit expression of the Green function associated with the free quantum walk. When the position-dependent quantum walk is a finite rank perturbation of the free quantum walk, we derive a kind of combinatorial construction of the scattering matrix by counting paths of quantum walkers. We also mention some remarks on the tunneling effect.

arXiv:2009.03498•Reviews in Mathematical Physics•Mar 26, 2021•8 citations

Scattering theory and quantum walks

Mark S. Hillery, Edgar Feldman

We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through the graph, to the other. The particle propagates freely on the half lines but is scattered at each vertex in the original graph. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the graph. An example is presented. Classical random walks on graphs can be used to construct algorithms that solve 2-SAT, graph connectivity problems, and for finding satsifying assignments for Boolean functions. A hope is that recently defined quantum walks will prove similarly useful in the development of quantum algorithms. In fact, it has recently been shown that it is possible to use a quantum walk to perform a search on the hypercube faster than can be done classically [1]. In this problem

•Dec 8, 2003•0 citations

Quantum walks on graphs and quantum scattering theory

Edgar Feldman, Mark S. Hillery

We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that its behavior there is analogous to free propagation We are interested in how many steps it will take the particle, starting on one tail and propagating through the graph (where its propagation is not free), to emerge onto the other tail. The probability to make such a walk in n steps and the hitting time for such a walk can be expressed in terms of the transmission amplitude for the graph, which is one element of its S matrix. Demonstrating this necessitates a study of the analyticity properties of the transmission and reflection amplitudes of a graph. We show that the graph can have bound states that cannot be accessed by a particle entering the graph from one of its tails. Time-reversal invariance of a quantum walk is defined and used to show that the transmission amplitudes for the particle entering the graph from different directions are the same if the walk is time-reversal invariant.

arXiv:quant-ph/0403066•Mar 8, 2004•0 citations

Path integral approach to one-dimensional discrete-time quantum walk

Karthik S. Joshi, S. K. Srivatsa, R. Srikanth

Discrete-time quantum walk in one-dimension is studied from a path-integral perspective. This enables derivation of a closed-form expression for amplitudes corresponding to any coin-position basis of the state vector of the quantum walker at an arbitrary step of the walk. This provides a new approach to the foundations and applications of quantum walks.

arXiv:1803.00448•Mar 1, 2018•1 citation

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

Fabiano M. Andrade, M. G. E. da Luz

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 84, 042343 (2011)], we describe here---in a rather general way---the problem dynamics in terms of a true Feynman sum-over-paths history. This allows one to explicitly 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.

arXiv:1209.4953•Physical Review A•Oct 8, 2012•4 citations
In this work a Green-function approach for scattering quantum walks is developed. The exact formula has the form of a sum over paths and always can be cast into a closed analytic expression for arbitrary topologies and position-dependent quantum amplitudes. By introducing the step and path operators, it is shown how to extract any information about the system from the Green function. The method's relevant features are demonstrated by discussing in detail an example, a general diamond-shaped graph.
We consider the time-independent scattering theory for time evolution operators of one-dimensional two-state quantum walks. The scattering matrix associated with the position-dependent quantum walk naturally appears in the asymptotic behavior at the spatial infinity of generalized eigenfunctions. The asymptotic behavior of generalized eigenfunctions is a consequence of an explicit expression of the Green function associated with the free quantum walk. When the position-dependent quantum walk is a finite rank perturbation of the free quantum walk, we derive a kind of combinatorial construction of the scattering matrix by counting paths of quantum walkers. We also mention some remarks on the tunneling effect.
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through the graph, to the other. The particle propagates freely on the half lines but is scattered at each vertex in the original graph. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the graph. An example is presented. Classical random walks on graphs can be used to construct algorithms that solve 2-SAT, graph connectivity problems, and for finding satsifying assignments for Boolean functions. A hope is that recently defined quantum walks will prove similarly useful in the development of quantum algorithms. In fact, it has recently been shown that it is possible to use a quantum walk to perform a search on the hypercube faster than can be done classically [1]. In this problem
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that its behavior there is analogous to free propagation We are interested in how many steps it will take the particle, starting on one tail and propagating through the graph (where its propagation is not free), to emerge onto the other tail. The probability to make such a walk in n steps and the hitting time for such a walk can be expressed in terms of the transmission amplitude for the graph, which is one element of its S matrix. Demonstrating this necessitates a study of the analyticity properties of the transmission and reflection amplitudes of a graph. We show that the graph can have bound states that cannot be accessed by a particle entering the graph from one of its tails. Time-reversal invariance of a quantum walk is defined and used to show that the transmission amplitudes for the particle entering the graph from different directions are the same if the walk is time-reversal invariant.
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 84, 042343 (2011)], we describe here---in a rather general way---the problem dynamics in terms of a true Feynman sum-over-paths history. This allows one to explicitly 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.