Skip to main content

Advertisement

Log in

Hitting time expressions for quantum channels: beyond the irreducible case and applications to unitary walks

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

In this work we make use of generalized inverses associated with quantum channels acting on finite-dimensional Hilbert spaces, so that one may calculate the mean hitting time for a particle to reach a chosen goal subspace. The questions studied in this work are motivated by recent results on quantum dynamics on graphs, most particularly quantum Markov chains. We focus on describing how generalized inverses and hitting times can be obtained, with the main novelties of this work with respect to previous ones being that (a) we are able to weaken the notion of irreducibility, so that reducible examples can be considered as well, and (b) one may consider arbitrary arrival subspaces for general positive, trace-preserving maps. Natural examples of reducible maps are given by unitary quantum walks. We also take the opportunity to explain how a more specific inverse, namely the group inverse, appears in our context, in connection with matrix algebraic constructions which may be of independent interest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Data Availability

The datasets generated during the current study are available from the corresponding author on reasonable request.

References

  1. Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs. Accessed 23 April 2023: http://www.stat.berkeley.edu/~aldous/RWG/book.html

  2. Ambainis, A., Bach, E., Nayak, A., Vishwanath, A. A.: J. Watrous. One-dimensional quantum walks. In Proc. 33rd ACM Symp. Theory of Computing, p. 37-49 (2001)

  3. Attal, S., Petruccione, F., Sabot, C., Sinayskiy, I.: Open quantum random walks. J. Stat. Phys. 147, 832–852 (2012)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  4. Bhatia, R.: Positive Definite Matrices. Princeton University Press, Princeton (2007)

    MATH  Google Scholar 

  5. Brémaud, P.: Markov Chains: Gibbs Fields. Springer, Monte Carlo Simulation and Queues (1999)

  6. Campbell, S.L., Meyer, C.D., Jr.: Generalized Inverses of Linear Transformations. Pitman, London (1979)

    MATH  Google Scholar 

  7. Cantero, M.J., Moral, L., Velázquez, L.: Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle. Lin. Alg. Appl. 362, 29–56 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Evans, D.E., Høegh-Krohn, R.: Spectral properties of positive maps on \(C^*\)-algebras. J. London Math. Soc. 2(17), 345–355 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  9. Grünbaum, F.A., Lardizabal, C.F., Velázquez, L.: Quantum Markov Chains: Recurrence, Schur Functions and Splitting Rules. Ann. Henri Poincaré 21, 189–239 (2020)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  10. Grünbaum, F.A., Velázquez, L., Werner, A.H., Werner, R.F.: Recurrence for discrete time unitary evolutions. Comm. Math. Phys. 320, 543–569 (2013)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  11. Gudder, S.: Quantum Markov chains. J. Math. Phys. 49, 072105 (2008)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  12. Kemeny, J.G., Snell, J.L.: Finite Markov chains. Springer-Verlag, Heidelberg (1976)

    MATH  Google Scholar 

  13. Horn, R.A., Johnson, C.R.: Topics in matrix analysis. Cambridge University Press, Cambridge (1991)

    Book  MATH  Google Scholar 

  14. Hunter, J.J.: Generalized inverses and their application to applied probability problems. Lin. Alg. Appl. 45, 157–198 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kuklinski, P., Kon, M.A.: Absorption probabilities of quantum walks. Quant. Inf. Process. 17(10), 263 (2018)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  16. Lardizabal, C.F.: Open quantum random walks and mean hitting time formula. Quant. Inf. Comp. 17(1 &2), 79–105 (2017)

    MathSciNet  Google Scholar 

  17. Lardizabal, C.F.: Mean hitting times of quantum Markov chains in terms of generalized inverses. Quantum Inf. Process. 18, 257 (2019)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  18. Lardizabal, C.F., Velázquez, L.: Mean hitting time formula for positive maps. Lin. Alg. Appl. 650, 169–189 (2022)

    Article  MathSciNet  MATH  Google Scholar 

  19. Meyer, C.D.: The role of the group generalized inverse in the theory of finite Markov chains. SIAM Rev. 17(3), 443–464 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  20. Norris, J.R.: Markov chains. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  21. Pawela, Ł, Gawron, P., Miszczak, J.A., Sadowski, P.: Generalized open quantum walks on Apollonian networks. PLoS ONE 10(7), e0130967 (2015). https://doi.org/10.1371/journal.pone.0130967

    Article  Google Scholar 

  22. Pereira, L. F. L.: Mean hitting time statistics of quantum dynamics in terms of generalized inverses. PhD Thesis, Graduate Program in Mathematics, Federal University of Rio Grande do Sul (PPGMat/UFRGS), 2022. Accessed 23 April 2023:https://lume.ufrgs.br/bitstream/handle/10183/252377/001155148.pdf?isAllowed=y &sequence=1

  23. Portugal, R.: Quantum walks and search algorithms, 2nd edn. Springer, London (2018)

    Book  MATH  Google Scholar 

  24. Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of the Fourty-fifth Annual IEEE Symposium on the Foundations of Computer Science, pp. 32-41 (2004). https://doi.org/10.1109/FOCS.2004.53

  25. Venegas-Andraca, S.E.: Quantum walks: A comprehensive review. Quant. Inf. Process. 11(5), 1015–1106 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  26. Wolf, M. M. Quantum channels & operations: Guided Tour (unpublished)

