Grover Algorithm

EMU I-REP

Show simple item record

dc.contributor.author Gazioğlu, Ersan
dc.date.accessioned 2012-12-03T13:20:56Z
dc.date.available 2012-12-03T13:20:56Z
dc.date.issued 2011
dc.identifier.citation Gazioglu, Ersan. (2011). Grover Algorithm. Thesis (M.S.), Eastern Mediterranean University, Institute of Graduate Studies and Research, Dept. of Mathematics, Famagusta: North Cyprus. en_US
dc.identifier.uri http://hdl.handle.net/11129/143
dc.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. en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Eastern Mediterranean University (EMU) en_US
dc.subject Mathematics en_US
dc.subject Quantum Search - Search - Quantum Computing - Grover's Algorithm en_US
dc.title Grover Algorithm en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record