München 2004 – scientific programme

Parts | Days | Selection | Search | Downloads | Help

Q: Quantenoptik und Photonik

Q 22: Poster Quanteninformation, -kommunikation und -computer

Q 22.15: Poster

Tuesday, March 23, 2004, 14:00–16:00, Schellingstr. 3

Simulation of Quantum Computations by using Maple — •Thomas Radtke and Stephan Fritzsche — Universität Kassel, 34281 Kassel, Germany

During the last years, the topics of quantum information and computation have attracted a lot of interest. However, apart from the great potential of their applications, they gave rise to a large number of theoretical and experimental questions which still need to be resolved. Popular examples of quantum algorithms like the well-known factorization algorithm for prime numbers by Peter Shor may give a first impression of what quantum computation might be able to do in the future [1].

But for the further analysis of algorithm capabilities and their efficiency, new tools are needed. That is why several simulators for quantum computations have been developed in the past. In order to improve the flexibility of user interaction, we recently started to develop our Feynman program within the framework of Maple. At present, it consists of a set of procedures which offer symbolic and numeric evaluation and manipulation of quantum bits, quantum registers and matrix operators. For the future we plan to extend the program to simulate also quantum algorithms for different physical realizations of quantum computers. We hope that this will enable us to investigate problems that are connected to decoherence and robustness in multi-qubit systems [2].

[1] M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000).

[2] A. W. Harrow, M. A. Nielsen, Phys. Rev. A 68, 012308 (2003).