Notes for slides: Quantum computation and search algorithms

dc.contributor.advisorRezania, Vahid
dc.contributor.authorEliasson, Leif
dc.date.accessioned2020-06-17
dc.date.accessioned2022-05-31T01:14:57Z
dc.date.available2022-05-31T01:14:57Z
dc.date.issued2020
dc.descriptionPresented in absentia on April 27, 2020 at "Student Research Day" at MacEwan University in Edmonton, Alberta. (Conference cancelled)
dc.description.abstractQuantum computation is the study of the information processing tasks which may be accomplished using quantum mechanical systems. At the heart of inquiries to ascertain the potential of quantum computation is the question of whether it is possible for a quantum computer to efficiently solve computational problems which have no efficient solution on a classical computer. Pioneering work done by David Deutsch, Peter Shor, Lov Grover and others in the 1980s and 1990s established a great deal of the essential theoretical framework and results which provided answers to this question which has justified continued research and interest in quantum computing ever since. Today we will provide a brief historical and functional overview of the development of quantum computing and its applications during this time, and contrast it with classical computing, and in particular, we will examine Grover’s algorithm as an illustrative example of the potential benefits of quantum search algorithms.
dc.format.extent187.34KB
dc.format.mimetypePDF
dc.identifier.urihttps://hdl.handle.net/20.500.14078/1600
dc.languageEnglish
dc.language.isoen
dc.rightsAll Rights Reserved
dc.subjectquantum computing
dc.subjectGrover’s algorithm
dc.titleNotes for slides: Quantum computation and search algorithms
dc.typeStudent Presentation
dspace.entity.type
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Notes_for_slides:_Quantum_computation_and-_2020_roam.pdf
Size:
187.34 KB
Format:
Adobe Portable Document Format
Description: