Efficient Simulation of the Deutsch-Jozsa Algorithm
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
We provide a framework wherein one can simulate the Deutsch-Jozsa quantum algorithm on a regular computer within polynomial time, and with linear memory consumption. Under certain reasonable assumptions the simulation solves the problem with a bounded error of probability with only one function evaluation, which is comparable with the efficiency of the quantum algorithm. The provided framework lies within a slight extension of the toy model purposed by Robert W. Spekkens Phys. Rev. A 75 (2007), and consists of transformations that are reminiscent of transformations in quantum mechanics.
Place, publisher, year, edition, pages
2015. , 89 p.
Quantum algorithm, The Deutsch-Jozsa algorithm
IdentifiersURN: urn:nbn:se:liu:diva-120110ISRN: LiTH-IFM-A-EX--15/2992--SEOAI: oai:DiVA.org:liu-120110DiVA: diva2:840938
Subject / course