Affiliation:
1. Departamento de Física Teórica Universidad Complutense de Madrid Madrid 28040 Spain
2. CCS‐Center for Computational Simulation Universidad Politécnica de Madrid Boadilla del Monte Madrid 28660 Spain
Abstract
AbstractSzegedy's quantum walk is an algorithm for quantizing a general Markov chain. It has plenty of applications, such as many variants of optimizations. In order to check its properties in an error‐free environment, it is important to have a classical simulator. However, the current simulation algorithms require a great deal of memory due to the particular formulation of this quantum walk. In this paper, a memory‐saving algorithm is proposed that scales as with the size of the graph. Additional procedures are provided for simulating Szegedy's quantum walk over mixed states and also the Semiclassical Szegedy walk. With these techniques, a classical simulator in Python called SQUWALS (Szegedy QUantum WALks Simulator) has been built. It is shown that the simulator scales as in both time and memory resources. This package provides some high‐level applications for algorithms based on Szegedy's quantum walk, as for example the quantum PageRank.
Funder
Comunidad de Madrid
Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España
Army Research Office
Fundación Banco Santander
Reference29 articles.
1. Quantum random walks
2. Quantum computation and decision trees
3. A. M.Childs R.Cleve E.Deotto E.Farhi S.Gutmann D. A.Spielman inProceedings of the thirty‐fifth annual ACM symposium on Theory of computing Association for Computing Machinery New York NY United States2003 pp.59–68.
4. Electric-Circuit Realization of Fast Quantum Search
5. Electric‐Circuit Simulation of Quantum Fast Hitting with Exponential Speedup