Efficient Simulation of Deutsch’s Algorithm.
Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
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.
IdentifiersURN: urn:nbn:se:liu:diva-114067ISRN: LiTH-MAT-EX--2014/05--SEOAI: oai:DiVA.org:liu-114067DiVA: diva2:786698
Subject / course