Absorption Probabilities of Quantum Walks
Parker Kuklinski, Mark Kon

TL;DR
This paper extends the analysis of absorption probabilities in quantum walks, demonstrating partial reflection and recurrence relations for various types of quantum walks, including general two-state and three-state Grover walks.
Contribution
It generalizes previous results on absorption probabilities to broader classes of quantum walks, including two-state and three-state Grover walks, and provides partial results for higher-dimensional cases.
Findings
Partial reflection of information in quantum walks
Linear fractional recurrence in lattice size for absorption probabilities
Linear recurrence in initial position for absorption probabilities
Abstract
Quantum walks are known to have nontrivial interaction with absorbing boundaries. In particular, Ambainis et.\ al.\ \cite{ambainis01} showed that in the quantum walk (one-dimensional Hadamard walk) an absorbing boundary partially reflects information. These authors also conjectured that the left absorption probabilities related to the finite absorbing Hadamard walks satisfy a linear fractional recurrence in (here is the probability that a Hadamard walk particle initialized in is eventually absorbed at and not at ). This result, as well as a third order linear recurrence in initial position of , was later proved by Bach and Borisov \cite{bach09} using techniques from complex analysis. In this paper we extend these results to general two state quantum…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
Absorption Probabilities of Quantum Walks
Parker Kuklinski
Mark Kon
Abstract
Quantum walks are known to have nontrivial interaction with absorbing boundaries. In particular, Ambainis et. al. [2] showed that in the quantum walk (one-dimensional Hadamard walk) an absorbing boundary partially reflects information. These authors also conjectured that the left absorption probabilities related to the finite absorbing Hadamard walks satisfy a linear fractional recurrence in (here is the probability that a Hadamard walk particle initialized in is eventually absorbed at and not at ). This result, as well as a third order linear recurrence in initial position of , was later proved by Bach and Borisov [3] using techniques from complex analysis. In this paper we extend these results to general two state quantum walks and three-state Grover walks, while providing a partial calculation for absorption in -dimensional Grover walks by a -dimensional wall. In the one-dimensional cases, we prove partial reflection of information, a linear fractional recurrence in lattice size, and a linear recurrence in initial position.
1 Introduction
The quantum walk is a unitary analogue of the classical random walk. Several introductory papers have been written on quantum walks which explore their mathematical properties and their use in algorithms for quantum computers [15] [24]. The quantum walk differs from the classical random walk in many ways including its linear spreading and initial condition-dependent asymmetries. In this paper, we direct our attention to the absorption problem; that is, we wish to calculate the probability that a quantum walk particle is eventually absorbed by a collection of absorption units present in the system. By an absorption unit, we mean an element of the group that the walk takes place on such that if the quantum particle is observed at the location of the unit, then the particle is absorbed and the walk is terminated. Otherwise, we continue to alternate the quantum walk operator with these measurements until the particle is absorbed.
Solutions to the absorption problem are well known in the symmetric classical random walk [22] [19]. The one dimensional symmetric random walk is recurrent, meaning that a random walk particle will eventually return to its starting location (and by extension any other location on the line) with probability 1. Thus, in the semi-infinite random walk where there is a single absorbing boundary at the origin, the random walk particle will be absorbed there with probability 1. This property also holds for the two dimensional random walk but not for random walks of dimension three and higher [12] [5]. Consider also the finite absorbing random walk in which there are absorbing boundaries at positions 0 and . If the particle starts at position 1, it has been shown that the probability that the particle will eventually be absorbed by the left boundary (at the origin) is equal to . Notice that as , this probability approaches 1, so in some way the finite absorption probability limits to the semi-infinite absorption probability. These results can be generalized to asymmetric random walks, and while these walks are not recurrent, we again find that the finite absorption probabilities limit to the semi-infinite absorption probabilities.
The absorption problem for the one dimensional quantum walk is much more nuanced than the classical absorption problem. Ambainis et. al. [2] first considered the absorption problem for both the semi-infinite Hadamard walk and the finite Hadamard walk. Following their notation, let be the probability that a Hadamard walk particle initialized in is eventually absorbed at , and let be the probability that the Hadamard walk particle initialized at is eventually absorbed at if there exists another absorbing boundary at . Ambainis et. al. proved, using properties of the Catalan numbers, that . They also proved that . These two calculations directly oppose the two key properties we highlighted about the absorption problem for the classical random walk; namely, the quantum walk is not recurrent, and the finite absorption probability does not limit to the semi-infinite absorption probability. Paradoxically, these authors showed that the presence of an absorbing boundary far away from the origin actually increases the probability of eventual absorption at the origin.
In this same paper, Ambainis et. al. conjectured a recursion governing the finite absorption probabilities, namely . Partial progress toward proving this result was made by Konno et. al. [16] and Bach et. al. [4] before finally being proved by Bach and Borisov [3]. This result was obtained by using the integral representation of the Hadamard product along with a few key observations from complex analysis. These authors also cited a recursion governing the absorption probabilities based on initial position. If is the probability that the Hadamard walk particle initialized at is eventually absorbed at given an additional absorbing boundary at , then the following formula holds:
[TABLE]
These results were extended to the three-state Grover walk in Wang et. al. [25] where it was discovered that those absorption probabilities satisfy . Other releated papers consider the hitting time of the quantum walk, or the average time it takes for the quantum walk particle to be absorbed [26][18][20].
In this paper, we extend the described results to a more general collection of quantum walks. We find that the absorption probabilities for all of these walks share three key properties; these properties are partial reflection of information at the boundary, a linear fractional recurrence in domain size, and a linear recurrence in initial position. The workflow for these calculations is consistent between examples. First, we define generating functions for which the coefficient of the Taylor expansion corresponds to the amplitude at the absorbing unit at time . These generating functions can be explicitly computed using path counting arguments. From here, the absorption probability may be obtained by evaluating a Hadamard product of these generating functions at 1. The Hadamard product has an integral representation which for semi-infinite walks may be directly integrated. For the finite walks, the corresponding integrand can be separated by means of a partial fractions expansion. The partial fractions contain specific collections of poles that facilitate applications of the residue theorem.
In Section 2, we discuss the definitions and methods necessary to carry out our computations. In Section 3, we compute absorption probabilities for the classical random walk as a simple case. The remaining sections are devoted to computing absorption probabilities for specific variants of the quantum walk. These include the general two-state one-dimensional quantum walk in Section 4, the three-state one-dimensional Grover walk in Section 5, and the -dimensional Grover walk in Section 6.
2 Definitions and Methods
The quantum walk has a natural construction on groups.
Definition 2.1
Let be a group, let where , and let where is the set of unitary matrices. The quantum walk operator corresponding to the triple may be written as where for and , . We denote this correspondence as .
We refer to states as internal states and as position states. The pair can be thought of as an undirected Cayley graph which admits loops [8]. Here, the group action is defined notionally as addition for consistency. In this paper the groups will take the form and the directional subsets will either be or .
We pause to make a remark about our use of braket notation. If is an element in the underlying space, then is an orthonormal basis for . We use the braket in general to refer to an element of , but it will sometimes suit us to surpress the braket as will be the case in our path counting arguments which are firmly grounded in the underlying classical space. For example, if is an element of the orthonormal basis, in the path counting arguments it will be easier to discuss . We will address this distinction when necessary.
We must also define an absorption unit for quantum walks. To this end, we formally define the measurement operator. Let . The measurement operator is a projection onto while is a projection onto the the subspace spanned by elements in . The probabilistic interpretation of quantum mechanics dictates that if we measure a state at , the resulting state becomes with probability and with probability . If , let be the composition of no measurement projections for all . In this way, we can define the quantum walk operator for an absorbing quantum walk.
Definition 2.2
Let be a quantum walk operator and let . Then we say that is the absorbing quantum walk operator corresponding to the ordered quadruple and we denote this correspondence as .
We use the no operator in our definition because if we observe the particle somewhere in , then the experiment is terminated, while if the particle is not observed in (i.e. we are in the range of ) the experiment continues. Note that we speak of the absorption units as being elements of the classical space and not as members of the corresponding orthonormal basis.
For an absorption problem, we wish to compute the probability that the quantum walk particle is eventually absorbed by some subset of the absorbing units of an absorbing quantum walk with operator before it is absorbed anywhere else in (i.e. before it is absorbed in ). Let be the initial state. Then we can express this probability as an infinite sum:
[TABLE]
This paper is devoted to computing such sums for a selection of quantum walks.
Path Counting and Generating Functions
The quantum walk is a quantum Markov chain [11] and thus has a pathwise representation. We must first define a path and its associated amplitude and displacement.
Definition 2.3
Consider the quantum walk operator where is the transition amplitude from internal state to . An -path is represented as and its associated displacement is defined as . Its associated amplitude is defined as .
To be consistent with Definition 2.1, we define the summation inductively by . Let be the entry of a -path where . In view of the quantum walk as a quantum Markov chain, the following pathwise representation holds [11]
Proposition 2.1
Consider the quantum walk operator and let us define a set of paths where and :
[TABLE]
Then:
[TABLE]
The proof of this proposition follows from the linearity of and an induction argument. This proposition is closely related to the path integral formulation of quantum mechanics proposed by Feynman [10].
With a little care, a pathwise representation of amplitudes for absorbing quantum walks can also be written. To this end let be the restriction of an -path to a -path for .
Proposition 2.2
Consider the absorbing quantum walk operator . If we let be the set from the previous proposition, then we define a new set of paths:
[TABLE]
Then the following holds:
[TABLE]
The proof of this proposition follows from proposition 2.1 and our definition of the measurement operator.
In view of the absorbing probability equation (1) from above, we consider for a complex variable generating functions for an absorbing quantum walk defined as:
[TABLE]
We use the propositions above to write a pathwise representation of these generating functions:
Definition 2.4
Let be a generating function for an absorbing quantum walk where and . We define the set of associated -paths of this generating function as:
[TABLE]
Notice that in this definition we have as an element of the underlying classical space while we write to refer to the corresponding state. By using a substitution from Proposition 2.2, the generating functions may be rewritten as:
[TABLE]
Now that we have a pathwise representation of the generating functions, we will be able to write self-referential relations by dividing up associated paths in certain ways. We consider one such relation:
Proposition 2.3
Let be an absorbing quantum walk operator and let be a generating function. If , let . Then:
[TABLE]
We call equation (9) in this proposition a first step transformation. The proof of the proposition is simple and easily seen from separating the first term from the generating function in the Taylor expansion. The generating functions in the summation on the right will typically be related to the generating function on the left in some way after conducting a second transformation. This second transformation we consider is more involved:
Definition 2.5
Let be an absorbing quantum walk operator and let . If there exists a set such that, for every and , there exists a such that for and , then we say the generating function is segmented by .
As an illustrative simplified example, consider the set of paths on the integer lattice which begin at position and end at position 0 at time . There must exist a time such that the path must intersect for the first time. By a simplified version of the previous definition, we say that the generating function associated with is segmented by . The generating functions for one dimensional quantum walks are typically segmented by a single element, but in higher dimensions the segmenting sets are larger. We now prove the segmenting transformation in the following proposition:
Proposition 2.4
Let be an absorbing quantum walk operator and let be a generating function segmented by . Then we have:
[TABLE]
Proof: Since is segmented by , for every there exists a and an element such that , and if restricts an -path to the -path , then . This implies:
[TABLE]
The result follows from recognizing the formula of the product of two Taylor series.
Using these two transformations in tandem allows us to write a fully self-referential relation among generating functions, upon which we can derive closed forms. For the semi-infinite walks, these closed forms may be computed explicitly. In the finite quantum walks, the generating functions satisfy recursions in the size of the lattice. These recursions typically take the form:
[TABLE]
where . We compute a closed form expression of in the following lemma:
Lemma 2.1
Let be a sequence of functions satisfying (11) and let . If we let and , then:
[TABLE]
The proof of this lemma follows from framing this recursion as a matrix multiplication. The coefficients will typically be polynomials in . We will also find the following recurrence governing useful:
[TABLE]
Hadamard Product
In order to compute absorption probabilities from the generating functions, we must use a construction from complex analysis called the Hadamard product [23].
Definition 2.6
Let and . Then the Hadamard product of and evaluated at is defined as follows:
[TABLE]
This Hadamard product has an integral representation which we will use extensively:
Proposition 2.5
If is a contour in the plane on which and are analytic, then we may write the following:
[TABLE]
Proof: See [23].
Using this Hadamard product, one can express the absorption probabilty in terms of the generating functions. Interchanging the order of summation in equation (1) defining , we may write:
[TABLE]
In general, the Hadamard product is difficult to compute, but our generating functions are in a form that makes computation possible. In particular, the integrand in equation (15) of Proposition 2.5 can be divided via a partial fractions expansion. One of these fractions has all but a small number of poles contained outside the contour of integration, leading to an easy evaluation via residue theorem [1]. The other fraction has all of its poles contained inside the contour. The special form of this fraction allows us to use the following lemma:
Lemma 2.2
Let be a rational function whose poles lie in a contour . Further, if we write , let . Then we have:
[TABLE]
Proof: See [1].
3 One Dimensional Classical Random Walk
Before addressing absorption probabilities in the quantum walk, we compute absorption probabilities for the one dimensional classical random walk to illustrate what we mean by “classical behavior”. While we opt to use language from probability theory in this section, the path counting arguments from the previous section will carry over. We need not compute any Hadamard products since the random walk is a Markov chain and not a quantum Markov chain.
We must first formally define the classical random walk:
Definition 3.1
A classical random walk is a sequence of random variables which satisfy and .
Notice that the quantum -paths we previously defined are transition-based because the amplitude associated with a particular translation direction depends on the current state. However, in the classical random walk, probability of left/right movement is independent of previous movements. To carry over our path counting methods in this context, we must reassess the previous definition of a path:
Definition 3.2
An -path is an element written as . We say that the associated displacement of is while the associated probability of is .
Semi-Infinite Case
Let us consider a classical random walk for which and let there be an absorbing boundary at position 0. We want to calculate the absorption probability that the particle is eventually absorbed at position 0. The absorption probability may be written as:
[TABLE]
This probability has a convenient pathwise representation. If we let , then we can write the following:
[TABLE]
From this equation we construct a collection of generating functions:
[TABLE]
It is clear that . It remains to compute a closed form for . Since is segmented by , we can use a segmenting transformation and induction to find:
[TABLE]
We have reduced this absorption problem to understanding the function . By a first step transformation and substituting the previous relation, we find:
[TABLE]
The function satisfies a quadratic equation, but there is a bit of subtlety in selecting the proper solution. To keep well defined, we choose the solution:
[TABLE]
Using this closed form we are immediately granted a solution to the absorption problem:
Theorem 3.1
The absorption probabilities satisfy:
[TABLE]
Finite Case
The finite case is solved in a similar way as the semi-infinite case. Let us consider a random walk for which and there are two absorbing boundaries, one at position 0 and another at position . We wish to find the absorption probability that the particle is eventually absorbed at position 0 and not at . We write this as:
[TABLE]
This probability also has a pathwise representation. Considering the path collection from the previous section, define . Then we can write the following:
[TABLE]
We construct the obvious class of generating functions from these absorption probabilities:
[TABLE]
Here, it is clear that , so it remains to gather closed forms of these generating functions. The segmenting transformation is slightly different from last time; the generating function is segmented by , however via induction we have:
[TABLE]
It thus remains to find closed forms of the generating functions for which . By using a first step transformation and a subsequent substitution of the segmenting relation, we have:
[TABLE]
Thus we arrive at a linear fractional recurrence in governing these functions:
[TABLE]
Here, . Using results from Lemma 2.1, we arrive at a closed form for :
[TABLE]
Here, and . Recognize that and . If , then , but if , we find . Since , a telescoping relation gives us the following:
Theorem 3.2
The absorption probabilities satisfy the following:
[TABLE]
Discussion
Before continuing to computations involving the quantum walk, we make note of a few key characteristics these absorption probabilities share. First, notice that if . If we keep the absorbing boundary at the origin and let be negative, a simple rearrangement of the previous results shows that for . Combining these results, we note that the symmetric random walk for is recurrent; that is, the symmetric random walk will eventually visit any point on with probability 1. As mentioned in the introduction, this holds for the classical random walk on but not on for .
Second, these absorption probabilities interchange with the limit nicely:
Theorem 3.3
For absorption probabilities of the random walk, the following relation holds:
[TABLE]
While this may seem like an obvious property, it will not be satisfied for the quantum walks we discuss later. We have another result if we take the limit in a different way:
Theorem 3.4
If , then:
[TABLE]
We think of as the normalized distance between the left and right absorbing boundaries. We include this theorem because these absorption probabilities are stable in the limit taken on a ray . In particular, there is a dichotomy between the cases guaranteed absorption to the left () and guaranteed absorption to the right () where the choice of ray has no impact on the probability, and the symmetric case in which the choice of ray actually does affect the absorption probability.
Lastly, we write a few recurrence relations among the absorption probabilities. The proof of these relationships is straightforward:
Theorem 3.5
Let be an absorption probability of the random walk. Then the following formulas hold:
[TABLE]
[TABLE]
[TABLE]
Proof: The first two formulas hold by letting in two of the generating function relations above. The third may be derived by noting that and multiplying this relation by .
4 Quantum Walk
We now compute absorption probabilities for the quantum walk where and is an arbitrary unitary matrix. It suffices to consider matrices of the form , as phase constants will not affect the absorption probabilities. As mentioned previously, the case of where is the Hadamard matrix has been studied in a few papers [2] [4] [3].
Semi-Infinite Case
We first consider the absorption probabilities corresponding to an initial condition and the quantum walk operator . If we place an absorbing boundary at , we need only consider absorption at as there will never be amplitude at in this setting. We can write out the absorption probabilities corresponding to arbitrary initial condition as follows:
[TABLE]
Recognize the first two quantities in this sum as . If we define
[TABLE]
then we may rewrite the general absorption probability as:
[TABLE]
While the calculation of generating functions is manageable for general , computation of the Hadamard product for these cases is unwieldy. We thus illustrate the calculation of . This is readily extended to the general absorption probability by equation (39) below.
Generating Functions
We first define the following two generating functions:
[TABLE]
We use this subsection to prove the following proposition:
Proposition 4.1
The generating functions and have the following closed forms:
[TABLE]
[TABLE]
Proof: Both of these generating functions are segmented by . Using a segmenting transformation and induction, the following relationships hold:
[TABLE]
It now remains to handle the generating functions. Using a first step transformation and substituting this segmenting relation, we arrive at the system:
[TABLE]
This system can be solved simply and results in the following solutions:
[TABLE]
[TABLE]
We choose the negative square root so that these generating functions have a convergent Taylor series about . The result follows upon substitution.
Hadamard Product
The absorption probabilities may be written in terms of the generating functions as follows:
[TABLE]
[TABLE]
Presently, we are only able to state the semi-infinite absorption probabilities for the case. For the case, Ambainis et. al. used a combinatorial appeal to the Catalan numbers to prove that . However, this approach does not generalize well to the arbitrary unitary matrix case and we opt to use the integral expression of the Hadamard product in our proof.
Theorem 4.1
The following formula holds:
[TABLE]
Here, . If we write where , then we also have:
[TABLE]
Proof: From Ambainis et. al. we are able to alter the integral representation of the Hadamard product slightly:
[TABLE]
For simplicity, let . By expanding , we have:
[TABLE]
Through straightforward integration, it is easy to prove that . Notice that . Letting satisfy , we can solve for :
[TABLE]
Here, we use the identity . For the final integral , notice that traces a rose curve [7] variant in the complex plane which only intersects the branch cut at the branch point, thus making this integral well defined. Let us choose a different branch of the square root to operate on real numbers (denoted by ) such that square root of a positive real number to have positive real part and the square root of a negative real number has positive imaginary part. We can rewrite (in the former sense) on the interval as:
[TABLE]
Notice that the integrand of is purely imaginary when and purely real otherwise. Thus, we can use the indefinite integral
[TABLE]
to find that . The result follows.
Finite Case
Let be an absorbing quantum walk operator corresponding to the quantum walk on the finite one dimensional lattice. We are intereseted in the absorption probabilities or the probability that a quantum walk particle initialized in is eventually absorbed at before being absorbed at . We can divide the general absorption probability as we had in the previous section:
[TABLE]
Again, we will be focusing our attention on computing , as the other two quantities are calculated similarly.
Generating Functions
Let us define the generating functions:
[TABLE]
This section is devoted to computing the following closed form of these generating functions:
Proposition 4.2
We have:
[TABLE]
Proof: Both of these generating functions are segmented by . Using a combination of the segmenting transformation and induction, we may write the generating functions using generating functions:
[TABLE]
Using a first step transformation along with this formula, we arrive at the following system:
[TABLE]
These two formulas can be combined to construct a recursion for :
[TABLE]
By using lemma 2.1, we can solve for the following closed form:
[TABLE]
Here, and . Meanwhile, by recognizing and using the recursion relation , we can calculate:
[TABLE]
Applying induction and the segmenting relation derives the result.
Hadamard Product
We will detail the computation of . We wish to use the integral representation of this Hadamard product as given by proposition 2.5, so we must provide a region for which the generating functions are analytic. This requires a lemma:
Lemma 4.1
Let where . Then .
Proof: Let us rewrite as:
[TABLE]
First consider the function where is fixed. If , then it follows that is an automorphism of the unit disk. Next consider the function where is fixed. For , is analytic in the unit disk since there is a single pole located at . The result now follows from the maximum modulus principle.
This lemma allows us to prove the following proposition:
Proposition 4.3
For every , there exists an such that and are analytic in the disk .
Proof: Via induction, the previous lemma shows that for all , and a continuity argument tells us that for every there exists an such that is analytic in the disk . Since , this conclusion must also hold for . Since and are products of these generating functions, the result follows.
Before moving onto the computation of the Hadamard product, we prove two lemmas which will aid in this endeavor:
Lemma 4.2
The following formulas hold:
[TABLE]
Proof: The result follows from noting that and .
Lemma 4.3
The following formula holds:
[TABLE]
[TABLE]
Proof: Let us assume the following relation holds:
[TABLE]
We can write where the coefficients are related to each other by the matrix equation:
[TABLE]
Using an eigenvalue expansion, we find that:
[TABLE]
[TABLE]
[TABLE]
By solving this system and using the equation , the result follows.
We are now ready to prove the main theorem of this section:
Theorem 4.2
Let and . The following formulas hold:
[TABLE]
[TABLE]
Proof: We may write the absorption probability as . By combining proposition 2.5 and proposition 4.3, we find that there exists an such that:
[TABLE]
Substituting the above lemmas into this equation, we may write:
[TABLE]
Using the partial fractions expansion from lemma 4.3, we have:
[TABLE]
By Lemma 2.2, the partial fraction on the right may be eliminated leading to the simplified expression:
[TABLE]
The result follows from an application of the residue theorem as well as recognizing that . Calculation of and is similar.
Discussion
We note several differences between this quantum walk and the classical random walk. First, note that unless (i.e. all probability is absorbed in the first step). This stands in contrast to the classical random walk which was recurrent in the symmetric case.
Second, the finite absorption probabilities do not limit to the semi-infinite absorption probabilities and this limit fails in a surprising way.
Theorem 4.3
The following inequality is satisfied:
[TABLE]
Proof: First note that a walk initialized in will be absorbed at time with probability and will have a subsequent state of , thus:
[TABLE]
By substituting and , we find that and are both linear combinations of . This allows us to solve for a linear relation between the two absorption probabilities:
[TABLE]
Thus, it suffices to prove this inequality for . Note that this argument still holds for as no reference was made to the absorbing boundary. By using a trigonometric representation of the governing unitary matrix, proving the theorem becomes equivalent to proving
[TABLE]
where . The only values of in this interval such that are where . It can be shown that and the result follows from noting that .
This is perhaps the most surprising result from the initial foray into absorption probabilities by Ambainis et. al. and here we have extended it to arbitrary internal state and arbitrary governing matrix. Not only do the finite probabilities fail to limit to the semi-infinite case, but the presence of an absorbing boundary sufficiently far to the right from the initial position will actually increase the probability of eventually being absorbed to the left. This apparent paradox can be reconciled by considering the quantum walk to be a kind of discretization of the transport equation and that these absorbing boundaries do not necessarily absorb all information but reflect some as well. Figure 3 illustrates this concept. We present a conjecture to extend this theorem:
Conjecture 4.1
Theorem 4.3 is satisfied for arbitrary initial position .
We specify these limits in the finite case as we have in the classical random walk:
Theorem 4.4
Let . The following limiting probabilities hold:
[TABLE]
[TABLE]
Another result which we dsiplay proves that a quantum walk particle in the finite absorption setting is guaranteed to eventually be absorbed by one of the boundaries:
Theorem 4.5
Let be the probability that a absorbing quantum walk particle initialized at is eventually absorbed at before being absorbed at , where . Then the following formula holds:
[TABLE]
Proof: Consider the following quantities:
[TABLE]
By using the index reducing formulas (i.e. and ) on the quantities in equation (37), we have the following representations:
[TABLE]
Notice that and , while . Also, since , , , and are dependent on and , they are invariant to multiplication by phase and complex conjugation of either and . These observations allow us to plug equation (28) into equation (42) and collect terms:
[TABLE]
By using the identities and , we further reduce this to:
[TABLE]
A reverse application of the index reducing formulas completes the proof.
It is clear in the context of the theorem that is the probabilty of left absorption, and that is the probability of right absorption.
We conclude this section by proving two recurrences of these absorption probabilities:
Theorem 4.6
The following recurrences hold for finite absorption probabilities:
[TABLE]
[TABLE]
Proof: The first equation can easily be proven true by recognizing that . For the second equation, notice that is a linear combination of terms of the form . If we let
[TABLE]
then the following equation holds:
[TABLE]
The characteristic polynomial of this matrix is:
[TABLE]
The conclusion follows from noting that the minimal polynomial retains only one of the factors of .
5 Quantum Walk
We repeat the analysis in the previous section for the quantum walk where and is the Grover matrix. This is also known as the three-state Grover walk and its unbounded behavior has been studied in several papers [14][9]. The three-state Grover walk exhibits a property known as localization in which the time averaged probability of observing the particle at its initial condition limits to a nonzero value. This is caused by the degeneration of eigenvalues in the Grover matrix, and it has been shown that localization exists for other quantum walks governed by Grover matrices [13].
These absorption probabilities have partially been computed in Wang et. al. [25] but we repeat the analysis here in a more concise framework. We refer back to the previous section for several of the proofs.
Semi-Infinite Case
In this section we consider the absorption probabilities or the probability that a particle initialized in is eventually absorbed in the absorbing quantum walk. Here, recognize that for the translation operator associated with . As with the semi-infinite two state quantum walk, we are able to compute generating functions for general but restrict the Hadamard product to .
While the generalized absorption probability of the previous section depended only on the three quantities , , and , these new absorption probabilities depend on six such quantities. For illustrative purposes, we will only consider as the others are computed via similar methods. We display the summation form of this probability:
[TABLE]
We thus construct the following generating function:
[TABLE]
We define and similarly. The following proposition gives us a closed form for :
Proposition 5.1
The generating function has the closed form:
[TABLE]
Proof: Note that the aforementioned generating functions are all segmented by . By using the segmenting transformation in conjunction with induction, this leads to the conclusion:
[TABLE]
It remains to handle the generating functions. By combining a first step transformation and the previous equation, we have the system:
[TABLE]
[TABLE]
[TABLE]
Solving this system and choosing the root with a convergent Taylor series leads to the formula in the proposition.
Recognizing that , it remains to compute the Hadamard product. For the case, we resort to direct integration as in Theorem 4.1.
Theorem 5.1
The following holds:
[TABLE]
Finite Case
We now compute the absorption probability for the finite absorbing quantum walk . We omit proofs to encourage readability; refer to the previous section and Wang et. al. [25] for details. As before, the right absorption probability may be written as:
[TABLE]
We thus construct generating functions which have the form:
[TABLE]
The generating functions and are defined similarly. We compute closed form representations of these functions:
Proposition 5.2
The following holds:
[TABLE]
[TABLE]
*Here, and
.*
We now wish to compute Hadamard products of these generating functions. To do this, we will require a few lemmas.
Lemma 5.1
Let . Then .
Lemma 5.2
The following formulas hold:
[TABLE]
[TABLE]
Lemma 5.3
The following formula holds:
[TABLE]
[TABLE]
We are now ready to compute the absorption probabilities via the Hadamard product.
Theorem 5.2
Let , , , and . Then the right absorption probability satisfies the following:
[TABLE]
Discussion
In this three state quantum walk we observe much of the same behavior as we did in the two state quantum walk. For instance, the semi-infinite walk is not recurrent; that is, . Also, as with the two state quantum walk, the finite absorption probability does not limit to the semi-infinite absorption probability:
[TABLE]
It was proven in Wang et. al. [25] that the finite absorption probabilities for satisfy the following recursion:
Theorem 5.3
The following formula holds:
[TABLE]
However, a third order linear recursion in position will not hold for the absorption probabilities of these walks as the terms and separately satisfy third order recursions in . We reconcile this observation in the following theorem:
Theorem 5.4
Let . Then the following recursion holds:
[TABLE]
Absorption probability limits similar to Theorem 4.4 can be written, but are unwieldy. Additionally, it is clear from inspection that as was the case for the two-state walks.
A numerical analysis of these absorption probabilities illustrates the effects of localization on this system. From figure 4, it appears that we have where equality only holds when . This seems to support the idea that placing an absorbing boundary directly adjacent to an appropriately initialized particle will break down localization.
Analytic expressions for the one-dimensional absorption probabilities of sections 4 and 5 are displayed in the charts of figure 5. If we let referring to the absorption probability of the previous section, and let be the current Grover absorption probability, then we find . We can clearly see this by iterating the recursion in equation (43) and comparing to equation (55) (i.e. ). Note also from figure 5 that for , the Grover absorption probabilities gain significant arithmetic complexity over the counterparts. This can be explained by equation (53) where the left term vanishes if (i.e. ). Comparing this to the observation made of figure 4, we conclude that the term in equation (53) is the ”localization” component of the right absorption probabilities ; that is, when there is no localization in the system and the term vanishes, and conversely when localization is present and the term takes value.
6 Quantum Walk
We now consider absorption probabilities for the absorbing walk where is the set of unit vectors in , where is a projection onto the coordinate, and is the Grover matrix. We refer to as an absorbing wall. We wish to calculate , or the probability that the quantum walk particle initialized in is eventually absorbed by . Here, represents the internal state which translates perpendicular away from the absorbing boundary. We write the absorption probability as follows:
[TABLE]
In this section, we will only illustrate computation of semi-infinite probabilities as the finite probabilities may be computed with similar methods as described previously.
In view of the summation form of the absorption probability, we construct the following generating functions:
[TABLE]
Here, . Solving closed form expressions for these generating functions is not as straightforward as it was in the one-dimensional walks, so instead of proving the closed form in a single result, we opt to elucidate the process through a series of lemmas and propositions.
Lemma 6.1
The following relation holds:
[TABLE]
Proof: The result follows from noting that is segmented by and conducting a segmenting transformation.
Lemma 6.2
The following system is satisfied:
[TABLE]
Proof: The result follows from a first step transformation and noting that if , the first step cannot be left.
The system of generating functions described by lemma 6.2 is infinite for . As such we need some sort of construction to reduce this infinite system to a finite one. Let us introduce the functions defined as follows:
[TABLE]
Since for , we can informally think of as opposed to . These new functions allow us to rewrite the previous lemmas to result in a finite system. We first reformulate the segmenting relation from lemma 6.1.
[TABLE]
We may now write the following system of functions:
[TABLE]
Upon solving this system, we can take an inverse Fourier transform of these new generating functions to get back to the generating functions:
[TABLE]
Once we get back the generating functions, we may compute the absorption probability by summing over the usual Hadamard products:
[TABLE]
Often, the inverse Fourier transform and the summation are challenging to analytically compute.
Alternatively, if we let and , then is a power series in and a multivariate Laurent series in . To extract the absorption probability from this generating function, we need an extension of the Hadamard product which handles Laurent series of several complex variables [17]. If we let and follow the proof of proposition 2.5, the integral representation of this absorption probability would ostensibly take the form
[TABLE]
for some surface . However, the development of the Hadamard product is insufficiently merged with the theory of complex analysis with several variables to properly determine what this region of integration should be. Regardless, we can still write closed form expressions for these generating functions for . In particular, we find:
[TABLE]
Based on numerical results, this semi-infinite absorption probability is approximately .
We can also write a generating function recursion relating to the double absorbing wall quantum walk. In this case, we wish to find the probability that the particle is absorbed by before it is absorbed at . Let us write this absorption probability as:
[TABLE]
If we write the generating functions
[TABLE]
then we can use the methods relating to the single absorbing wall problem to compute this absorption probability. For , these generating functions satisfy the recursion:
[TABLE]
Lemma 2.1 may be used to derive a closed form for these generating functions. Though the analytic results are currently out of reach, based on the numerical data we present a conjecture.
Conjecture 6.1
For , we have .
Unfortunately, the numerical data does not support a linear fractional recursion in governing the absorption probabilities, as was the case for the one dimensional quantum walks. However, from the numerical data it seems clear that .
7 Conclusion
In this paper we have developed absorption probabilities for two and three state one dimensional quantum walks, and made partial progress toward computing absorption probabilities of higher dimensional quantum walks with absorbing walls. In these examples we have found that the presence of an absorbing boundary far from the initial position of the walker paradoxically increases the probability that the particle is absorbed at a near boundary. We resolve this phenomenon by considering that the quantum walk exhibits wavelike behavior and that information is reflected by an absorbing boundary. For the one dimensional walks, we have found two recursions which govern these absorption probabilities in both initial condition and boundary placement.
It is the hope of the authors that these techniques may be extended to more general absorption settings. In particular, it would be interesting to compute absorption probabilities for a quantum walk in a -dimensional absorbing box, or for a -dimensional quantum walk with a single absorption unit at the origin. These results would require more sophisticated path counting arguments than the ones described above, but the procedure for computing the Hadamard product for the resulting generating functions would likely remain the same. It would also be interesting to extend these arguments to absorption probabilities for electric quantum walks [21][6].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Lars V. Ahlfors. Complex analysis: an introduction to the theory of analytic functions of one complex variable . New York, London, 1953.
- 2[2] Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous. One-dimensional quantum walks. In Proceedings of the thirty-third annual ACM symposium on Theory of computing , pages 37–49, 2001.
- 3[3] Eric Bach and Lev Borisov. Absorption probabilities for the two-barrier quantum walk. ar Xiv preprint ar Xiv:0901.4349, 2009.
- 4[4] Eric Bach, Susan Coppersmith, Marcel Paz Goldschen, Robert Joynt, and John Watrous. One-dimensional quantum walks with absorbing boundaries. Journal of Computer and System Sciences , 69(4), 2004.
- 5[5] Patrick Billingsley. Probability and Measure . John Wiley and Sons, 2008.
- 6[6] C. Cedzich, T. Rybar, A. H. Werner, A. Alberti, M. Genske, and R. F. Werner. Propagation of quantum walks in electric fields. Physical review letters , 111(16), 2013.
- 7[7] Henry M. Cundy and Arthur M. Rollett. Mathematical models . Oxford: Clarendon Press, 1961.
- 8[8] Reinhard Diestel. Graph Theory . Springer-Verlag, 2005. Graduate Texts in Mathematics, No. 101.
