Elsevier Science Home
Computer Physics Communications Program Library
Full text online from Science Direct
Programs in Physics & Physical Chemistry
CPC Home

Manuscript Title: QDENSITY - A MATHEMATICA QUANTUM COMPUTER SIMULATION
Authors: Bruno Juliá-Díaz, Joseph M. Burdis, Frank Tabakin
Program title: QDENSITY
Catalogue identifier: ADXH_v1_0
Distribution format: tar.gz
Journal reference: Comput. Phys. Commun. 174(2006)914
Programming language: Mathematica 5.2.
Operating system: Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux FC4.
Keywords: quantum gates, quantum circuits, density matrix, teleportation, search algorithms, Shor's algorithm, partial trace, quantum entropy, quantum states, n-qubit, quantum simulation, quantum clusters.
PACS: 3.67.Lx, 3.67.Mn, 3.65.Ud.
Classification: 4.15.

Nature of problem:
Analysis and design of quantum circuits, quantum algorithms and quantum clusters.

Solution method:
A Mathematica package is provided which contains commands to create and analyze quantum circuits. Several Mathematica notebooks containing relevant examples: Teleportation, Shor's Algorithm and Grover's search are explained in detail. A tutorial, Tutorial.nb is also enclosed.

Running time:
Most examples included in the package, e.g. the tutorial, Shor's examples, Teleportation examples and Grover's search, run in less than a minute on a Pentium 4 processor (2.6 Ghz).
The running time for a quantum computation depends crucially on the number of qubits employed.