Download references

Acknowledgements

The contents of this work have appeared or are a refinement of results from the PhD thesis of one of the authors (LFLP), see [22]. The authors are grateful to the referees for several suggestions regarding the manuscript. CFL would like to thank the organizers of the Graph Theory, Algebraic Combinatorics and Mathematical Physics Conference in Montréal, Canada, during which a lecture on group inverses and quantum walks was presented, and to L. Velázquez and R. Portugal, regarding discussions on quantum probabilities and hitting times in the unitary setting. LFLP acknowledges financial support from CAPES (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil) during the period 2018–2021. This publication is part of the I+D+i project PID2021-124472NB-I00 funded by MCIN/AEI/10.13039/501100011033/ and ERDF “Una manera de hacer Europa.”

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. F. Lardizabal.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

1.1 Proof of Lemma 4.8

The proof is inspired by [19], Thm. 2.2], which is valid for stochastic matrices. For the setting of positive maps, we proceed as follows: first, use Theorem 4.6 in order to write

$$\begin{aligned} \lceil {T}\rceil = X\begin{bmatrix} I &{} \\ &{} B \end{bmatrix}X^{-1}, \end{aligned}$$

where I is an identity matrix of some dimension and B is a matrix with no eigenvalue equal to 1. Then, write

$$\begin{aligned} \frac{I+B+B^2+\cdots +B^{n-1}}{n}=\frac{(I-B^n)(I-B)^{-1}}{n}. \end{aligned}$$

From this, and with the factorizations

$$\begin{aligned} A=X\begin{bmatrix} O &{} \\ {} &{} I-B\end{bmatrix}X^{-1},\;\;\;A^\#=X\begin{bmatrix} O &{} \\ {} &{} (I-B)^{-1}\end{bmatrix}X^{-1}, \end{aligned}$$

we obtain that

