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)
“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)
“The vulgar look upon a man, who is reckoned a fine speaker, as a phenomenon, a supernatural being, and endowed with some peculiar gift of Heaven; they stare at him, if he walks in the park, and cry, that is he. You will, I am sure, view him in a juster light, and nulla formidine. You will consider him only as a man of good sense, who adorns common thoughts with the graces of elocution, and the elegancy of style. The miracle will then cease.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)