| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Pregledna analiza izbranih kvantnih algoritmov : diplomsko delo
Authors:ID Stevanoska, Viktorija (Author)
ID Holobar, Aleš (Mentor) More about this mentor... New window
Files:.pdf UN_Stevanoska_Viktorija_2022.pdf (3,77 MB)
MD5: DBA0361E668EF24C189A19150EBF6D42
 
Language:Slovenian
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Pred samo 40 leti sta Paul Benioff in David Deutsch objavila članka o novem konceptu računanja, ki se je močno razlikoval od klasičnega načina. Ta nova metoda je uporabljala zakone kvantne mehanike. Z orodji, ki jih je ponujala linearna algebra, je nastala nova oblika razmišljanja o računanju - kvantni Turingov stroj. Od takrat je tehnologija napredovala tako daleč, da je bilo mogoče zgraditi kvantne stroje in da ji je uspelo (do neke mere) uspešno zmanjšati težave, ki izhajajo iz njihovih fizikalnih omejitev. Danes lahko človeštvo prosto dostopa do teh strojev in izkusi njihovo zmogljivost. Razvitih je bilo veliko število algoritmov, z njimi pa tudi novi kvantni programski jeziki. Programerji se bodo morali naučiti uporabljati kvantne algoritme, da bodo lahko s temi kvantnimi stroji v celoti izkoristili njihov potencial. V tem diplomskem delu analiziramo nekaj manj znanih algoritmov, ki so prav tako pomembni kot drugi, bolj znani algoritmi, najpogosteje obravnavani v večini besedil in knjig. Preučili smo pet kvantnih algoritmov: kvantno ocenjevanje faz, kvantno štetje, kvantne sprehode, kvantni algoritem za linearne sisteme enačb in variacijsko kvantno iskanje lastnih rešitev. Predstavili smo probleme, ki jih rešujejo, njihovo uporabnost na posameznih področjih, računsko zahtevnost, njihove prednosti pred klasičnimi analogi in njihove omejitve. Uporabili smo tudi programsko orodje (Qiskit) za vizualizacijo in implementacijo teh algoritmov, ter primerjali njihove teoretične in eksperimentalne rezultate, tako na simulatorju kvantnega stroja kot na pravem kvantnem računalniku.
Keywords:kvantni, algoritmi, analiza, Qiskit
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[V. Stevanoska]
Year of publishing:2022
Number of pages:1 spletni vir (1 datoteka PDF (X, 48 f.))
PID:20.500.12556/DKUM-82488 New window
UDC:004.021:530.145(043.2)
COBISS.SI-ID:134274563 New window
Publication date in DKUM:21.10.2022
Views:374
Downloads:49
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:22.08.2022

Secondary language

Language:English
Title:A comprehensive analysis of selected quantum algorithms
Abstract:Just 40 years ago, Paul Benioff and David Deutsch published articles on a new concept of computing that greatly differed from the classical scheme. This new method used the laws of quantum mechanics, and with the tools that linear algebra offered, a new form of thinking about computation emerged - the quantum Turing machine. Since then, technology has gone so far as to be able to build these new quantum machines and managed to successfully (to some extent) mitigate the problems that arise from their physical limits. Today, humanity can freely access these machines and experience just how powerful they can be! A significant number of algorithms have been developed, and along with them new quantum programming languages. It will become essential for programmers to learn how to use quantum algorithms in order manipulate these quantum machines for their full potential. In this thesis, we present some less known algorithms, which are just as important as the other more famous algorithms, commonly examined in most texts and books. We examine five quantum algorithms: quantum phase estimation, quantum counting, quantum walks, the quantum algorithm for linear systems of equations and the variational quantum eigensolver. We discuss the problems that they address, their applicability in their respective areas, computational complexity, their advantages over their classical counterparts, and their limitations. We also use a software tool (Qiskit) to visualize and implement these algorithms, and compare their theoretical and experimentational results, both on a quantum machine simulator, and on a real quantum computer.
Keywords:quantum, algorithms, analysis, Qiskit


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica