Two notes on Grover’s search: Programming and discriminating

Logo poskytovatele

Varování

Publikace nespadá pod Fakultu sportovních studií, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

REITZNER Daniel ZIMAN Mário

Rok publikování 2014
Druh Článek v odborném periodiku
Časopis / Zdroj European Physical Journal Plus
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www http://link.springer.com/article/10.1140/epjp/i2014-14128-9
Doi http://dx.doi.org/10.1140/epjp/i2014-14128-9
Obor Teorie informace
Klíčová slova quantum computing; Grover's search algorithm
Popis In this work we address two questions concerning Grover’s algorithm. In the first part we give an answer to the question on how to employ Grover’s algorithm for actual search over database. We introduce a quantum model of an unordered phone book (quantum database) with programmable queries to search in the phone book either for a number or for a name. In the second part we investigate how successful the algorithm can be if the number of elements of the database is not known precisely. This question reduces to analysis of the distinguishability of states occurring during Grover’s algorithm. We found that using an unambiguous discrimination scheme even a seemingly good guess that is close to the optimal one, can result in a rather small success rate.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info