Další formáty:
BibTeX
LaTeX
RIS
@article{1199041,
author = {Reitzner, Daniel and Ziman, Mário},
article_number = {6},
doi = {http://dx.doi.org/10.1140/epjp/i2014-14128-9},
keywords = {quantum computing; Grover's search algorithm},
language = {eng},
issn = {2190-5444},
journal = {European Physical Journal Plus},
title = {Two notes on Grover’s search: Programming and discriminating},
url = {http://link.springer.com/article/10.1140/epjp/i2014-14128-9},
volume = {129},
year = {2014}
}
TY - JOUR
ID - 1199041
AU - Reitzner, Daniel - Ziman, Mário
PY - 2014
TI - Two notes on Grover’s search: Programming and discriminating
JF - European Physical Journal Plus
VL - 129
IS - 6
SP - 1-7
EP - 1-7
SN - 21905444
KW - quantum computing
KW - Grover's search algorithm
UR - http://link.springer.com/article/10.1140/epjp/i2014-14128-9
L2 - http://link.springer.com/article/10.1140/epjp/i2014-14128-9
N2 - 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.
ER -
REITZNER, Daniel a Mário ZIMAN. Two notes on Grover’s search: Programming and discriminating. \textit{European Physical Journal Plus}. 2014, roč.~129, č.~6, s.~1-7. ISSN~2190-5444. Dostupné z: https://dx.doi.org/10.1140/epjp/i2014-14128-9.
|
