Metraipolis › archive › dc_7e8f168ba6fa
Quantum walk search — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Quantum_walk_search
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:22:52.537Z
- SHA-256 of the archived text
261ba6bf3bba22689e7b2a65a799bcb9934dcb85c3161cc691d058dc44786de8- Stable URL of this page
https://metraipolis.com/documento/dc_7e8f168ba6fa
How to cite
Quantum walk search — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_walk_search (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_7e8f168ba6fa (Metraipolis archive dc_7e8f168ba6fa, sha256 261ba6bf3bba22689e7b2a65a799bcb9934dcb85c3161cc691d058dc44786de8)
BibTeX
@misc{dc7e8f168ba6fa,
title = {Quantum walk search — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Quantum_walk_search},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_7e8f168ba6fa; sha256 261ba6bf3bba22689e7b2a65a799bcb9934dcb85c3161cc691d058dc44786de8},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_walk_search. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 a classical random walk, the position of the walker can be described using a probability distribution over the different nodes of the graph. In a quantum walk, on the other hand, the walker is represented by a quantum state, which can be in a superposition of several locations simultaneously. Search algorithms based on quantum walks have the potential to find applications in various fields, including optimization, machine learning, cryptography, and network analysis. The efficiency and probability of success of a quantum walk search depend heavily on the structure of the search space. In general, quantum walk search algorithms offer an asymptotic quadratic speedup similar to that of Grover's algorithm. One of the first works on the application of quantum walk to search problems was proposed by Neil Shenvi, Julia Kempe, and K. Birgitta Whaley. Tema degli esploratori: fisica e astronomia (deposito sistematico; ricerca «quantum computing»). Fonte: Wikipedia in inglese, voce «Quantum walk search» — https://en.wikipedia.org/wiki/Quantum_walk_search Wikidata Q120436189 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q120436189 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quantum_walk_search?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1370740710, consultata il 2026-10-07T23:01:58.669Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f98758009add4681421d71ee86264a23e2274a3e25423f7a69669ad8337d1d03