TY - JOUR

T1 - QSWalk

T2 - A Mathematica package for quantum stochastic walks on arbitrary graphs

AU - Falloon, Peter E E.

AU - Rodriguez, Jeremy

AU - Wang, Jingbo B.

PY - 2017/8/1

Y1 - 2017/8/1

N2 - We present a Mathematica package, QSWalk, to simulate the time evaluation of Quantum Stochastic Walks (QSWs) on arbitrary directed and weighted graphs. QSWs are a generalization of continuous time quantum walks that incorporate both coherent and incoherent dynamics and as such, include both quantum walks and classical random walks as special cases. The incoherent component allows for quantum walks along directed graph edges. The dynamics of QSWs are expressed using the Lindblad formalism, originally developed for open quantum systems, which frames the problem in the language of density matrices. For a QSW on a graph of N vertices, we have a sparse superoperator in an N2-dimensional space, which can be solved efficiently using the built-in MatrixExp function in Mathematica. We illustrate the use of the QSWalk package through several example case studies. Program summary Program Title: QSWalk.m Program Files doi: http://dx.doi.org/10.17632/8rwd3j9zhk.1 Licensing provisions: GNU General Public License 3 (GPL) Programming language: Mathematica. Nature of problem: The QSWalk package provides a method for simulating quantum stochastic walks on arbitrary (directed/undirected, weighted/unweighted) graphs. Solution method: For an N-vertex graph, the solution of a quantum stochastic walk can be expressed as an N2×N2 sparse matrix exponential. The QSWalk package makes use of Mathematica's sparse linear algebra routines to solve this efficiently. Restrictions: The size of graphs that can be treated is constrained by available memory.

AB - We present a Mathematica package, QSWalk, to simulate the time evaluation of Quantum Stochastic Walks (QSWs) on arbitrary directed and weighted graphs. QSWs are a generalization of continuous time quantum walks that incorporate both coherent and incoherent dynamics and as such, include both quantum walks and classical random walks as special cases. The incoherent component allows for quantum walks along directed graph edges. The dynamics of QSWs are expressed using the Lindblad formalism, originally developed for open quantum systems, which frames the problem in the language of density matrices. For a QSW on a graph of N vertices, we have a sparse superoperator in an N2-dimensional space, which can be solved efficiently using the built-in MatrixExp function in Mathematica. We illustrate the use of the QSWalk package through several example case studies. Program summary Program Title: QSWalk.m Program Files doi: http://dx.doi.org/10.17632/8rwd3j9zhk.1 Licensing provisions: GNU General Public License 3 (GPL) Programming language: Mathematica. Nature of problem: The QSWalk package provides a method for simulating quantum stochastic walks on arbitrary (directed/undirected, weighted/unweighted) graphs. Solution method: For an N-vertex graph, the solution of a quantum stochastic walk can be expressed as an N2×N2 sparse matrix exponential. The QSWalk package makes use of Mathematica's sparse linear algebra routines to solve this efficiently. Restrictions: The size of graphs that can be treated is constrained by available memory.

KW - Density matrix

KW - Lindblad master equation

KW - Mathematica

KW - Open system

KW - Quantum stochastic walk

KW - Superoperator

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

U2 - 10.1016/j.cpc.2017.03.014

DO - 10.1016/j.cpc.2017.03.014

M3 - Article

AN - SCOPUS:85019024977

VL - 217

SP - 162

EP - 170

JO - Computer Physics Communications

JF - Computer Physics Communications

SN - 0010-4655

ER -