$$\begin{aligned} \frac{I+T+\cdots +T^{n-1}}{n}=\frac{(I-T^n)A^\#}{n}+I-AA^\#. \end{aligned}$$

By Russo-Dye’s theorem [4], the positivity and trace preservation of T implies that \(\Vert T^n\Vert =1\) for all n. Therefore,

$$\begin{aligned} \lim _{n\rightarrow \infty } \frac{(I-T^n)A^\#}{n}=0, \end{aligned}$$

and hence

$$\begin{aligned} \lim _{n\rightarrow \infty }\frac{I+T+\cdots +T^{n-1}}{n}=I-AA^\#. \end{aligned}$$

Now, note that \((I-T)(I-A^\#A)=A(I-A^\#A)=A-AA^\#A=A-A=0\), which implies that \((I-A^\#A)\rho \) is invariant for T for any choice of matrix \(\rho \). Finally, if \(\rho \) is a density matrix, so is \((I-A^\#A)\rho \). In fact, consider the sequence \(T_n=(I+T+\cdots +T^{n-1})/n\), \(n=1,2,\dots \), which approximates \((I-A^\#A)\) uniformly. We have that \(T_n\rho \) is a density matrix for all n and, as the set of density matrices in \(M_n\) is compact, the result follows.

1.2 Proof of Theorem 8.1

First, we recall a technical result described by Hunter [14]:

Theorem 11.1

[14] A necessary and sufficient condition for the equation \(FXB=C\) to have a solution is that \(FF^-CB^-B=C\), where \(F^-\) and \(B^-\) are any g-inverses for F and B, respectively. In this case, the general solution is given by one of the two equivalent forms: either

$$\begin{aligned} X=F^-CB^-+H-F^-DHBB^-, \end{aligned}$$

where H is an arbitrary matrix, or

$$\begin{aligned} X=F^-CB^-+(I-F^-F)U+V(I-B^-B), \end{aligned}$$

where U and V are arbitrary matrices.

Now we recall a basic lemma, regarding a conditioning on the first step reasoning. The probabilistic reasoning given in terms of the operator L has been discussed in [16] in the context of OQWs, but the same proof holds for the case of QMCs, also see [18] for the case of positive maps.

Lemma 11.2

(Adapted from [16], Lemma 2]). Let \(\Phi \) be a QMC, let K be its hitting time operator and \(D=\text {diag}(K_{11},\dots ,K_{nn})\), and define \(L:=K-(K-D)\Phi \). Then for \(\rho _j\) a density concentrated at site j, for all i, it holds that \({\text {Tr}}\big (L_{ij}(\rho _j)\big )={\text {Tr}}(\rho _j)=1\). As a consequence, \({\text {Tr}}\big (L_{ij}\rho )=Tr(\rho )\) for every \(\rho \in M_n\).

Together with the results stated above, the following proof is inspired by ideas seen in [17, 19].

Proof of Theorem 8.1. We start with the definition \(L:=K-(K-D)\Lambda \), where \(D=K_d\), and rearrange it to obtain

$$\begin{aligned} K(I-\Lambda )=L-D\Lambda . \end{aligned}$$
(11.1)

Operator L is well-defined due to Assumption I (also see the remark at the end of Sect. 8). Now define \(A:=I-\Lambda \) and we consider its group inverse \(A^\#\), which exists by Proposition 4.7. Now, in Theorem 11.1, take \(F=I\), \(X=K\), \(B=A\), and \(C=L-D\Lambda \), so we have that Eq. (11.1) has a solution K if, and only if, \(F^-FCB^-B=C\), which is equivalent to \((L-D\Lambda )A^\#A=L-D\Lambda \), that is,

$$\begin{aligned} (L-D\Lambda )(I-A^\#A)=0 \quad \Longleftrightarrow \quad KA(I-A^\#A)=0. \end{aligned}$$

But it is clear that this last equation is satisfied, due to the property \(AA^\#A=A\). So, we have that the solution to (11.1) can be written as

$$\begin{aligned} K=(L-D\Lambda )A^\#+V(I-AA^\#), \end{aligned}$$
(11.2)

where V is an arbitrary matrix.

By Lemma 4.8, the operator \(I-A^\#A\) projects onto the space of fixed points of \(\Lambda \). Moreover, we note that for each i, vector \((I-A^\#A)|e_i\rangle \) is the i-th column of \(I-A^\#A\), and that these are fixed points for \(\Lambda \), due to the property \(AA^\#A=A\). Also, by the fact that \(\Lambda \) is a QMC acting on two vertices, we may write

$$\begin{aligned} I-A^\#A=\begin{bmatrix} X &{} X\\ Y &{} Y \end{bmatrix}, \end{aligned}$$
(11.3)

for certain \(X, Y\in M_{k^2}\). The reason for this is simple: note that for any choice of \(\rho _1\), \(\rho _2\),

$$\begin{aligned} \begin{bmatrix} X &{} X\\ Y &{} Y \end{bmatrix}\begin{bmatrix} \rho _1 \\ \rho _2\end{bmatrix}=\begin{bmatrix} X(\rho _1+\rho _2) \\ Y(\rho _1+\rho _2)\end{bmatrix}, \end{aligned}$$
(11.4)

so that any choice of density will be projected onto the image of X and Y, with respect to vertices 1 and 2, respectively. It is then clear that the analogous behavior will apply to \(V(I-AA^\#)\), for any matrix V, that is, these will be matrices of form (11.3) accordingly. Due to these facts, if we define

$$\begin{aligned} E:=\begin{bmatrix} I_{k^2} &{} I_{k^2} \\ I_{k^2} &{} I_{k^2} \end{bmatrix}, \end{aligned}$$

we will have \((I-AA^\#)_d E = (I-AA^\#)\) and \(\big (V(I-AA^\#)\big )_d E = V(I-AA^\#)\).

Define \(B:=\big (V(I-AA^\#)\big )_d\) and substitute \(V(I-AA^\#)=BE\) in (11.2) in order to write

$$\begin{aligned} K=(L-D\Lambda )A^\#+BE. \end{aligned}$$
(11.5)

We take the diagonal and obtain

$$\begin{aligned} D=K_d =(LA^\#)_d -D(\Lambda A^\#)_d + B \quad \Longrightarrow \quad B=D+D(\Lambda A^\#)_d-(LA^\#)_d. \end{aligned}$$

Now we define \(W:=L-D(I-AA^\#)\) and use it to eliminate L in the equation for B above, so we get:

$$\begin{aligned} B&=D+D(\Lambda A^\#)_d - (WA^\#)_d- \big (D(I-AA^\#)A^\#\big )_d \nonumber \\&=D+D(\Lambda A^\#)_d - (WA^\#)_d, \end{aligned}$$
(11.6)

where one term was canceled since \((I-AA^\#)A^\#=(I-A^\#A)A^\#=A^\#-A^\#AA^\#=0\). Substituting B from (11.6) in (11.5), and eliminating L using W, we have

$$\begin{aligned} K&=\Big (W+D(I-AA^\#)-D\Lambda \Big )A^\#+DE+D(\Lambda A^\#)_dE -(WA^\#)_dE \nonumber \\&=D\Big [-\Lambda A^\#+E+(\Lambda A^\#)_dE\Big ] +WA^\#-(WA^\#)_dE, \end{aligned}$$
(11.7)

where again a term has vanished since \((I-AA^\#)A^\#=0\). Now consider \(H:=(I-AA^\#)_d\). We know \(HE=I-AA^\#\), so

$$\begin{aligned} I-AA^\#=I-A^\#+\Lambda A^\# = HE, \end{aligned}$$

and hence, taking the diagonal we obtain

$$\begin{aligned}&I-(A^\#)_d+(\Lambda A^\#)_d=H \nonumber \\ \Longrightarrow&E-(A^\#)_dE+(\Lambda A^\#)_dE= HE = I-A^\#+\Lambda A^\# \nonumber \\ \Longrightarrow&-\Lambda A^\#+E+(\Lambda A^\#)_dE = I-A^\#+A^\#_dE. \end{aligned}$$
(11.8)

By replacing (11.8) into (11.7), we obtain

$$\begin{aligned} K=D\Big [I-A^\#+A^\#_dE\Big ]+WA^\#-(WA^\#)_dE. \end{aligned}$$
(11.9)

It remains to show that \({\text {Tr}}\Big ((WA^\#)_{12}\rho \Big )\) and \({\text {Tr}}\Big (\big [(WA^\#)_dE\big ]_{12}\rho \Big )\) are zero for any \(\rho \). Note that by multiplying (11.1) on the right by any \(\Lambda \)-invariant vector \(|\rho \rangle \), we obtain \( L|\rho \rangle = D|\rho \rangle \), whence

$$\begin{aligned} {\text {Tr}}\big (K_{11}|\rho _1\rangle \big ) = {\text {Tr}}\big ((L|\rho \rangle )_1\big )=\sum _j {\text {Tr}}\big (L_{1j}|\rho _j\rangle \big ) = \sum _j {\text {Tr}}(\rho _j), \end{aligned}$$
(11.10)

where in the third equality we have used Lemma 11.2. Also recall that for any vector \(|\rho \rangle \), the new vector \((I-AA^\#)|\rho \rangle \) will be a state which is invariant by \(\Lambda \), with

$$\begin{aligned} \sum _j {\text {Tr}}\Big (\big ((I-AA^\#)|\rho \rangle \big )_j\Big )&= {\text {Tr}}\Big ((I-AA^\#)|\rho \rangle \Big ) \nonumber \\ {}&=\langle e_{I^2_{k^2}}|(I-AA^\#)|\rho \rangle =\langle e_{I^2_{k^2}}|\rho \rangle \nonumber \\&=\sum _j \langle e_{I_{k^2}}|\rho _j\rangle = \sum _j {\text {Tr}}(\rho _j). \end{aligned}$$
(11.11)

If \(|\rho \rangle \) is a vector concentrated at site m, i.e., if it is of the form

$$\begin{aligned} |\rho \rangle = \begin{bmatrix} \rho \\ 0 \end{bmatrix} \text { or } \begin{bmatrix} 0 \\ \rho \end{bmatrix}, \end{aligned}$$

then Eq. (11.11) reduces to

$$\begin{aligned} \sum _j {\text {Tr}}\Big (\big ((I-AA^\#)|\rho \rangle \big )_j\Big ) = {\text {Tr}}\big (\rho \big ). \end{aligned}$$
(11.12)

Now we proceed to show that the terms involving W in (11.9) will have trace zero. First, we have that

$$\begin{aligned} {\text {Tr}}\Big ((WA^\#)_{1r}\rho \Big )&= {\text {Tr}}\big ((LA^\#)_{1r}\rho \big )-{\text {Tr}}\Big (\big (D(I-AA^\#)A^\#\big )_{1r}\rho \Big ) \nonumber \\&=\sum _m \left[ {\text {Tr}}\Big (L_{1m}A^\#_{mr}\rho \Big )-{\text {Tr}}\Big (K_{11}(I-AA^\#)_{1m}A^\#_{mr}\rho \Big )\right] \nonumber \\&=\sum _m \left[ {\text {Tr}}\Big (A^\#_{mr}\rho \Big )-{\text {Tr}}\Big (K_{11}(I-AA^\#)_{1m}A^\#_{mr}\rho \Big )\right] , \end{aligned}$$
(11.13)

where again Lemma 11.2 was applied for L, and index r can be either 1 or 2. Note that

$$\begin{aligned} (I-AA^\#)_{1m}A^\#_{mr}\rho = \big [(I-AA^\#)|\rho \rangle \big ]_1, \end{aligned}$$

where \(|\rho \rangle \) is the vector with \(A^\#_{mr}\rho \) concentrated at site m. So, for this choice of \(|\rho \rangle \),

$$\begin{aligned} {\text {Tr}}\Big (K_{11}(I-AA^\#)_{1m}A^\#_{mr}\rho \Big )&={\text {Tr}}\Big (K_{11}\big [(I-AA^\#)|\rho \rangle \big ]_1\Big ) \nonumber \\&=\sum _j{\text {Tr}}\Big (\big [(I-AA^\#)|\rho \rangle \big ]_j\Big )\nonumber \\&={\text {Tr}}\Big (A^\#_{mr}\rho \Big ), \end{aligned}$$
(11.14)

where in the second equality we used Eq. (11.10), and in the last equality we used (11.12). Inserting (11.14) back into (11.13) we get

$$\begin{aligned} {\text {Tr}}\Big ((WA^\#)_{1r}\rho \Big ) = \sum _m \left[ {\text {Tr}}\Big (A^\#_{mr}\rho \Big )-{\text {Tr}}\Big (A^\#_{mr}\rho \Big )\right] =0. \end{aligned}$$

It is immediate from the above with \(r=2\) that \({\text {Tr}}\Big ((WA^\#)_{12}\rho \Big )=0\). But also for \(r=1\) it gives us

$$\begin{aligned} {\text {Tr}}\Big (\big ((WA^\#)_dE\big )_{12}\rho \Big )={\text {Tr}}\Big ((WA^\#)_{11}\rho \Big )=0. \end{aligned}$$

Therefore, when we calculate \({\text {Tr}}\big (K_{12}\rho \big )\) using (11.9), the terms involving W vanish and the result follows.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lardizabal, C.F., Pereira, L.F.L. Hitting time expressions for quantum channels: beyond the irreducible case and applications to unitary walks. Quantum Inf Process 22, 304 (2023). https://doi.org/10.1007/s11128-023-04062-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-023-04062-6

Keywords

Navigation