Metraipolis › archive › dc_5cc25fa9789b
Quantum algorithm — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Quantum_algorithm
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T09:25:02.824Z
- SHA-256 of the archived text
4f385c761b727bfbc9caba1d88a62516214406a8d10a53550eab0e6efbc4c905- Stable URL of this page
https://metraipolis.com/documento/dc_5cc25fa9789b
How to cite
Quantum algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5cc25fa9789b (Metraipolis archive dc_5cc25fa9789b, sha256 4f385c761b727bfbc9caba1d88a62516214406a8d10a53550eab0e6efbc4c905)
BibTeX
@misc{dc5cc25fa9789b,
title = {Quantum algorithm — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Quantum_algorithm},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5cc25fa9789b; sha256 4f385c761b727bfbc9caba1d88a62516214406a8d10a53550eab0e6efbc4c905},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer, the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement. Problems that are undecidable using classical computers remain undecidable using quantum computers. What makes quantum algorithms interesting is that they might be able to solve some problems faster than classical algorithms because the quantum superposition and quantum entanglement that quantum algorithms exploit generally cannot be efficiently simulated on classical computers (see quantum supremacy). The best-known quantum algorithms are Shor's algorithm for factoring and Grover's algorithm for searching an unstructured database or an unordered list. Shor's algorithm would, if implemented, run much (almost exponentially) faster than the most efficient known classical algorithm for factoring, the general number field sieve. Likewise, Grover's algorithm would run quadratically faster than the best possible classical algorithm for the same task, a linear search. Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»). Fonte: Wikipedia in inglese, voce «Quantum algorithm» — https://en.wikipedia.org/wiki/Quantum_algorithm Wikidata Q2623817 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2623817 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quantum_algorithm?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 1378335615, consultata il 2026-10-06T08:23:29.862Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a69fec6193a27d5abe3c15f66c1bc8e8b5a64f3572def53ad12ea79f1ae492c8