OSU Logo

Events

« Wednesday January 06, 2010 »
Wed
Start: 2010-01-06 16:00
End: 2010-01-06 17:00

A major aspect of studies of quantum computation is work toward constructing
algorithms that are particularly well suited for a quantum mechanical computer.
An emerging field in this quest is investigation of "quantum walks," which are
applications of ideas of classical random walks to quantum (unitary) processes.
Following the pervasiveness and successes of randomized algorithms across the
board in science, these approaches are expected to bring dramatic algorithmic
improvements to quantum computing.

One of the main generator of ideas, Markov chains, or random walks on graphs,

Syndicate content