liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Efficient Simulation of Deutsch’s Algorithm.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, The Institute of Technology.
2014 (English)Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
Abstract [en]

It is shown that Deutsch’s algorithm and the Deutsch-Jozsa algorithm for two and three qubits can be efficiently implemented on a classical computer. This is done by analysing the structure of the oracles contained in these algorithms, followed by an implementation in the toy theory proposed by Robert W. Spekkens which uses 2 classical bits to simulate a qubit. Further discussion is given about how to analyse, and possible implementations, of the Deutsch-Jozsa for higher number of qubits in the toy theory.

Place, publisher, year, edition, pages
2014. , 48 p.
National Category
URN: urn:nbn:se:liu:diva-114067ISRN: LiTH-MAT-EX--2014/05--SEOAI: diva2:786698
Subject / course
Available from: 2015-02-06 Created: 2015-02-06 Last updated: 2016-08-31Bibliographically approved

Open Access in DiVA

Efficient Simulation of Deutsch’s Algorithm(403 kB)242 downloads
File information
File name FULLTEXT01.pdfFile size 403 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Johansson, Niklas
By organisation
Mathematics and Applied MathematicsThe Institute of Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 242 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 202 hits
ReferencesLink to record
Permanent link

Direct link