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:
“What strikes many twin researchers now is not how much identical twins are alike, but rather how different they are, given the same genetic makeup....Multiples don’t walk around in lockstep, talking in unison, thinking identical thoughts. The bond for normal twins, whether they are identical or fraternal, is based on how they, as individuals who are keenly aware of the differences between them, learn to relate to one another.”
—Pamela Patrick Novotny (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)
“One must not forget that recovery is brought about not by the physician, but by the sick man himself. He heals himself, by his own power, exactly as he walks by means of his own power, or eats, or thinks, breathes or sleeps.”
—Georg Groddeck (1866–1934)