Limiting properties of stochastic quantum walks on directed graphs

DOI10.1088/1751-8121/AA9A4AzbMATH Open1382.81127arXiv1703.01792OpenAlexW3100927610WikidataQ62582438 ScholiaQ62582438MaRDI QIDQ4603663FDOQ4603663

Authors: Adam Glos, Jarosław Adam Miszczak, Mateusz Ostaszewski 

Publication date: 16 February 2018

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: The main results of our work is determining the differences between limiting properties in various models of quantum stochastic walks. In particular, we prove that in the case of strongly connected and a class of weakly connected directed graphs, local environment interaction evolution is relaxing, and in the case of undirected graphs, global environment interaction evolution is convergent. For other classes of directed graphs we show, that the character of connectivity large influence on the limiting properties. We also study the limiting properties for the non-moralizing global interaction case. We demonstrate that the digraph observance is recovered in this case.

Full work available at URL: https://arxiv.org/abs/1703.01792

Recommendations

• Quantum walks on directed graphs
• Limiting distributions of quantum walks on the square lattice
• Limit theorems for the discrete-time quantum walk on a graph with joined half lines
• The related properties of quantum walk on the finite graphs
• Quantum walks on graphs
• scientific article; zbMATH DE number 5234309
• STUDY OF CONTINUOUS-TIME QUANTUM WALKS ON QUOTIENT GRAPHS VIA QUANTUM PROBABILITY THEORY
• scientific article; zbMATH DE number 2222671
• On the equivalence between quantum and random walks on finite graphs
• Limit theorems for discrete-time quantum walks on trees

zbMATH Keywords

stationary statesstate convergencerelaxingquantum stochastic walks

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81) Quantum stochastic calculus (81S25)

Cites Work

• Title not available (Why is that?)
• Probabilistic Networks and Expert Systems
• Exponential algorithmic speedup by a quantum walk
• On the generators of quantum dynamical semigroups
• A new type of limit theorems for the one-dimensional quantum random walk
• The staggered quantum walk model
• Spatial search and the Dirac equation
• Open quantum random walks
• Completely positive dynamical semigroups of \(N\)-level systems
• Quantum walks on graphs
• Quantum Algorithms for the Triangle Problem
• An example of the difference between quantum and classical random walks
• An algebraic condition for the approach to equilibrium of an open N-level system
• Central limit theorem for reducible and irreducible open quantum walks
• Singular value decomposition and matrix reorderings in quantum information theory
• Comparing classical and quantum pageranks
• Central limit theorem and large deviation principle for continuous time open quantum walks
• Vertices cannot be hidden from quantum spatial search for almost all random graphs
• Steady states of continuous-time open quantum walks
• Lively quantum walks on cycles

Cited In (5)

• \textsc{QSWalk.jl}: Julia package for quantum stochastic walks analysis
• Limiting distributions of quantum walks on the square lattice
• GKSL generators and digraphs: computing invariant states
• QSW\_MPI: a framework for parallel simulation of quantum stochastic walks
• Transport properties in directed quantum walks on the line

This page was built for publication: Limiting properties of stochastic quantum walks on directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603663)