dc.contributor.advisor | Smotrovs, Juris | |
dc.contributor.author | Rupenheits, Zigmārs | |
dc.contributor.other | Latvijas Universitāte. Datorikas fakultāte | |
dc.date.accessioned | 2018-06-30T01:07:01Z | |
dc.date.available | 2018-06-30T01:07:01Z | |
dc.date.issued | 2018 | |
dc.identifier.other | 63964 | |
dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/38650 | |
dc.description.abstract | Darbā ir analizēti zināmi unikāli precīzie kvantu algoritmi, kuru īpašības ir atšķirīgas no citiem literatūrā atrodamiem algoritmiem, un uzsākts pētīt iespējas vispārināt šajos algoritmos esošos paņēmienus. Darbā ir noformulēts jauns skaitļošanas modelis, kas ir saistīts ar precīzo kvantu vaicājumu modeli. Veikti skaitliski aprēķini, lai palīdzētu saprast jaunā modeļa iespējas un ierobežojumus. Izteiktas hipotēzes un virzieni, kādos turpināt analīzi un pētījumu. | |
dc.description.abstract | Exact quantum algorithms are algorithms which by using quantum queries compute value correctly with certainty (probability $P=1$). Quantum query complexity is minimal number of queries required for correct value to be returned over all inputs. It is proven, that for almost all Boolean functions quantum query complexity is less than (classical) decision tree complexity, but only for few of them it is known of what order lower is quantum query complexity. To this day, there is no study of general properties of quantum query that have to be satisfied, for it to derive some exact information about the computable function. \\ In the thesis exact quantum query algorithms using single-quantum-query subroutines will be studied, as well as properties of a quantum query to get some exact information about the computable function. | |
dc.language.iso | lav | |
dc.publisher | Latvijas Universitāte | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Datorzinātne | |
dc.subject | exact quantum algorithms | |
dc.subject | Boolean function query complexity | |
dc.subject | precīzie kvantu algoritmi | |
dc.subject | Būla funkciju vaicājuma sarežģītība | |
dc.title | Precīzie kvantu algoritmi, izmantojot 1-kvantu-vaicājuma izsaukumus | |
dc.title.alternative | Exact quantum query algorithms using single-quantum-query subroutines | |
dc.type | info:eu-repo/semantics/masterThesis | |