An example of the difference between quantum and classical random walks
classification
🪐 quant-ph
keywords
quantumrandomclassicalgraphwalksanaloguebehaviorcase
read the original abstract
In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.