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:2009.03498 · Reviews in Mathematical Physics

Generalized eigenfunctions for quantum walks via path counting approach

Takashi Komatsu, Norio Konno, Hisashi Morioka, Etsuo Segawa

Published Mar 26, 2021• 9 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1142/s0129055x21500197

Related papers

Generalized eigenfunctions and scattering matrices for position-dependent quantum walks

Hisashi Morioka

We study the spectral analysis and the scattering theory for time evolution operators of position-dependent quantum walks. Our main purpose of this paper is the construction of generalized eigenfunctions of the time evolution operator. Roughly speaking, the generalized eigenfunctions are not square summable but belong to [Formula: see text]-space on [Formula: see text]. Moreover, we derive a characterization of the set of generalized eigenfunctions in view of the time-harmonic scattering theory. Thus we show that the S-matrix associated with the quantum walk appears in the singularity expansion of generalized eigenfunctions.

arXiv:1809.02988•Reviews in Mathematical Physics•Jan 15, 2019•22 citations

Explicit expression of scattering operator of some quantum walks on impurities

Komatsu, Takashi, Norio Konno, Hisashi Morioka +1 more

In this paper, we consider the scattering theory for a one-dimensional quantum walk with impurities which make reflections and transmissions. We focus on an explicit expression of the scattering operator. Our construction of the formula is based on the counting paths of quantum walkers. The Fourier transform of the scattering operator gives an explicit formula of the scattering matrix which is deeply related with the resonant-tunneling for quantum walks.

arXiv:1912.11555•Dec 24, 2019•3 citations

Resonant scattering for tunable quantum walks on graphs with tails

Kenta Higuchi, Ryuta Ishikawa, Hisashi Morioka +2 more

Abstract We study the resonant scattering for discrete time quantum walks on graphs with some tails. In our arguments, we reduce the study of resonances to the perturbation of eigenvalues of a finite rank matrix associated with the internal graph. Then we can apply Kato’s perturbation theory of matrices, and the reduction process of generalized eigenspaces allows us to derive an explicit asymptotic expansion of the scattering matrix. As a consequence, we obtain the resonant scattering at resonant energies.

arXiv:2602.03192•Journal of Physics A Mathematical and Theoretical•May 27, 2026•1 citation

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•Contemporary mathematics - American Mathematical Society•Jan 1, 2005•38 citations

Green-function approach for scattering quantum walks

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

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.

arXiv:1112.2614•Physical Review A•Oct 31, 2011•9 citations

Modifying quantum walks: a scattering theory approach

Edgar Feldman, Mark S. Hillery

We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering theory. The probability of entering a graph from one tail and leaving from another can be found from the scattering matrix of the graph. We show how the scattering matrix of a graph that is an automorphic image of the original is related to the scattering matrix of the original graph, and we show how the scattering matrix of the reverse graph is related to that of the original graph. Modifications of graphs and the effects of these modifications are then considered. In particular we show how the scattering matrix of a graph is changed if we remove two tails and replace them with an edge or cut an edge and add two tails. This allows us to combine graphs, that is if we connect two graphs we can construct the scattering matrix of the combined graph from those of its parts. Finally, using these techniques, we show how two graphs can be compared by constructing a larger graph in which the two original graphs are in parallel, and performing a quantum walk on the larger graph. This is a kind of quantum walk interferometry.

arXiv:0705.4612•Journal of Physics A Mathematical and Theoretical•Aug 29, 2007•54 citations
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 the spectral analysis and the scattering theory for time evolution operators of position-dependent quantum walks. Our main purpose of this paper is the construction of generalized eigenfunctions of the time evolution operator. Roughly speaking, the generalized eigenfunctions are not square summable but belong to [Formula: see text]-space on [Formula: see text]. Moreover, we derive a characterization of the set of generalized eigenfunctions in view of the time-harmonic scattering theory. Thus we show that the S-matrix associated with the quantum walk appears in the singularity expansion of generalized eigenfunctions.
Abstract We study the resonant scattering for discrete time quantum walks on graphs with some tails. In our arguments, we reduce the study of resonances to the perturbation of eigenvalues of a finite rank matrix associated with the internal graph. Then we can apply Kato’s perturbation theory of matrices, and the reduction process of generalized eigenspaces allows us to derive an explicit asymptotic expansion of the scattering matrix. As a consequence, we obtain the resonant scattering at resonant energies.
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.
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 show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering theory. The probability of entering a graph from one tail and leaving from another can be found from the scattering matrix of the graph. We show how the scattering matrix of a graph that is an automorphic image of the original is related to the scattering matrix of the original graph, and we show how the scattering matrix of the reverse graph is related to that of the original graph. Modifications of graphs and the effects of these modifications are then considered. In particular we show how the scattering matrix of a graph is changed if we remove two tails and replace them with an edge or cut an edge and add two tails. This allows us to combine graphs, that is if we connect two graphs we can construct the scattering matrix of the combined graph from those of its parts. Finally, using these techniques, we show how two graphs can be compared by constructing a larger graph in which the two original graphs are in parallel, and performing a quantum walk on the larger graph. This is a kind of quantum walk interferometry.