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 two-parent family based on love and commitment can be a wonderful thing, but historically speaking the “two-parent paradigm” has left an extraordinary amount of room for economic inequality, violence and male dominance.”
—Stephanie Coontz (20th century)
“But how is one to make a scientist understand that there is something unalterably deranged about differential calculus, quantum theory, or the obscene and so inanely liturgical ordeals of the precession of the equinoxes.”
—Antonin Artaud (1896–1948)
“Look. And the dancers move
On the departed, snow bushed green, wanton in moon light
As a dust of pigeons. Exulting, the grave hooved
Horses, centaur dead, turn and tread the drenched white
Paddocks in the farms of birds. The dead oak walks for love.”
—Dylan Thomas (1914–1953)