Xuwei Tang1, Juan Xu1,2,3,*, Bojia Duan1
CMC-Computers, Materials & Continua, Vol.57, No.2, pp. 307-319, 2018, DOI:10.32604/cmc.2018.03693
Abstract 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,… More >
Login
Register
