EMU I-REP >
08 Faculty of Arts and Sciences >
Department of Mathematics >
Theses (Master's and Ph.D) – Mathematics >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11129/143
|
Title: | Grover Algorithm |
Authors: | Gazioğlu, Ersan |
Keywords: | Mathematics Quantum Search - Search - Quantum Computing - Grover's Algorithm |
Issue Date: | 2011 |
Publisher: | Eastern Mediterranean University (EMU) |
Citation: | Gazioglu, Ersan. (2011). Grover Algorithm. Thesis (M.S.), Eastern Mediterranean University, Institute of Graduate Studies and Research, Dept. of Mathematics, Famagusta: North Cyprus. |
Abstract: | Although, the past years brought many exciting and pathfinder achievements in computer science, computer engineers still agreed on a point that the computers of the next generation should be the quantum computers. These will be computation devices to make direct use of quantum mechanical phenomena, such as superposition and entanglement, to carry out operations on data. However, the quantum computer means we need a quantum programming language to understand and to be able to use it. Sadly, the quantum computing is improved so slowly that we can say it is still in its infancy. Even so, after the big surprise of Peter Shor in 1994[12], Lov Grover came across in 1996 [9] with another surprising algorithm that searches an unsorted database in less than linear time unlike the models of classical computation. |
Description: | Master of Science in Applied Mathematics and Computer Science. Thesis (M.S.)--Eastern Mediterranean University, Faculty of Arts and Sciences, Dept. of Mathematics, 2011. Supervisor: Assist. Prof. Dr. Mustafa Rıza. |
URI: | http://hdl.handle.net/11129/143 |
Appears in Collections: | Theses (Master's and Ph.D) – Mathematics
|
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|