Computer Physics Communications Program LibraryPrograms in Physics & Physical Chemistry |

[Licence| Download | New Version Template] aejn_v1_0.tar.gz(94 Kbytes) | ||
---|---|---|

Manuscript Title: qwViz: visualisation of quantum walks on graphs | ||

Authors: Scott D. Berry, Paul Bourke, Jingbo B. Wang | ||

Program title: qwViz | ||

Catalogue identifier: AEJN_v1_0Distribution format: tar.gz | ||

Journal reference: Comput. Phys. Commun. 182(2011)2295 | ||

Programming language: C. | ||

Computer: 32-bit and 64-bit workstation. | ||

Operating system: Linux, Mac OS X 10.5 (and later). | ||

RAM: Depends on size of graph, typically less than 50MB | ||

Keywords: quantum walk, visualisation, OpenGL, graph drawing, 3D graphics. | ||

PACS: 03.67.Lx, 05.40.Fb. | ||

Classification: 4.15, 14. | ||

External routines: OpenGL, GLUT, Graphviz [1] | ||

Nature of problem:Simulation and visualisation of quantum walks on arbitrarily complex undirected graphs | ||

Solution method:The program uses OpenGL to produce 3D visualisations of time-dependent probability distributions arising from quantum walks on graphs. Graph layouts are automatically generated using Graphviz libraries. | ||

Restrictions:Graph layouts are two-dimensional, with the third spatial dimension being used to represent the probability of finding the quantum walker at a certain location. | ||

Unusual features:The software can be used in active or dual-stereo modes for 3D visualisation of quantum walks. Images and image sequences for movies can be exported in TIFF and TGA formats. | ||

Additional comments:Examples of various input files and an XML Schema are provided. Source codes written in C and Fortran are also supplied for generating QWML files from external quantum walk simulations. | ||

Running time:Computing quantum walk data and graph layout for a 500-step quantum walk on a fifth-generation Sierpinski gasket (366 vertices) took less than 2 seconds on a 2.53GHz Intel Core 2 Duo processor with 4GB of RAM and 3MB L2 shared cache under Mac OS X 10.6.6. The same simulation for a hyper-branched fractal with 1331 vertices took less than 25 seconds. GNU C compiler with optimisation option -O2 was used for these tests. Once data has been computed, the interactive visualisation can be manipulated in real-time. | ||

References: | ||

[1] | Ellson, J., Gansner, E., Koutsofios, E., North, S., and Woodhull, G., Graphviz and dynagraph - static and dynamic graph drawing tools, in Graph Drawing Software, edited by Junger, M. and Mutzel, P., pages 127-148, Springer-Verlag, 2003. |

Disclaimer | ScienceDirect | CPC Journal | CPC | QUB |