Unit:
Κατεύθυνση Πυρηνική Φυσική και Φυσική Στοιχειωδών Σωματιδίων (ΒΑΣΙΚΗ ΦΥΣΙΚΗ)Library of the School of Science
Author:
Καλαντζής Δημήτριος
Supervisors info:
Φλωράρος Εμμανουήλ Καθηγητής (Επιβλέπων), Καρανίκας Αλέξανδρος Αναπλ. Καθηγητής, Διάκονος Φώτιος Αναπλ. Καθηγητής
Original Title:
Κβαντικοί τυχαίοι περίπατοι
Translated title:
Quantum random walks
Summary:
Quabtym information is the branch of physics and informatics that is trying to
take advantage of the quantum properties of nature in order to store and mostly
manipulate information. The goal is to achieve quantum speedup in some
algorithms compared to the best know classical ones.
Grover's algorithm is used to search M elements out of N entries and it is
proven that provides a quantum speedup of order n^(1/2) for a localised base of
entries. Quantum random wlaks are the generalization of this algorithm in
extended graphs or the quantum analog of classical random walks.
They are separated in continuous and discrete time algorithms, the first ending
in solving the schrodinger equation for a discrete graph in space and the
second being the discretised version of the schrodinger equation viewed as a
Markov procces.
It is proven that there is also a quantum speedup of order N^(1/2) in this case
as well.
Keywords:
Quantum Random Walk, Quantum Information, Quantum Speedum, Grover, Quantum Mechanics
Number of index pages:
2-3
