Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0803.3459 · Computer Physics Communications

The QWalk simulator of quantum walks

Franklin de Lima Marquezino, Renato Portugal

Published Apr 9, 2008• 21 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2008.02.019

Related papers

QWalk: A quantum Monte Carlo program for electronic structure

Lucas K. Wagner, Michal Bajdich, Luboš Mitáš

arXiv:0710.4361•Journal of Computational Physics•Jan 30, 2009•151 citations

Quandoop: A Classical Simulator of Quantum Walks on Computer Clusters

David M. Souza, Franklin de Lima Marquezino, ALEXANDRE ANTÔNIO DE LIMA JUNIOR

We describe software Quandoop, a novel simulator of discrete-time quantum walks using high-performance computing (HPC) with the goal of handling simulations with very large Hilbert spaces.Those simulations are usually restricted to a relatively small number of steps due to memory limitations or reduced processing power.The most important feature of Quandoop when compared to previous simulators is to provide a low cost solution for simulations of quantum walks with extreme memory requirements.Examples of such simulations include quantum walks on fractals or with multiple interacting walkers.Quandoop uses Apache Hadoop to parallelize the calculations on a computer cluster, thus reducing the amount of time required to perform the quantum walk simulation and allowing its execution with more steps.Our simulator takes the input as text files containing the initial state, the evolution operators and the description of simulation parameters.This approach allows the integration with other quantum walk simulators such as HiPerWalk or QWalk.After running the necessary calculations in parallel, Quandoop outputs text files describing the results associated to the quantum walk.

Journal of Computational Interdisciplinary Sciences•Jan 1, 2017•0 citations

Quantum walks: a comprehensive review

Salvador Elías Venegas-Andraca

arXiv:1201.4780•Quantum Information Processing•Jul 7, 2012•983 citations

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk

Kai Lü, Yi Zhang, Kai Xu +2 more

Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for example in scene matching, video indexing, chemical similarity and shape analysis. In this paper, a novel algorithm Qwalk is proposed for approximate MCS, utilizing the discrete-time quantum walk. Based on the new observation that isomorphic neighborhood group matches can be detected quickly and conveniently by the destructive interference of a quantum walk, the new algorithm locates an approximate solution via merging neighborhood groups. Experiments show that Qwalk has better accuracy, universality and robustness compared with the state-of-the-art approximate MCS methods. Meanwhile, Qwalk is a general algorithm to solve the MCS problem approximately while having modest time complexity.

Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition•Aug 1, 2014•5 citations

Introduction to Quantum Walks

Renato Portugal

Quantum science and technology•Jan 1, 2018•2 citations

CAMPINA INVESTS IN NEW PRODUCTION FACILITY

Several research groups are giving special attention to quantum walks recently, because this research area have been used with success in the development of new efficient quantum algorithms. A general simulator of quantum walks is very important for the development of this area, since it allows the researchers to focus on the mathematical and physical aspects of the research instead of deviating the efforts to the implementation of specific numerical simulations. In this paper we present QWalk, a quantum walk simulator for one- and two-dimensional lattices. Finite two-dimensional lattices with generic topologies can be used. Decoherence can be simulated by performing measurements or by breaking links of the lattice. We use examples to explain the usage of the software and to show some recent results of the literature that are easily reproduced by the simulator.Program title: QWalkCatalogue identifier: AEAX_v1_0Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEAX_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GNU General Public LicenceNo. of lines in distributed program, including test data, etc.: 10 010No. of bytes in distributed program, including test data, etc.: 172 064Distribution format: tar.gzProgramming language: CComputer: Any computer with a C compiler that accepts ISO C99 complex arithmetic (recent versions of GCC, for instance). Pre-compiled Windows versions are also providedOperating system: The software should run in any operating system with a recent C compiler. Successful tests were performed in Linux and WindowsRAM: Less than 10 MB were required for a two-dimensional lattice of size 201×201. About 400 MB, for a two-dimensional lattice of size 1601×1601Classification: 16.5Nature of problem: Classical simulation of discrete quantum walks in one- and two-dimensional lattices.Solution method: Iterative approach without explicit representation of evolution operator.Restrictions: The available amount of RAM memory imposes a limit on the size of the simulations.Unusual features: The software provides an easy way of simulating decoherence through detectors or random broken links. In the two-dimensional simulations it also allows the definition of permanent broken links, besides calculation of total variation distance (from the uniform and from an approximate stationary distribution) and the choice between two different physical lattices. It also provides an easy way of performing measurements on specific sites of the 2D lattice and the analysis of observation screens. In one-dimensional simulations it allows the choice between three different lattices. Both one- and two-dimensional simulations facilitates the generation of graphics by automatically generating gnuplot scrips.Additional comments:•An earlier version of QWalk was first presented in [1].•The simulator generates gnuplot scripts that can be used to make graphics of the output data.•Several examples of input files are provided.Running time: The simulation of 100 steps for a two-dimensional lattice of size 201×201 took less than 2 seconds on a Pentium IV 2.6 GHz with 512 MB of RAM memory, 512 KB of cache memory and under Linux. It also took about 15 minutes for a lattice of size 1601×1601 on the same computer. Optimization option -O2 was used during compilation for these tests.References: [1] F.L. Marquezino, R. Portugal, QWalk: Simulador de caminhadas quânticas, in: Proceedings of 2nd WECIQ, Campina Grande, Brazil, IQuanta, 2007, pp. 123–132.

