Discrete time quantum walks on percolation graphs

13Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear and disappear randomly in each step during the time evolution. The resulting open system dynamics is hard to treat numerically in general. We shortly review the literature on this problem. We then present our method to solve the evolution on finite percolation graphs in the long time limit, applying the asymptotic methods concerning random unitary maps. We work out the case of one-dimensional chains in detail and provide a concrete, step-by-step numerical example in order to give more insight into the possible asymptotic behavior. The results about the case of the two-dimensional integer lattice are summarized, focusing on the Grover-type coin operator.

Cite

CITATION STYLE

APA

Kollár, B., Novotný, J., Kiss, T., & Jex, I. (2014). Discrete time quantum walks on percolation graphs. European Physical Journal Plus, 129(5). https://doi.org/10.1140/epjp/i2014-14103-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free