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.
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
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
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)
Attal, S., Petruccione, F., Sabot, C., Sinayskiy, I.: Open quantum random walks. J. Stat. Phys. 147, 832–852 (2012)
Bhatia, R.: Positive Definite Matrices. Princeton University Press, Princeton (2007)
Brémaud, P.: Markov Chains: Gibbs Fields. Springer, Monte Carlo Simulation and Queues (1999)
Campbell, S.L., Meyer, C.D., Jr.: Generalized Inverses of Linear Transformations. Pitman, London (1979)
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)
Evans, D.E., Høegh-Krohn, R.: Spectral properties of positive maps on \(C^*\)-algebras. J. London Math. Soc. 2(17), 345–355 (1978)
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)
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)
Gudder, S.: Quantum Markov chains. J. Math. Phys. 49, 072105 (2008)
Kemeny, J.G., Snell, J.L.: Finite Markov chains. Springer-Verlag, Heidelberg (1976)
Horn, R.A., Johnson, C.R.: Topics in matrix analysis. Cambridge University Press, Cambridge (1991)
Hunter, J.J.: Generalized inverses and their application to applied probability problems. Lin. Alg. Appl. 45, 157–198 (1982)
Kuklinski, P., Kon, M.A.: Absorption probabilities of quantum walks. Quant. Inf. Process. 17(10), 263 (2018)
Lardizabal, C.F.: Open quantum random walks and mean hitting time formula. Quant. Inf. Comp. 17(1 &2), 79–105 (2017)
Lardizabal, C.F.: Mean hitting times of quantum Markov chains in terms of generalized inverses. Quantum Inf. Process. 18, 257 (2019)
Lardizabal, C.F., Velázquez, L.: Mean hitting time formula for positive maps. Lin. Alg. Appl. 650, 169–189 (2022)
Meyer, C.D.: The role of the group generalized inverse in the theory of finite Markov chains. SIAM Rev. 17(3), 443–464 (1975)
Norris, J.R.: Markov chains. Cambridge University Press, Cambridge (1997)
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
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
Portugal, R.: Quantum walks and search algorithms, 2nd edn. Springer, London (2018)
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
Venegas-Andraca, S.E.: Quantum walks: A comprehensive review. Quant. Inf. Process. 11(5), 1015–1106 (2012)
Wolf, M. M. Quantum channels & operations: Guided Tour (unpublished)
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
Corresponding author
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
where I is an identity matrix of some dimension and B is a matrix with no eigenvalue equal to 1. Then, write
From this, and with the factorizations
we obtain that
By Russo-Dye’s theorem [4], the positivity and trace preservation of T implies that \(\Vert T^n\Vert =1\) for all n. Therefore,
and hence
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
where H is an arbitrary matrix, or
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
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,
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
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
for certain \(X, Y\in M_{k^2}\). The reason for this is simple: note that for any choice of \(\rho _1\), \(\rho _2\),
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
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
We take the diagonal and obtain
Now we define \(W:=L-D(I-AA^\#)\) and use it to eliminate L in the equation for B above, so we get:
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
where again a term has vanished since \((I-AA^\#)A^\#=0\). Now consider \(H:=(I-AA^\#)_d\). We know \(HE=I-AA^\#\), so
and hence, taking the diagonal we obtain
By replacing (11.8) into (11.7), we obtain
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
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
If \(|\rho \rangle \) is a vector concentrated at site m, i.e., if it is of the form
then Eq. (11.11) reduces to
Now we proceed to show that the terms involving W in (11.9) will have trace zero. First, we have that
where again Lemma 11.2 was applied for L, and index r can be either 1 or 2. Note that
where \(|\rho \rangle \) is the vector with \(A^\#_{mr}\rho \) concentrated at site m. So, for this choice of \(|\rho \rangle \),
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
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
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.
About this article
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
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-023-04062-6