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:
“Any reductionist program has to be based on an analysis of what is to be reduced. If the analysis leaves something out, the problem will be falsely posed.”
—Thomas Nagel (b. 1938)
“A personality is an indefinite quantum of traits which is subject to constant flux, change, and growth from the birth of the individual in the world to his death. A character, on the other hand, is a fixed and definite quantum of traits which, though it may be interpreted with slight differences from age to age and actor to actor, is nevertheless in its essentials forever fixed.”
—Hubert C. Heffner (1901–1985)
“Citizen’s Band radio renders one accessible to a wide variety of people from all walks of life. It should not be forgotten that all walks of life include conceptual artists, dry cleaners, and living poets.”
—Fran Lebowitz (b. 1950)