Filtration Industry Analyst•Sep 1, 2002•0 citations
We describe software Quandoop, a novel simulator of discrete-time quantum walks using high-performance computing (HPC) with the goal of handling simulations with very large Hilbert spaces.Those simulations are usually restricted to a relatively small number of steps due to memory limitations or reduced processing power.The most important feature of Quandoop when compared to previous simulators is to provide a low cost solution for simulations of quantum walks with extreme memory requirements.Examples of such simulations include quantum walks on fractals or with multiple interacting walkers.Quandoop uses Apache Hadoop to parallelize the calculations on a computer cluster, thus reducing the amount of time required to perform the quantum walk simulation and allowing its execution with more steps.Our simulator takes the input as text files containing the initial state, the evolution operators and the description of simulation parameters.This approach allows the integration with other quantum walk simulators such as HiPerWalk or QWalk.After running the necessary calculations in parallel, Quandoop outputs text files describing the results associated to the quantum walk.
Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for example in scene matching, video indexing, chemical similarity and shape analysis. In this paper, a novel algorithm Qwalk is proposed for approximate MCS, utilizing the discrete-time quantum walk. Based on the new observation that isomorphic neighborhood group matches can be detected quickly and conveniently by the destructive interference of a quantum walk, the new algorithm locates an approximate solution via merging neighborhood groups. Experiments show that Qwalk has better accuracy, universality and robustness compared with the state-of-the-art approximate MCS methods. Meanwhile, Qwalk is a general algorithm to solve the MCS problem approximately while having modest time complexity.
Several research groups are giving special attention to quantum walks recently, because this research area have been used with success in the development of new efficient quantum algorithms. A general simulator of quantum walks is very important for the development of this area, since it allows the researchers to focus on the mathematical and physical aspects of the research instead of deviating the efforts to the implementation of specific numerical simulations. In this paper we present QWalk, a quantum walk simulator for one- and two-dimensional lattices. Finite two-dimensional lattices with generic topologies can be used. Decoherence can be simulated by performing measurements or by breaking links of the lattice. We use examples to explain the usage of the software and to show some recent results of the literature that are easily reproduced by the simulator.Program title: QWalkCatalogue identifier: AEAX_v1_0Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEAX_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GNU General Public LicenceNo. of lines in distributed program, including test data, etc.: 10 010No. of bytes in distributed program, including test data, etc.: 172 064Distribution format: tar.gzProgramming language: CComputer: Any computer with a C compiler that accepts ISO C99 complex arithmetic (recent versions of GCC, for instance). Pre-compiled Windows versions are also providedOperating system: The software should run in any operating system with a recent C compiler. Successful tests were performed in Linux and WindowsRAM: Less than 10 MB were required for a two-dimensional lattice of size 201×201. About 400 MB, for a two-dimensional lattice of size 1601×1601Classification: 16.5Nature of problem: Classical simulation of discrete quantum walks in one- and two-dimensional lattices.Solution method: Iterative approach without explicit representation of evolution operator.Restrictions: The available amount of RAM memory imposes a limit on the size of the simulations.Unusual features: The software provides an easy way of simulating decoherence through detectors or random broken links. In the two-dimensional simulations it also allows the definition of permanent broken links, besides calculation of total variation distance (from the uniform and from an approximate stationary distribution) and the choice between two different physical lattices. It also provides an easy way of performing measurements on specific sites of the 2D lattice and the analysis of observation screens. In one-dimensional simulations it allows the choice between three different lattices. Both one- and two-dimensional simulations facilitates the generation of graphics by automatically generating gnuplot scrips.Additional comments:•An earlier version of QWalk was first presented in [1].•The simulator generates gnuplot scripts that can be used to make graphics of the output data.•Several examples of input files are provided.Running time: The simulation of 100 steps for a two-dimensional lattice of size 201×201 took less than 2 seconds on a Pentium IV 2.6 GHz with 512 MB of RAM memory, 512 KB of cache memory and under Linux. It also took about 15 minutes for a lattice of size 1601×1601 on the same computer. Optimization option -O2 was used during compilation for these tests.References: [1] F.L. Marquezino, R. Portugal, QWalk: Simulador de caminhadas quânticas, in: Proceedings of 2nd WECIQ, Campina Grande, Brazil, IQuanta, 2007, pp. 123–132.