Limiting properties of stochastic quantum walks on directed graphs
From MaRDI portal
Publication:4603663
DOI10.1088/1751-8121/aa9a4azbMath1382.81127arXiv1703.01792OpenAlexW3100927610WikidataQ62582438 ScholiaQ62582438MaRDI QIDQ4603663
M. Ostaszewski, Adam Glos, Jarosław Adam Miszczak
Publication date: 16 February 2018
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.01792
Quantum stochastic calculus (81S25) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)
Related Items (3)
GKSL generators and digraphs: computing invariant states ⋮ QSW\_MPI: a framework for parallel simulation of quantum stochastic walks ⋮ \textsc{QSWalk.jl}: Julia package for quantum stochastic walks analysis
Cites Work
- Unnamed Item
- The staggered quantum walk model
- Central limit theorem for reducible and irreducible open quantum walks
- Open quantum random walks
- On the generators of quantum dynamical semigroups
- An algebraic condition for the approach to equilibrium of an open N-level system
- Vertices cannot be hidden from quantum spatial search for almost all random graphs
- Steady states of continuous-time open quantum walks
- Central limit theorem and large deviation principle for continuous time open quantum walks
- Comparing classical and quantum pageranks
- An example of the difference between quantum and classical random walks
- A new type of limit theorems for the one-dimensional quantum random walk
- Lively quantum walks on cycles
- Spatial search and the Dirac equation
- Exponential algorithmic speedup by a quantum walk
- Probabilistic Networks and Expert Systems
- SINGULAR VALUE DECOMPOSITION AND MATRIX REORDERINGS IN QUANTUM INFORMATION THEORY
- Completely positive dynamical semigroups of N-level systems
- Quantum walks on graphs
- Quantum Algorithms for the Triangle Problem
This page was built for publication: Limiting properties of stochastic quantum walks on directed graphs
