6533b821fe1ef96bd127b762

RESEARCH PRODUCT

Ultrametric Vs. Quantum Query Algorithms

Rūsiņš Freivalds

subject

Quantum queryDegree (graph theory)Computer scienceComputer Science::Information RetrievalProbabilistic logicMathematics::General TopologyCondensed Matter::Disordered Systems and Neural NetworksIndeterminismMathematics::Metric GeometryProbabilistic analysis of algorithmsQuantum algorithmAlgorithmUltrametric spaceComputer Science::DatabasesMathematicsofComputing_DISCRETEMATHEMATICSReal number

description

Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.

yearjournalcountryeditionlanguage
2014-01-01
https://doi.org/10.1007/978-3-319-13749-0_1