Dynamical system induced by quantum walk
Yusuke Higuchi, Etsuo Segawa

TL;DR
This paper studies quantum walks on graphs with tails, showing the existence of stationary states, perfect transmission, and how adding tails affects scattering behavior, revealing fundamental properties of quantum transport on graphs.
Contribution
It demonstrates the existence of stationary states and perfect transmission in quantum walks on graphs with tails, and characterizes scattering behavior with multiple tails, advancing understanding of quantum transport.
Findings
Stationary states exist for any connected internal graph.
Perfect transmission occurs in the long time limit.
Adding more tails changes the scattering behavior to a local one-step scattering manner.
Abstract
We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an -infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a stationary state exists, moreover a perfect transmission to the opposite tail always occurs in the long time limit. We also show that the lower bound of the norm of the stationary measure restricted to the internal graph is proportion to the number of edges of this graph. Furthermore when we add more tails (e.g., -tails) to the internal graph, then we find that from the temporal and spatial global view point, the scattering to each tail in the long time limit coincides with the local one-step scattering manner of the Grover walk at a vertex whose degree is .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
**Dynamical system induced by quantum walk **
Yusuke Higuchi***Email: [email protected]
Mathematics Laboratories, College of Arts and Sciences, Showa University,
Fujiyoshida, Yamanashi 403-0005, Japan.
Etsuo Segawa†††Email: [email protected]
Graduate School of Education Center, Yokohama National University
Hodogaya, Yokohama 240-8501, Japan.
Abstract. We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an -infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a stationary state exists, moreover a perfect transmission to the opposite tail always occurs in the long time limit. We also show that the lower bound of the norm of the stationary measure restricted to the internal graph is proportion to the number of edges of this graph. Furthermore when we add more tails (e.g., -tails) to the internal graph, then we find that from the temporal and spatial global view point, the scattering to each tail in the long time limit coincides with the local one-step scattering manner of the Grover walk at a vertex whose degree is . 000 *Keywords: * Quantum walk, bounded stationary state, scattering, dynamical system
1 Introduction
It is well known that for the discrete-time isotropic random walk on a connected finite graph, the probability distribution converges to the stationary distribution which is proportion to the (; that is, the maximal) -eigenvalue’s eigenvector of the transition matrix. On the other hand, for a quantum walk whose time evolution is a unitary operator, its stationarity with a natural initial state; e.g., starting from an arbitrary arc, cannot be expected to be described in such a way in general because the spectrum of the time evolution operator is distributed on the unit circle in the complex plane, which means every eigenvalue satisfies .
There exist many kinds of comparison studies between classical and quantum settings. For example, the hitting times on some family of graphs by classical algorithms based on a random walk and quantum algorithms based on a so-called continuous-time quantum walk are discussed in [3, 4]. Of course, we can find other works on classical and quantum algorithms and hitting time in the discrete-time, for instance, in [21] and its references therein.
Turning our eyes towards “stationary state” of infinite graphs, especially for the (infinite) one-dimensional lattice , we can see a series of works finding a stationary measure of quantum walks in the following meaning: let taking complex value at each arc of the one-dimensional lattice be the -th iteration of a quantum walk on one-dimensional lattice whose initial state no longer needs to square summable. Then we call a stationary measure if and only if for any natural number . Note that a stationary state is derived from a generalized eigenfunction immediately, but this is not everything as is suggested by an interesting example in [18].
Thus finding such stationary measure is a non-trivial problem and related to trying to understand the behaviour of quantum walks as a kind of process. Towards addressing this challenging problem, a classification of the generalized eigenfunctions’ shape of quantum walks on are gradually revealed with respect to the absolute values, e.g., uniformity [16], the support finiteness [14], polynomially increasing [18] and exponentially decreasing [17]. Around them, the transfer matrix, which is a standard method in the spectral analysis on the CMV matrix, e.g., [8], is rediscovered in the context of quantum walks [13] and applied to obtain some generalized eigenfunctions efficiently. These results depending on just the some “static” class of eigenfunctions are quite interesting, but does not reflect the behaviour of the unitary dynamics which the quantum walk originally reveals. Thus it is natural to ask for a meaning of these stationary measures and states from the view point of dynamics which quantum walks originally have; some results can be seen in [5, 6, 19].
Let us give a short review on [19], where a simple quantum walk model on is introduced and its dynamics is discussed. In result, such a quantum walk is succeeded in connecting the quantum dynamics of double well potentials provider’s a quantum resonance effect. In the setting of this model, all quantum coins assigned to all the vertices except the two vertices produce a free-walk; that is, no reflection, while the quantum coins assigned at the exceptional two vertices produce a non-trivial scattering, and the initial state is externally injected at each time step from the negative side on the one-dimensional lattice. Then it is obtained that there is a stationary state as the limit of the time iterations from this initial state and this stationary state coincides with one of the bounded generalized eigenfunction of the whole system of unitary time evolution operator obtained in [13]. Moreover it is shown that this model includes the quantum walk model whose stationary state coincides with the solution of the stationary Schrödinger equation on the metric one-dimensional lattice with the double well delta potential [1]. Here the notion of a ‘quantum graph walk’ introduced by [9] plays an important role.
In this paper, we tend to extend the model from that in [19]: (1) we generalize the connected finite graph, the internal graph; (2) we increase the number of tails, that is, the number of directions for observing the behaviour of scattering on the internal; (3) we observe the distribution of penetration into the internal, that is, a kind of conditional probability on the internal. In the next section, using a simple example, the internal graph is a -cycle with two tails, we demonstrate and illustrate what we intend. We first expect that the stationary state of a quantum walk can be obtained by a balance between the inflow and the outflow in two-tail model. In result, we obtain the existence of stationarity [5, 6] by a notion of dynamical system [22]. Moreover, using some by-product of this proof and the eigenspace of Grover walk induced by homological structure of graph, we characterized some detailed properties of the stationary state and the penetration state.
To explain our setting and results more precisely, let us first give some notations and definitions of Grover walk on a graph. Let be a connected graph. Each edge produces the two kinds of arcs and , where is called the inverse arc of . The set of arcs is denoted by . Remark that if and only if ; we sometimes call a symmetric arc set. The total Hilbert space of the Grover walk is generated by ; that is, the set of all the functions taking a complex value at each arc. The time evolution is given by the following unitary operator :
[TABLE]
Here the origin and terminal vertices of are denoted by and , respectively. Thus it holds that , . For example, if and is connected by the single edge, the arc from and to is denoted by . Then and hold. Moreover is the degree of the vertex ; that is, . Let be the -th iteration of the Grover walk, that is, with some initial state. For arbitrary , if we put such that for , then the one-step local Grover walk’s scattering at the vertex is described by
[TABLE]
Here for ,
[TABLE]
and is the -dimensional Grover matrix, that is, .
Let be the internal finite graph and the induced symmetric arc set be denoted by . The degree of in , , is denoted by . We arbitrarily choose two vertices and from the vertex set . We join two additional semi-infinite length paths to the input and output vertices and , respectively. We denote the input and output tails joined to by and joined to by , respectively. The graph adding the two infinite length tails to is denoted by with the symmetric arc set and the degree of in , , is denoted by .
We inject the external source to the input vertex {\color[rgb]{0,0,0}u_{+}} at every time step, in other words, we set the initial state by
[TABLE]
Iterating the Grover time evolutions on , we can state that a new quantum walker continuously comes from at every time step, while once a quantum walker goes outside of the internal graph , then she never goes back to since the Grover walk dynamics on the two-tail is the free quantum walk by (1.1). Under such a situation, we shall take the Grover walk’s time iterations many times. Now the following natural questions may arise:
- (1)
Does the stationary state exist ? 2. (2)
If the stationary state exists, what is the shape of , especially, the transmission rate and the reflection rate as the outflow from and , respectively in the long time limit; that is, for with , and with , what are the following values
[TABLE]
and also what kinds of graph structure are reflected the shape of ?
The answer for (1) has been obtained by [5, 6] (2005, 2007) as follows.
Theorem 1.1**.**
([6]) For any connected finite graphs and for any connected manner of two infinite tails, the stationary state uniquely exists; that is,
[TABLE]
Remark that and belongs to category. The existence of the stationary state under more general setting, Assumption 1 (cf. [6]), can be seen in Theorem 3.1 in Section 3. Although there may be similar statements to [6], we emphasize that we give an understanding of the result on [6] from the view point of the Jordan decomposition of a dynamical mapping [22] since this map loses the normality due to the cut-off with respect to the internal graph of the unitary operator on the whole system.
By using this existence of the stationary state, we can further proceed the analysis of the stationary state to find specialities of the Grover walk in the following theorems. These are our main results.
Theorem 1.2**.**
Let us consider the Grover walk model on a finite internal graph with two tails and keep inserting inflow from one tail with the amplitude . Then for any connected graphs and for any connected manner of two infinite tails, the perfect transmission always happens; that is, and . Moreover the stationary state satisfies the following properties
[TABLE]
The first equation (1.2) implies that the average with respect to all the arcs whose terminus (origin) are , is while the second equation (1.3) implies that the average with respect to two arcs, whose support edges are the same, is also . Although the notion of so-called a perfect state transfer of discrete-time quantum walks e.g., [23] is different from our perfect transmission , finding its connections is one of the interesting future’s problems. Moreover let us see a relation to [4] considering a so-called continuous-time quantum walk on binary trees as the internal graph : if the energy of the incident wave is , then the perfect transmitting occurs in this model. The Grover walk, which we treat in this paper, corresponds to the potential free case of the quantum graph [9] which is the stationary Schrödinger equation on a metric graph. Since the constant value is inputted into the internal graph at every step in our case, the energy corresponds to [math]. Therefore the perfect transmitting of the Grover walk with the tail number seems to be consistent with [4].
By applying the Cauchy-Schwartz inequality to (1.2) or (1.3), we obtain the following corollary which implies a penetration into the internal graph always occurs in the large time behavior.
Corollary 1.1**.**
The total mass in the internal graph has the following lower boundary:
[TABLE]
We also consider a natural extension of the number of tails from to . Then we obtain the following interesting result which shows that a temporal and spatial global view point of our Grover walk model can be interpreted as the one-step local Grover walk’s scattering on a vertex of degree . More precisely, we obtain the following theorem.
Theorem 1.3**.**
Consider an infinite graph constructed of a finite internal graph and -tails
[TABLE]
Let such that for . Assume that the amplitude of the inflow on is . Then there exists a stationary state and we have
[TABLE]
where is the average of . Moreover
[TABLE]
holds, where
[TABLE]
Since is self-adjoint unitary, Theorem 1.3 implies that for arbitrary output flow , there exists an input flow to accomplish the output flow using this Grover walk model; the input flow is of the form . A constant inflow we consider in this paper corresponds to the incident wave with to the internal graph in [6], thus our situation may be said to be somewhat simpler. Instead we can apply the technique of spectral decomposition of the Grover walk and thus obtain more detailed information of the stationary state, for example, on not only the surface of the internal graph but the interior. To generalize this theorem for some general is one of the interesting future problems because this problem is deeply related to an extraction of structures of the internal graph by just observing the response to the input of the general incident wave i.e., the scattering, as is considered by, for examples, [5, 6] and [3, 4] for the discrete-time and continuous-time cases, respectively.
This paper is organized as follows. In section 2, we give a demonstration for the cycle graph with three vertices case comparing with the theoretical and numerical results. This simple but fruitful example shall show what we intend. In section 3, we give the proof of Theorem 1.1. The time evolution restricted to the internal graph is regarded as a dynamical mapping with the every time external injection. This map is no longer a normal operator in general. So we consider a general eigen-problem by taking the Jordan decomposition and show that the system is always included in the stable generalized eigenspace [22], which implies the convergence of this dynamical system to a fix point. In this section, we also characterise the center generalized eigenspace for the Grover walk which must be eliminated from the general solution of the linear equation for the stationary state. We convert the eigen-problem, whose computational basis are generated by arcs, to a vertex based operator’s one; a non-linear eigenequation with respect to the Dirichlet random walk associated with the boundary . Combining this with the arc-based analysis, we completely characterize the center generalized eigenspace. The center generalized eigenspace is generated by the set of fundamental cycles of and the eigenvectors of the Dirichlet random walk whose supports have no-overlap to any vertices connected to the tails. In section 4, we give the proof of Theorem 1.2. We show that the perfect transmission can be derived from the Perron-Frobenius theorem with some combinatorial flow analysis and the unitarity of the time evolution operator on the whole system and the stationarity of . In section 5, we take the extension of the number of tails from to and we show Theorem 1.3. Combining it with the characterization of the center generalized eigenspace in the previous section, we can conclude that the stationary state is expressed by the combinatorial flow which is orthogonal to the eigenspace induced by the fundamental cycles of . This means that an electric current on the circuit described by the internal graph gives the stationary state driven by the Grover walk. See Corollaries 5.1 and 5.2. We further discuss on that relation between quantum walks and the electric circuit in the forthcoming paper [12]. Finally we give the summary in Section 6.
2 A demonstration
In this section, to demonstrate our result, we treat the cycle with three vertices denoted by as the internal graph . We set the initial state by . Let the complex valued amplitude at each arc on the -th iteration denoted as in Fig. 1. Then we have
[TABLE]
Putting and denote the matrix in RHS by and the second term vector corresponding to inflow injecting constantly into the internal graph in RHS by , then we rewrite
[TABLE]
Remark that since the matrix is a submatrix of the infinite dimensional unitary operator on the whole system, then is no longer unitary. Furthermore, is not a normal operator, which means that we can not take an orthogonal decomposition to . The most important thing we expect is whether convergences or not as tends to . To confirm it, we have done the numerical analysis on the eigenvalue of . See Fig. 2 for the geometric expression for on the complex plain. We can observe that all the absolute value of the eigenvalues except the -eigenvalue is strictly less then . The eigenspace of the -eigenvalue is expressed by
[TABLE]
Using the induction with respect to time step and putting the above vector , that is, , we can state that is orthogonal to . This orthogonality is still not enough to show that is in the complement invariant space of the invariant subspace including ’s since is not a normal operator. However as we will see later the invariant space of , whose absolute value of the eigenvalue is denoted by , is orthogonal to its complement invariant subspace denoted by . Thus there are no contributions of such a -eigenspace to this time evolution, which implies the convergence of since the other absolute value of the eigenvalues are strictly smaller than . Then we can solve the following inhomogeneous linear equation with confidence to obtain the stationary state :
[TABLE]
Remarking that since , is not invertible. The expression for the solution space so that the first term in the following has no overlap to -eigenspace is
[TABLE]
that is, . Therefore the reflection and transmission rates are computed by and , respectively. Moreover we can confirm that satisfies both (1.2) and (1.3).
3 Proof of Theorem 1.1: uniquely existence of the stationary state
3.1 Proof of Theorem 1.1
Here we shall mainly give the proof of Theorem 3.1 stated soon later in this section, which is a generalization of Theorem 1.1; we can see the statement of Theorem 3.1 coincides with that of Theorem 1.1, if , and .
Let be the additional tails to give an infinite inflow toward the internal graph. The vertices of the tail are labeled by , where . Define the sets of functions on and {\color[rgb]{0,0,0}A_{0}} by and , respectively. Let be a complex valued sequence assigned to each tails such that the initial state is denoted by
[TABLE]
Here with .
We consider the following general setting as follows.
Assumption 1**.**
- (1)
: connected and finite; 2. (2)
the unitarity of on such that ; 3. (3)
the free walk on the tails such that and (, ). Here with ; 4. (4)
the initial state is (3.8).
Let be the boundary operator of such that for any , . The adjoint is described by
[TABLE]
Remark that is the identity operator of and is the projection operator with respect to .
Theorem 3.1**.**
We assume the above settings (1), (2), (3) and (4). Let be the -th iteration of the unitary evolution for the initial state . Moreover let us decompose into , where , and . Then
[TABLE]
Moreover ’s satisfy
[TABLE]
Proof of Theorem 3.1.
Let be the submatrix of the whole unitary time evolution operator restricted to , that is, . Putting , we have
[TABLE]
for . Therefore in the internal graph, the dynamics is described by
[TABLE]
where is the “external source” defined by . Then (3.9) implies
[TABLE]
Thus our task will be to analyze the spectra of and to show the convergence of .
Before going to spectral analysis on , we give the following remark. The time evolution operator is no longer a normal operator, then is not ensured the diagonalization in general. So from now on, we consider the Jordan decomposition. Recall a general theory on the linear algebra such that the generalized eigenspace of is the invariant subspace spanned by . Moreover let us recall also that is similar to
[TABLE]
Here is the -dimensional matrix such that
[TABLE]
Since , and our interest is the convergence in the limit of , we remark that if , then
[TABLE]
where and all the elements below the main diagonal are zero, while if , then the above LHS diverges. We introduce the invariant subspaces , and called a unstable generalized eigenspace, a center generalized eigenspace and a stable generalized eigenspace induced by , respectively [22]:
[TABLE]
Considering the -th iteration of our model, , and (3.10), we should concentrate on to showing for the convergence of .
Lemma 3.1**.**
.
Proof.
Assume that holds. Then taking square modulus, we have . ∎
The following statements are simple but the keys for the proof of the convergence.
Lemma 3.2**.**
If and , then . Here is the adjoint of .
Proof.
Since , holds. In the following, let us see if . Assume that . Then , that is, there must exist such that . Thus we have
[TABLE]
on the other hand,
[TABLE]
since is unitary. This contradicts with . In result,
[TABLE]
if with . We can easily see remarking , and the unitarity of . ∎
By Lemma 3.2, we can show that for any with ,
[TABLE]
for any as follows.
Lemma 3.3**.**
* is an eigenspace; that is,*
[TABLE]
Proof.
For with and , noting that , then
[TABLE]
By Lemma 3.2, . Thus must be . ∎
Lemma 3.4**.**
.
Proof.
Let and with and . By (3.3), it is sufficient to check the orthogonality of and . Then
[TABLE]
For the final equation, we used Lemma 3.2. Since , we obtain the orthogonality. ∎
Lemma 3.5**.**
We have .
Proof.
The center generalized eigenspace is the eigenspace spanned by ’s. Here by (3.12). We examine the orthogonality. Lemma 3.2 implies
[TABLE]
Then by Lemma 3.4, we have obtained the desired conclusion. ∎
By Lemma 3.5, we have for any . Since , then we obtain the existence .
Finally, we consider a meaning of the existence of to the whole system . Putting , we have . Then
[TABLE]
holds. The state newly going outside of the internal graph at time is denoted by ; the support of is all the arcs of tails whose origins are . It holds that
[TABLE]
Here the first term of corresponds to the value on transmitted from the internal graph and the second one does to the value on scattered at from the external paths. Using (3.16), we have
[TABLE]
Then putting , we obtain the limit of such that
[TABLE]
Now let us put , which represents the history of the out flow from the internal graph for large time steps. Then we have
[TABLE]
by (3.16). On the other hand,
[TABLE]
Here in the second equation, we used (3.17), and . Then putting , we have
[TABLE]
which completes the proof of Theorem 3.1.
3.2 for the Grover walk case
In the previous subsection, we observed the convergence in the our model in the long time limit. In order to find the stationary solution, we have to solve the linear equation , where . Consider case. Then the solution is in formal. For more practical point of view, we need to eliminate the element of ; this is the meaning of “”. Therefore in this subsection, we confirm the consistency of the previous section and characterize for the Grover walk case.
We introduce the incident matrix describing the incidence from an arc to its terminal vertex as follows: for any and ,
[TABLE]
This boundary operator satisfies the following properties.
Lemma 3.6**.**
- (1)
, where ; 2. (2)
, where ; 3. (3)
, where is the Dirichlet random walk operator on with the boundary ; that is,
[TABLE]
Therefore if we take the product of and from the right to , we can see a relatively familiar self-adjoint operator, , and the almost similar to the identity operator except on the boundaries, , respectively. Indeed we have the following lemma using the above properties.
Lemma 3.7**.**
Let be the matrix such that . Then we have
[TABLE]
where
[TABLE]
We define . Then Lemma 3.7 immediately implies . On the other hand, since is an invertible matrix, then . Thus the following lemma holds.
Lemma 3.8**.**
The subspace is invariant subspace under the action of ; that is,
[TABLE]
When would be a normal operator, is the complement invariant subspace of automatically. Now the normality of does not hold. However without the normality of , the following statement still holds.
Lemma 3.9**.**
* can be decomposed into , that is, the orthogonal complement subspace of is the invariant subspace with respect to . More precisely,*
[TABLE]
Proof.
The orthogonal complement is expressed by
[TABLE]
It is easy to confirm that, for any , hold, respectively. Then is an invariant subspace under the action of , that is, . ∎
Under the decomposition of , we have and then . Since the external source is expressed by
[TABLE]
then we have , where for any , is the characteristic vector of such that
[TABLE]
Therefore by Lemma 3.8, we have for any which is consistent with the previous section. Remark that in the previous example of , the eigenvalue comes from this eigenspace .
Now we can concentrate on the subspace . By Lemma 3.7, the eigenequation for is switched to
[TABLE]
We give a useful characterization of .
Lemma 3.10**.**
[TABLE]
Proof.
For any , it holds . Then taking product of and from the left, we have
[TABLE]
respectively. By the Gaussian elimination process, we have
[TABLE]
Then we have {}^{T}[f\;g]\in\ker(1-E_{GON}^{{\color[rgb]{0,0,0}2}}). On the other hand, for any {}^{T}[f\;g]\in\ker(1-E_{GON}^{{\color[rgb]{0,0,0}2}}), it holds
[TABLE]
which is equivalent to . With the fact by definition of , we have . Thus . ∎
Therefore the eigenequation is equivalent to solving the following eigenequation
[TABLE]
If , then . However we will show in Lemma 3.13 that this case can be also eliminated; that is, . Then .
If , then by Lemma 3.7
[TABLE]
Thus if we could solve the eigenequation with respect to , we would obtain the spectrum of directly, but it is hard to directly find an effective expression for the solution in our impression although we will use the expression (3.20) later.
Then from now on, in the last half of this discussion, we take some consideration on directly, without the consideration on , and finally we combine this consideration with (3.20), and address to show that all the non-negligible eigenstates of eigenvalues are . To this end, we consider the eigenequation
[TABLE]
and find some properties of .
First, we give the following lemma.
Lemma 3.11**.**
Put . The operator is decomposed into under the space decomposition of
[TABLE]
For any , the local operator is expressed by
[TABLE]
where and are the -dimensional all matrix and identity matrix, respectively. Then we have
[TABLE]
Since for , we have . Moreover since and are unitary, the relation
[TABLE]
implies that which implies . This is consistent with Lemma 3.1.
Secondly, we show ; that is, the derivation of -generalized eigenspace come from . To this end, we give the following lemma related to the Kirchhoff condition on the boundary.
Lemma 3.12**.**
Let with and we set by its eigenvector. Then
[TABLE]
for every .
Proof.
The -eigenstate and -eigenstate of are
[TABLE]
respectively for any . If with , then we have since is a self-adjoint unitary. Taking the norms of both sides, we have
[TABLE]
because . To conserve the norm, () must belong to -eigenstate of , since the absolute value of eigenvalue for cannot be due to the setting of the graph with tails; for . Therefore we have
[TABLE]
On the other hand, implies
[TABLE]
for any by definition of . So if , then by (3.24), the above equation is reduced to
[TABLE]
which is equivalent to
[TABLE]
Applying this to (3.24), we have
[TABLE]
Since , we have
[TABLE]
∎
Using Lemma 3.12, we obtain the following lemma.
Lemma 3.13**.**
Let with . Then .
Proof.
Assume . Let with ; we shall show a contradiction. For the case where , we can show it in a similar way. The eigenequation holds if and only if
[TABLE]
The first equality comes from the definition of and the second equality is obtained by changing the arc in the first equation to the inverse . Combining the second and third ones, we can notice that “” is the value of the reversible measure on of the isotropic random walk on the whole graph . Thus for any , there exists a constant which is independent of the choice of vertices such that for any ,
[TABLE]
Then for every , it holds that
[TABLE]
By Lemma 3.12, choosing such that , we have , which implies
[TABLE]
Therefore (3.29) and (3.30) imply and , respectively. Then we have by (3.18), which is the contradiction.
∎
Thirdly, we show the generalized eigenspace of with are spanned by eigenvectors of restricted to . To this end, now we combine the above statement obtained by arc based analysis with the fact (3.20) obtained by vertex based analysis.
Lemma 3.14**.**
Let with and be the function defined in (3.20). Then we have
[TABLE]
for any .
Proof.
By Lemma 3.7, we can write
[TABLE]
Using the Kirchhoff boundary condition on in Lemma 3.12, we have for the inflows to ,
[TABLE]
where . On the other hand, for the outflows from ,
[TABLE]
The above two equations provide . Since by Lemma 3.13, we conclude that . ∎
Let be the set of all fundamental cycles in ; in particular, and are the subsets of of even and odd length, respectively. Let be
[TABLE]
for a fundamental cycle with and , otherwise . Moreover let be
[TABLE]
for an even length fundamental cycle ; otherwise . It is easy to check that
[TABLE]
Furthermore if , then we fix an odd cycle . For any other cycle of add length, we can find a closed path constructed by and , say . Here if and have some common vertex, then we find a closed path of even length such that if . Thus we can define as stated above. If and are disjoint, then there exists a path such that
[TABLE]
We may set and , where and . Then we define as
[TABLE]
and . We can easily check that
[TABLE]
We obtain the following theorem.
Theorem 3.2**.**
Let . Let us define the following three subspaces , such that
[TABLE]
Then for the Grover walk case, the center generalized eigenspace is expressed as follows:
[TABLE]
Under this decomposition, the eigenvalues of the first and second terms are while those of the finial term are with and .
Proof.
Let us consider the eigenequation with . By Lemmas 3.9 and 3.13, we have if and only if . On the other hand, by (3.20), if , then , where .
- (1)
the case where case. From Lemma 3.14, for with , and for any , we have
[TABLE]
since and . Here . 2. (2)
the case where . Recalling Lemma 3.9, we can state that the orthogonal complement space is the invariant subspace with respect to , and under the decomposition of , we have . By using the fact [10], we have .
This completes the proof. ∎
As a by-product of the above discussion, we obtain the following properties of (3.20).
Corollary 3.1**.**
Let be a solution of
[TABLE]
Then satisfies the following properties:
- (1)
; 2. (2)
If , then we have
[TABLE]
4 Proof of Theorem 1.2: perfect transmission
Let us recall that and denote the degrees of in the internal graph and the whole infinite graph , respectively. From this section, we restrict our consideration to the case where , and in (3.8). We put as the stationary state and . Let such that
[TABLE]
Using this notation, the transmission and reflection rates are expressed by
[TABLE]
Our target is to show or . The stationary state restricted to the internal graph is described by and the external source is rewritten by (3.19). Recall that the convergence is ensured by Theorem 1.1. Then is reexpressed by
[TABLE]
where . Then our interest is switched to the sequence of . We find the following three-term recursion relation of as follows.
Lemma 4.1**.**
Let be the above. Then we have
[TABLE]
We take the summation of over : . Using Lemma 4.1, we obtain
[TABLE]
Furthermore, putting the -dimensional degree matrix by , we can give another expression as
[TABLE]
Thus
[TABLE]
holds. To solve (4.34), we need to clarify .
Lemma 4.2**.**
Let and be the above. Then we have
[TABLE]
where .
Proof.
is expressed by , where is the transition Dirichlet random walk with the boundary . Then
[TABLE]
where is the isotropic random walk on itself. Then by the Perron-Frobenius theorem, for some constant . Then we obtain the desired conclusion. ∎
Then we can reexpress LHS of (4.34) as follows using a constant such that
[TABLE]
Inserting and into (4.36) and using the expressions of and in (4.32), (4.33), respectively, we have
[TABLE]
On the other hand, from the unitarity of the time evolution of the whole system and the stationarity, we obtain the conservativeness with respective to the transmission and reflection rates.
Lemma 4.3**.**
Let be a subgraph of the internal graph and be the set of arcs connecting between and such that for any , , and is the inverse of . Then we have
[TABLE]
In particular, let and be the above. Then we have
[TABLE]
Proof.
Let be the unitary time evolution operator on the whole system . Then by the stationarity of , we have
[TABLE]
Taking the square norms of both sides, by the unitarity of , we obtain If we choose the subgraph as the internal graph , then holds. Then we obtained the desired conclusion. ∎
Thus using the expressions (4.37) and (4.38) for and , respectively, we can solve the ’s satisfying the condition of Lemma (4.3) by
[TABLE]
[TABLE]
which implies and
[TABLE]
by the definition of . The following lemma is immediately obtained by for any .
Lemma 4.4**.**
For every ,
[TABLE]
Then if , then, inserting (4.40) into RHS in Lemma 4.4, we obtain
[TABLE]
Now the final task to complete the proof of Theorem 1.2 is to eliminate the possibility of .
If , then by the same way as the case, we have , and
[TABLE]
This is nothing but the combinatorial flow on the graph. Using the following combinatorial analysis completes our final task. We take a summation over all the flow in the internal arcs . First we divide this summation into each vertex with respect to the inflows while the second one we divide it with respect to the outflows. It holds that
[TABLE]
Here we used (4.41) in the first equality and we used (4.42) in the second equality, the third equality comes from the external source. On the other hand,
[TABLE]
Both LHS’s stated above coincide with , which is a contradiction. Thus we have reached to the desired conclusion.
5 Proof of Theorem 1.3: scattering from a global view point
Proof of Theorem 1.3: We notice that up to at least Lemma 4.3, there are no conflicts even if we extend the setting of the number of tails from to . We insert the inflows from each tail, that is, , for in (3.8). Then just changing to in RHS of (4.34), we have
[TABLE]
where such that
[TABLE]
Let Then by Lemma 4.2, we have
[TABLE]
Then using the expressions for the transmission and reflection amplitudes in (4.37), (4.38), we obtain the outflow from the vertex in the long time limit by
[TABLE]
Since the time evolution operator is a real operator, applying Lemma 4.3 and dividing the inflow and outflow into the real and imaginary parts; that is, and , we have
[TABLE]
Here , which is the average of the inflows.
For the same reason for the flow consistency discussed in the previous section, if , then must be . Therefore inserting the new value into (5.45), we obtain
[TABLE]
Since the outflow in the long time limit; , can be are expressed by
[TABLE]
we obtain (1.6) in Theorem 1.3.
Inserting the new value into (5.44), we have
[TABLE]
Then we obtain (1.4) in Theorem 1.3, and combining this with Lemma 4.4, we obtain (1.5) in Theorem 1.3. We have completed the proof of Theorem 1.3.
By Lemma 4.4, we also obtain the following corollary.
Corollary 5.1**.**
Let the setting be the same as in Theorem 1.3. Then is a combinatorial flow of , that is;
[TABLE]
for any and .
Proof.
By (5.46), we have
[TABLE]
which implies for any . By Lemma 4.4,
[TABLE]
for any . Then we can easily check that . ∎
Moreover we can state further property of as follows.
Corollary 5.2**.**
Let the setting be the same as in Theorem 1.3 and let be the same as in Corollary 5.1. Then for any cycle with in , it holds
[TABLE]
Proof.
By Theorem 3.2, must be orthogonal to ; that is, for any . Remark that if , then for any constant , , where , by the definition of . Then for any fundamental cycle ,
[TABLE]
Here we used the skew symmetry of in the final equation. Since for any cycle , is expressed by a linear combination of , we obtain the desired conclusion. ∎
Corollaries 5.1 and 5.2 correspond to Kirchhoff’s current law for the constant resistance value and Kirchhoff’s voltage law, respectively. Then we conclude that the stationary state of our model driven by the Grover walk expresses an electric current on the circuit described by .
6 Summary
We considered the Grover walk on a graph with infinite length tails. The dynamics on these tails is the free quantum walk. We set the initial state so that the internal graph receives the same value inflows from the outside , that is, the tails, at every time step. Then we obtained the stationary state of this quantum walk and a kind of the Kirchhoff law of the stationary state (Theorems 1.1, 1.2 and 3.2).
Moreover the global scattering so that the internal graph can be regarded as a vertex, we obtain the local scattering manner of the Grover walk is reproduced in the long time limit (Theorem 1.3).
Because of the stationarity of our quantum walk, we can expect to obtain a high relative probability at the marked vertex in a spatial quantum search without oscillation of the finding probability, e.g., [21] with respect to the time steps. Then the convergence speed to the stationary state is also one of the interesting future’s problem. We further discuss on this relation between quantum walks and the electric circuit in the forthcoming paper [12].
Acknowledgments We thank to the referees for their useful comments. YuH’s work was supported in part by Japan Society for the Promotion of Science Grant-in-Aid for Scientific Research (C) 25400208, (C)18K03401 and (A) 15H02055. E.S. acknowledges financial supports from the Grant-in-Aid for Scientific Research (C) Japan Society for the Promotion of Science (Grant No. 19K03616) and Research Origin for Dressed Photon. We are indebted to the “Izakaya” restaurant, PONTA, in Sendai, Japan, for their hospitality, where we obtained the fundamental idea of this work.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Albeverio, S., Gesztesy, F., Høegh-Krohn, R., Holden, H., Exner, P.: Solvable Models in Quantum Mechanics, AMS Chelsea publishing 2004.
- 2[2] Ambainis, A.: Quantum walks and their algorithmic applications, Int. J. Quantum Inf. 1 (2003) pp.507–518.
- 3[3] Farhi, J., Goldstone, S., Gutmann, S.: A Quantum Algorithm for the Hamiltonian NAND Tree, Theory of Computing 4 (2008) pp.169-190.
- 4[4] Farhi, E., Gutmann, S.: Quantum computation and decision trees, Phys. Rev. A 58 (1998) pp.915–928.
- 5[5] Feldman, E., Hillery, M.: Quantum walks on graphs and quantum scattering theory, In: Coding Theory and Quantum Computing, edited by D. Evans, J. Holt, C. Jones, K. Klintworth, B. Parshall, O. Pfister, and H. Ward, Contemp. Math. 381 (2005) pp.71–96.
- 6[6] Feldman, E., Hillery, M.: Modifying quantum walks: a scattering theory approach, J. Phys. A: Math. Theor. 40 (2007) 11343–11359.
- 7[7] Feynman, R. P., Hibbs, A. R.: Quantum Mechanics and Path Integrals, Dover Publications, Inc., Mineola, NY, emended edition (2010).
- 8[8] Gesztesy, F., Zinchenko, M.: Weyl-Titchmarsh theory for CMV operators associated with orthogonal polynomials on the unit circle, J. Approx. Theory 139 (2006), pp.172-213.
