A Grover-based quantum search of optimal order for an unknown number of marked elements
| dc.creator | Zalka, Christof | |
| dc.date | 1999-02-12 | |
| dc.date.accessioned | 2026-07-07T06:16:12Z | |
| dc.date.available | 2026-07-07T06:16:12Z | |
| dc.description | We want to find a marked element out of a black box containing N elements. When the number of marked elements is known this can be done elegantly with Grover's algorithm, a variant of which even gives a correct result with certainty. On the other hand, when the number of marked elements is not known the problem becomes more difficult. For every prescribed success probability I give an algorithm consisting of several runs of Grover's algorithm that matches a recent bound by Buhrman and de Wolf on the order of the number of queries to the black box. The improvement in the order over a previously known algorithm is small and the number of queries can clearly still be reduced by a constant factor. | |
| dc.description | 7 pages, Latex, 2 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9902049 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9902049 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93982 | |
| dc.subject | Quantum Physics | |
| dc.title | A Grover-based quantum search of optimal order for an unknown number of marked elements | |
| dc.type | text |