We study the problem of site recurrence of discrete-time nearest-neighbor open quantum random walks (OQWs) on the integer line, proving basic properties and some of its relations with the corresponding problem for unitary (coined) quantum walks (UQWs). For both kinds of walks, our discussion concerns two notions of recurrence, one given by a monitoring procedure (Grünbaum et al. in Commun Math Phys 320:543–569, 2013; Lardizabal and Souza in J Stat Phys 159:772–796, 2015), and we study their similarities and differences. In particular, by considering UQWs and OQWs induced by the same pair of matrices, we discuss the fact that recurrence of these walks is related by an additive interference term in a simple way. Based on a previous result of positive recurrence, we describe an open quantum version of Kac’s lemma for the expected return time to a site.
Quantum Information Processing – Springer Journals
Published: Dec 17, 2016
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud