Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.01 vteřin. 
Grover's algorithm in Quantum computing and its applications
Katabira, Joseph ; Návrat, Aleš (oponent) ; Hrdina, Jaroslav (vedoucí práce)
Quantum computing as a new field of computing is a quickly growing field which encapsulates the role of quantum phenomenon in our day to day lives. Because of the quantum characteristics, quantum computers have proved quantum supremacy over the classical computers. In this thesis we focused on discussing basics of quantum computing and in particular we focused on discussing the functioning, construction and implementation of Grover algorithm as a special case of quantum algorithms. We showcased its power as a database search algorithm over the classical non quantum ones through our algorithmic construction implemented through QISKit simulation environment. To simulate our construction, we made use of QASM Simulator and the State vector Simulator Aer backends and the results obtained correlated with the earlier discussed theoretical findings highly proving that Grover's algorithm provides quadratic speed up over the classical non quantum search algorithm which is a much better improvement but as at hand, the applicability of the algorithm as many others is still limited by several factors amongst which includes high decoherence levels and gate errors.
Grover's algorithm in Quantum computing and its applications
Katabira, Joseph ; Návrat, Aleš (oponent) ; Hrdina, Jaroslav (vedoucí práce)
Quantum computing as a new field of computing is a quickly growing field which encapsulates the role of quantum phenomenon in our day to day lives. Because of the quantum characteristics, quantum computers have proved quantum supremacy over the classical computers. In this thesis we focused on discussing basics of quantum computing and in particular we focused on discussing the functioning, construction and implementation of Grover algorithm as a special case of quantum algorithms. We showcased its power as a database search algorithm over the classical non quantum ones through our algorithmic construction implemented through QISKit simulation environment. To simulate our construction, we made use of QASM Simulator and the State vector Simulator Aer backends and the results obtained correlated with the earlier discussed theoretical findings highly proving that Grover's algorithm provides quadratic speed up over the classical non quantum search algorithm which is a much better improvement but as at hand, the applicability of the algorithm as many others is still limited by several factors amongst which includes high decoherence levels and gate errors.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.