In the context of quantum computing, the quantum walk search (sometimes regarded as QFS, similar to DFS and BFS) is a quantum algorithm for finding a marked node in a graph. The concept of a quantum walk is inspired by classical random walks, in which a walker moves randomly through a graph or lattice.
In the context of quantum computing, the quantum walk search (sometimes regarded as QFS, similar to DFS and BFS) is a quantum algorithm for finding a marked node in a graph. The concept of a quantum walk is inspired by classical random walks, in which a walker moves randomly through a graph or lattice.
Source: Wikipedia "Quantum walk search" · CC BY-SA 4.0
Share this article: X · Bluesky