Quantum counting algorithm – link to Search algorithm

It is not possible to add the new link because it would replace an existing, longer link.

Line 1: Line 1:
{{Short description|Quantum algorithm for counting solutions to search problems}}
{{Short description|Quantum algorithm for counting solutions to search problems}}
The '''Quantum counting algorithm''' is a [[quantum algorithm]] for efficiently counting the number of solutions for a given search problem.
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 algorithm|Grover's search algorithm]].
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.
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.