SearcharxivSearch

arXiv · 1803.03436

Recurrence and transience of continuous-time open quantum walks

Abstract

This paper is devoted to the study of continuous-time processes known as continuous-time open quantum walks (CTOQWs). A CTOQW represents the evolution of a quantum particle constrained to move on a discrete graph, but also has internal degrees of freedom modeled by a state (in the quantum mechanical sense), and contain as a special case continuous-time Markov chains on graphs. Recurrence and transience of a vertex are an important notion in the study of Markov chains, and it is known that all vertices must be of the same nature if the Markov chain is irreducible. In the present paper we address the corresponding results in the context of irreducible CTOQWs. Because of the "quantum" internal degrees of freedom, CTOQWs exhibit non standard behavior, and the classification of recurrence and transience properties obeys a "trichotomy" rather than the classical dichotomy. Essential tools in this paper are the so-called "quantum trajectories" which are jump stochastic differential equations which can be associated with CTOQWs.

Explore related subjects

Keep this discovery

BibTeXRIS

Ivan Bardet, Hugo Bringuier, Yan Pautrat, Clement Pellegrini. 2018-03-09. Recurrence and transience of continuous-time open quantum walks. https://arxiv.org/abs/1803.03436

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR