About: Two notes on Grover’s search: Programming and discriminating

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Two notes on Grover’s search: Programming and discriminating Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://link.springer.com/article/10.1140/epjp/i2014-14128-9
Description	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. 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. (en)
Title	Two notes on Grover’s search: Programming and discriminating Two notes on Grover’s search: Programming and discriminating (en)
skos:prefLabel	Two notes on Grover’s search: Programming and discriminating Two notes on Grover’s search: Programming and discriminating (en)
skos:notation	RIV/00216224:14330/14:00073888!RIV15-GA0-14330___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP202/12/1142)
http://linked.open...iv/cisloPeriodika	6
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Ziman, Mário
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	51514
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/14:00073888
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	quantum computing; Grover's search algorithm (en)
http://linked.open.../riv/klicoveSlovo	quantum computing Grover's search algorithm
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[C60C349BF0B5]
http://linked.open...i/riv/nazevZdroje	European Physical Journal Plus
http://linked.open...in/vavai/riv/obor	BD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Slabé zdroje entanglementu a náhodnosti
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	129
http://linked.open...iv/tvurceVysledku	Ziman, Mário Reitzner, Daniel
http://linked.open...ain/vavai/riv/wos	000338322500005
issn	2190-5444
number of pages	7 (xsd:int)
http://bibframe.org/vocab/doi	10.1140/epjp/i2014-14128-9
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software