Algorithms Based On Quantum Walks
A quantum walk is the quantum analogue of a classical random walk. Similar to a classical random walk, which can be described by a probability distribution over some states, a quantum walk can be described by a quantum superposition over states. Quantum walks are known to give exponential speedups for some black-box problems. They also provide polynomial speedups for many problems. A framework for the creation quantum walk algorithms exists and is quite a versatile tool.
Read more about this topic: Quantum Algorithm
Famous quotes containing the words based, quantum and/or walks:
“The fetish of the great university, of expensive colleges for young women, is too often simply a fetish. It is not based on a genuine desire for learning. Education today need not be sought at any great distance. It is largely compounded of two things, of a certain snobbishness on the part of parents, and of escape from home on the part of youth. And to those who must earn quickly it is often sheer waste of time. Very few colleges prepare their students for any special work.”
—Mary Roberts Rinehart (1876–1958)
“The receipt to make a speaker, and an applauded one too, is short and easy.—Take of common sense quantum sufficit, add a little application to the rules and orders of the House, throw obvious thoughts in a new light, and make up the whole with a large quantity of purity, correctness, and elegancy of style.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)
“After a while
it walks over and taps
on the upstairs window with a bunch
of red berries. Will he wake?”
—Denise Levertov (b. 1923)