The QWalk simulator of quantum walks

Marquezino, Franklin de Lima; Portugal, Renato

doi:10.1016/j.cpc.2008.02.019

Cited by 16 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The used software is a part of the Quantum Computing Simulator presented in [13]. A significant speedup of the simulations process comparing to previous paper [8] have been achieved. The used technologies enables to simulate effectively much more complex quantum walks then previously known.…”

Section: Conclusion and Further Workmentioning

confidence: 96%

See 1 more Smart Citation

GPGPU Based Simulations for One and Two Dimensional Quantum Walks

Sawerwain

Gielerak

2010

Computer Networks

View full text Add to dashboard Cite

Simulations of standard 1D and 2D quantum walks have been performed within Quantum Computer Simulator (QCS system) environment and with the use of GPU supported by CUDA technology. In particular, simulations of quantum walks may be seen as an appropriate benchmarks for testing calculational power of the processors used. It was demonstrated by a series of tests that the use of CUDA based technology radically increases the computational power compared to the standard CPU based computations.

show abstract

Section: Conclusion and Further Workmentioning

confidence: 96%

“…where j, k ∈ {0, 1}. After applying shift operator (8) to state (6) the evolution can be summarised in following way: where ⊕ represents addition modulo two. The algorithm to simulate two-dimensional quantum walks is directly basing on the evolution given by equation (10).…”

Section: The Algorithm For Simulating Quantum Walks On Gpgpumentioning

confidence: 99%

GPGPU Based Simulations for One and Two Dimensional Quantum Walks

Sawerwain

Gielerak

2010

Computer Networks

View full text Add to dashboard Cite

show abstract

“…Therefore, one might be interested in analyzing the dynamics of mutual information (Shannon and von Neumann) between the (joint) coin and position degrees of freedom, or between the coins of the two walkers, or finally between the two walkers. They are given by expressions analogous to (18) and (20).…”

Section: Noise and Decoherence: Broken Links And Different Coinsmentioning

confidence: 99%

“…Also, the tools for the numerical study of one particle quantum walks in one and two dimensions have been presented before (see Ref. [18], [19]). Yet, although the entanglement between the coin and the position degrees of freedom have been studied in detail both numerically and analytically (see for example Ref.…”

Section: Introductionmentioning

confidence: 99%

A simulator for discrete quantum walks on lattices

Rodrigues

Paunković

Mateus

2017

Int. J. Mod. Phys. C

View full text Add to dashboard Cite

In this paper, we present a simulator for two-particle quantum walks on the line and one-particle on a two-dimensional squared lattice. It can be used to investigate the equivalence between the two cases (one- and two-particle walks) for various boundary conditions (open, circular, reflecting, absorbing and their combinations). For the case of a single walker on a two-dimensional lattice, the simulator can also implement the Möbius strip. Furthermore, other topologies for the walker are also simulated by the proposed tool, like certain types of planar graphs with degree up to 4, by considering missing links over the lattice. The main purpose of the simulator is to study the genuinely quantum effects on the global properties of the two-particle joint probability distribution on the entanglement between the walkers/axis. For that purpose, the simulator is designed to compute various quantities such as: the entanglement and classical correlations, (classical and quantum) mutual information, the average distance between the two walkers, different hitting times and quantum discord. These quantities are of vital importance in designing possible algorithmic applications of quantum walks, namely in search, 3-SAT problems, etc. The simulator can also implement the static partial measurements of particle(s) positions and dynamic breaking of the links between certain nodes, both of which can be used to investigate the effects of decoherence on the walker(s). Finally, the simulator can be used to investigate the dynamic Anderson-like particle localization by varying the coin operators of certain nodes on the line/lattice. We also present some illustrative and relevant examples of one- and two-particle quantum walks in various scenarios. The tool was implemented in C and is available on-line at http://qwsim.weebly.com/ .

show abstract

“…Quandoop uses Apache Hadoop, a popular Big Data processing framework, 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. The most important feature of Quandoop when compared to previous simulators [7,8] is to provide a low cost solution for simulations of quantum walks with extreme memory requirements.…”

Section: Introductionmentioning

confidence: 99%

Quandoop: A Classical Simulator of Quantum Walks on Computer Clusters

Souza¹,

Marquezino²,

Lima³

2017

JCIS

View full text Add to dashboard Cite

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.

show abstract

The QWalk simulator of quantum walks

Cited by 16 publications

References 17 publications

GPGPU Based Simulations for One and Two Dimensional Quantum Walks

GPGPU Based Simulations for One and Two Dimensional Quantum Walks

A simulator for discrete quantum walks on lattices

Quandoop: A Classical Simulator of Quantum Walks on Computer Clusters

Contact Info

Product

Resources

About