Table of Content

Open Access iconOpen Access


A Memory-efficient Simulation Method of Grover's Search Algorithm

Xuwei Tang1, Juan Xu1,2,3,*, Bojia Duan1

College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China.
Institute for Quantum Computing, University of Waterloo, Canada.
Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, China.

* Corresponding Author: Juan Xu. Email: email.

Computers, Materials & Continua 2018, 57(2), 307-319.


Grover's search algorithm is one of the most significant quantum algorithms, which can obtain quadratic speedup of the extensive search problems. Since Grover's search algorithm cannot be implemented on a real quantum computer at present, its quantum simulation is regarded as an effective method to study the search performance. When simulating the Grover's algorithm, the storage space required is exponential, which makes it difficult to simulate the high-qubit Grover's algorithm. To this end, we deeply study the storage problem of probability amplitude, which is the core of the Grover simulation algorithm. We propose a novel memory-efficient method via amplitudes compression, and validate the effectiveness of the method by theoretical analysis and simulation experimentation. The results demonstrate that our compressed simulation search algorithm can help to save nearly 87.5% of the storage space than the uncompressed one. Thus under the same hardware conditions, our method can dramatically reduce the required computing nodes, and at the same time, it can simulate at least 3 qubits more than the uncompressed one. Particularly, our memory-efficient simulation method can also be used to simulate other quantum algorithms to effectively reduce the storage costs required in simulation.


Cite This Article

X. Tang, J. Xu and B. Duan, "A memory-efficient simulation method of grover's search algorithm," Computers, Materials & Continua, vol. 57, no.2, pp. 307–319, 2018.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2905


  • 1368


  • 0


Related articles

Share Link