An extension of the Deutsch-Jozsa algorithm to arbitrary qudits
| dc.contributor.advisor | Rangacharyulu, Chilakamarri (Chary) | en_US |
| dc.contributor.committeeMember | Plyukhin, Alexander V. | en_US |
| dc.contributor.committeeMember | Koustov, Alexandre V. (Sasha) | en_US |
| dc.contributor.committeeMember | Dutchyn, Christopher | en_US |
| dc.contributor.committeeMember | Dick, Rainer | en_US |
| dc.contributor.committeeMember | Bradley, Michael P. | en_US |
| dc.creator | Marttala, Peter | en_US |
| dc.date.accessioned | 2007-07-26T10:50:41Z | en_US |
| dc.date.accessioned | 2013-01-04T04:47:46Z | |
| dc.date.available | 2008-08-01T08:00:00Z | en_US |
| dc.date.available | 2013-01-04T04:47:46Z | |
| dc.date.created | 2007 | en_US |
| dc.date.issued | 2007 | en_US |
| dc.date.submitted | 2007 | en_US |
| dc.description.abstract | Recent advances in quantum computational science promise substantial improvements in the speed with which certain classes of problems can be computed. Various algorithms that utilize the distinctively non-classical characteristics of quantum mechanics have been formulated to take advantage of this promising new approach to computation. One such algorithm was formulated by David Deutsch and Richard Jozsa. By measuring the output of a quantum network that implements this algorithm, it is possible to determine with N – 1 measurements certain global properties of a function f(x), where N is the number of network inputs. Classically, it may not be possible to determine these same properties without evaluating f(x) a number of times that rises exponentially as N increases. Hitherto, the potential power of this algorithm has been explored in the context of qubits, the quantum computational analogue of classical bits. However, just as one can conceive of classical computation in the context of non-binary logic, such as ternary or quaternary logic, so also can one conceive of corresponding higher-order quantum computational equivalents.This thesis investigates the behaviour of the Deutsch-Jozsa algorithm in the context of these higher-order quantum computational forms of logic and explores potential applications for this algorithm. An important conclusion reached is that, not only can the Deutsch-Jozsa algorithm’s known computational advantages be formulated in more general terms, but also a new algorithmic property is revealed with potential practical applications. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10388/etd-07262007-105041 | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | quantum logic | en_US |
| dc.subject | Deutsch-Jozsa | en_US |
| dc.subject | qudits | en_US |
| dc.subject | quantum algorithms | en_US |
| dc.subject | quantum computation | en_US |
| dc.subject | quantum computing | en_US |
| dc.title | An extension of the Deutsch-Jozsa algorithm to arbitrary qudits | en_US |
| dc.type.genre | Thesis | en_US |
| dc.type.material | text | en_US |
| thesis.degree.department | Physics and Engineering Physics | en_US |
| thesis.degree.discipline | Physics and Engineering Physics | en_US |
| thesis.degree.grantor | University of Saskatchewan | en_US |
| thesis.degree.level | Masters | en_US |
| thesis.degree.name | Master of Science (M.Sc.) | en_US |