Please use this identifier to cite or link to this item:
http://archive.cmb.ac.lk:8080/xmlui/handle/70130/3326
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mahasinghe, A. | |
dc.contributor.author | Wang, J. | |
dc.contributor.author | Wijerathna, J. | |
dc.date.accessioned | 2012-12-20T04:46:07Z | |
dc.date.available | 2012-12-20T04:46:07Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Annual Research Symposium | en_US |
dc.identifier.uri | http://archive.cmb.ac.lk:8080/xmlui/handle/70130/3326 | - |
dc.description.abstract | Quantum computing, the quantum analogue of classical computing makes use of qubits - quantum analogue of classical bits, as the elementary quantum registers of storing, manipulating and measuring data (Nakahara and Ohmi, 2008). Mathematically, a qubit is a unit vector of the form so that in a Hilbert space spanned by canonical basis states When a qubit is queried, obtained is a probabilistic answer, instead of a deterministic one. That will be, the state with probability , and with probability . Also quantum algorithms were designed following this quantization. Various strategies for quantum algorithms emerged, along with the one based upon the idea introduced by Aharanov [4], and it was developed under the term ‘quantum walks’. Currently, two main categories of quantum walks are being considered: discrete and continuous quantum walks; while discrete quantum walks were studied under two subcategories as Markov chain-based and coin-based walks. | |
dc.language.iso | en | en_US |
dc.title | Two-particle Quantum Walks over a Line | en_US |
dc.type | Research abstract | en_US |
Appears in Collections: | Science |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
AnnualResearchSymposium2012UniversityofColombo.306-308.pdf | 69.67 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.