Abstract

Random processes are of interest not only from the theoretical point of view but also for practical use in algorithms for investigating large combinatorial structures. The theory of quantum computing requires implementation of classical algorithms using quantum-mechanical devices, and random walk is an obvious candidate. We present a model for quantum random walk that is based on an interferometric analogy, can be easily implemented, and is a generalization of a former model of quantum random walk proposed by Aharonov and colleagues.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call