Discrete time quantum walks on percolation graphs

Bálint Kollár, Jaroslav Novotný, T. Kiss, Igor Jex

Research output: Contribution to journalArticle

7 Citations (Scopus)

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.

Original languageEnglish
JournalEuropean Physical Journal Plus
Volume129
Issue number5
DOIs
Publication statusPublished - 2014

Fingerprint

asymptotic methods
integers
transport properties
operators
defects

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Discrete time quantum walks on percolation graphs. / Kollár, Bálint; Novotný, Jaroslav; Kiss, T.; Jex, Igor.

In: European Physical Journal Plus, Vol. 129, No. 5, 2014.

Research output: Contribution to journalArticle

Kollár, Bálint ; Novotný, Jaroslav ; Kiss, T. ; Jex, Igor. / Discrete time quantum walks on percolation graphs. In: European Physical Journal Plus. 2014 ; Vol. 129, No. 5.
@article{ea4e02e13bd444d4b3939ae46985788b,
title = "Discrete time quantum walks on percolation graphs",
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.",
author = "B{\'a}lint Koll{\'a}r and Jaroslav Novotn{\'y} and T. Kiss and Igor Jex",
year = "2014",
doi = "10.1140/epjp/i2014-14103-6",
language = "English",
volume = "129",
journal = "European Physical Journal Plus",
issn = "2190-5444",
publisher = "Springer Science + Business Media",
number = "5",

}

TY - JOUR

T1 - Discrete time quantum walks on percolation graphs

AU - Kollár, Bálint

AU - Novotný, Jaroslav

AU - Kiss, T.

AU - Jex, Igor

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84919935409&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919935409&partnerID=8YFLogxK

U2 - 10.1140/epjp/i2014-14103-6

DO - 10.1140/epjp/i2014-14103-6

M3 - Article

VL - 129

JO - European Physical Journal Plus

JF - European Physical Journal Plus

SN - 2190-5444

IS - 5

ER -