D. S. Souza, F. L. Marquezino and A. A. B. Lima
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.
quantum algorithms, quantum walks, simulation, highperformance computing, distributed computing, map/reduce
 Ambainis, A., SIAM Journal on Computing 37 (2007) 210
 Magniez, F., Santha, M., and Szegedy, M., SIAM Journal on Computing 37 (2007) 413.
 Farhi, E., Goldstone, J., and Gutmann, S., Theory of Computing 4 (2008) 169.
 Childs, A. M., Gosset, D., and Webb, Z., Science 339 (2013).
 Romanelli, A., Donangelo, R., Portugal, R., and Marquezino, F. d. L., Physical Review A 90 (2014) 022329.
 Ahlbrecht, A. et al., New Journal of Physics 14 (2012) 073050.
 Marquezino, F. and Portugal, R., Computer Physics Communications 179 (2008) 359.
 Lara, P., Leao, A., and Portugal, R., Simulation of quantum walks using HPC, in Proceedings of the 3rd Conference of Computational Interdisciplinary Sciences, pages 230–242, Asunci´on, Paraguay, 2014, Pan American Association of Computational Interdisciplinary Sciences.
 Aharonov, Y., Davidovich, L., and Zagury, N., Physical Review A 48 (1993) 1687.
 Farhi, E. and Gutmann, S., Phys. Rev. A 58 (1998) 915.
 Portugal, R., Physical Review A - Atomic, Molecular, and Optical Physics 93 (2016).
 Szegedy, M., Quantum speed-up of markov chain based algorithms, in Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on, pages 32–41, IEEE, 2004.
 Lee, K.-H., Lee, Y.-J., Choi, H., Chung, Y. D., and Moon, B., ACM Gropp, W., Lusk, E., and Skjellum, A., Using MPI: portable parallel programming with the message-passing interface, MIT press, Cambridge, MA, 1 edition, 1999. SIGMOD Record 40 (2011) 11.
 White, T., Hadoop: The definitive guide, O’Reilly Media, Inc., Massachusetts, 3 edition, 2012.
 Dean, J. and Ghemawat, S., Communications of the ACM 51 (2008) 107.
 Chapman, B., Jost, G., and Pas, R. V. D., Using OpenMP: portable shared memory parallel programming, MIT press, Cambridge, MA, 2008.
 Gropp, W., Lusk, E., and Skjellum, A., Using MPI: portable parallel programming with the message-passing interface, MIT press, Cambridge, MA, 1 edition, 1999.