Metraipolis › archive › dc_65720d8ce09e

Quantum counting algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Quantum_counting_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:54:18.795Z
SHA-256 of the archived text
f2604d29216e80f46e666dcf8c8151e72daca453e18fc7084250d030f0cf9ce4
Stable URL of this page
https://metraipolis.com/documento/dc_65720d8ce09e

How to cite

Quantum counting algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_counting_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_65720d8ce09e (Metraipolis archive dc_65720d8ce09e, sha256 f2604d29216e80f46e666dcf8c8151e72daca453e18fc7084250d030f0cf9ce4)
BibTeX
@misc{dc65720d8ce09e,
  title = {Quantum counting algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Quantum_counting_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_65720d8ce09e; sha256 f2604d29216e80f46e666dcf8c8151e72daca453e18fc7084250d030f0cf9ce4},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_counting_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Quantum counting algorithm is a quantum algorithm for efficiently counting the number of solutions for a given search problem. The algorithm is based on the quantum phase estimation algorithm and on Grover's search algorithm. Counting problems are common in diverse fields such as statistical estimation, statistical physics, networking, etc. As for quantum computing, the ability to perform quantum counting efficiently is needed in order to use Grover's search algorithm (because running Grover's search algorithm requires knowing how many solutions exist). Moreover, this algorithm solves the quantum existence problem (namely, deciding whether any solution exists) as a special case. The algorithm was devised by Gilles Brassard, Peter Høyer and Alain Tapp in 1998.

Tema degli esploratori: fisica e astronomia (deposito sistematico; ricerca «quantum computing»).
Fonte: Wikipedia in inglese, voce «Quantum counting algorithm» — https://en.wikipedia.org/wiki/Quantum_counting_algorithm
Wikidata Q28454793 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q28454793
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quantum_counting_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 1360599651, consultata il 2026-10-07T22:28:53.028Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f64f58112d5c9ae1bbdc20d4cee0fe3dcde9c3b46368bdf773abb5ae901c9b2e