We consider the definition of quantum walks on directed graphs. Call a\ndirected graph reversible if, for each pair of vertices (i, j), if i is\nconnected to j then there is a path from j to i. We show that reversibility is\na necessary and sufficient condition for a directed graph...
Quantum walks on directed graphs.Preprint at https://arxiv.org/abs/quant-ph/0504116 (2005). Chandrashekar, C. M. & Busch, T. Quantum percolation and transition point of a directed discrete-time quantum walk. Sci. Rep. 4, 1–11. https://doi.org/10.1038/srep06583 (2014). Article ...
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obta...
We consider the dynamical properties of dissipative continuous-time quantum walks on directed graphs. Using a large-deviation approach we construct a thermodynamic formalism allowing us to define a dynamical order parameter, and to identify transitions between dynamical regimes. For a particular class of...
L. Knight, Entanglement in coined quantum walks on regular graphs, New J. Phys. 7 (1) (2005) 156-. doi:10.1088/1367-2630/7/1/156.I. Carneiro, M. Loo, X. Xu, M. Girerd, V. Kendon and P. L Knight, "En- tanglement in coined quantum walks on regular graphs", New J. Phys....
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a quantum walk where each vertex has a single self...
Quantum Computing: Implementing Hitting Time for Coined Quantum Walks on Regular Graphs 来自 arXiv.org 喜欢 0 阅读量: 34 作者:E Wanzambi,S Andersson 摘要: In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in ...
Two-particle quantum walks: Entanglement and graph isomorphism testing We study discrete-time quantum walks on the line and on general undirected graphs with two interacting or noninteracting particles. We introduce two simple... SD Berry,JB Wang - 《Physical Review A》 被引量: 86发表: 2011年...
Quantum walks in quantum games and quantum graphs 来自 ResearchGate 喜欢 0 阅读量: 14 作者: J Rajendran 摘要: Here we present neutrino oscillation in the framework of quantum walks. Starting from a one spatial dimensional discrete-time quantum walk we present a scheme of evolutions that will...
The generalised model allows also the introduction of directed edges between two already existing nodes. In this work we study the quantum (and classical) Page Rank algorithm on graphs created with this model as implemented in NetworkX40. Let us now discuss results from the application of the ...