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:
“A woman does not have to make decisions based on the need to survive. She can cut through issues, call shots as she sees them.... Many bad decisions are made by men in government because it is good for them personally to make bad public decisions.”
—Dianne Feinstein (b. 1933)
“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)
“he walks with me
to the gate of Home and leaves me.
I enter.
Mother is gone,
only Things remain.
So be it.”
—Denise Levertov (b. 1923)