This item is non-discoverable
Quantum computation and search algorithms: a historical overview and introduction
| dc.contributor.advisor | Rezania, Vahid | |
| dc.contributor.author | Eliasson, Leif | |
| dc.date.accessioned | 2020-06-17 | |
| dc.date.accessioned | 2022-05-31T01:14:57Z | |
| dc.date.available | 2022-05-31T01:14:57Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | Quantum 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. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14078/1599 | |
| dc.language | English | |
| dc.language.iso | en | |
| dc.rights | All Rights Reserved | |
| dc.title | Quantum computation and search algorithms: a historical overview and introduction | en |
| dc.type | Student Presentation | |
| dspace.entity.type |