Big data set searching method based on Grover algorithm and quantum computer

Abstract

The invention belongs to the technical field of quantum computing, and discloses a big data set search method based on a Grover algorithm and a quantum computer. The method comprpises steps of partitioning the data sets according to the capacity of a quantum processor, wherein the size of each data set is the maximum data volume capable of being processed by the processor at a time; taking the iteration frequency of each piece of data as an independent variable, and listing a total expected value equation of the iteration frequency when a solution is searched; listing constraint conditions ofa search problem, taking a total expected value equation as a target function, and solving an optimization equation; searching the corresponding data block according to the obtained iteration times ofeach piece of data; and comparing with a complete Grover algorithm to obtain the optimization rate of the optimization search algorithm. According to the method, the search frequency can be effectively reduced by searching a large data set, and the optimization rate can be improved by about 6% under the optimal condition. Under the condition of the same search success rate, the search frequency is reduced, and the influence generated by the error rate and the decoherence in the whole system can be counteracted.

Description

technical field [0001] The invention belongs to the technical field of quantum computing, in particular to a Grover algorithm-based large data set search method and a quantum computer. Background technique [0002] At present, quantum computing is based on quantum logic and uses quantum states for information processing. With the development of quantum computers, quantum algorithms based on quantum computers have been discovered, and its efficiency in solving some problems may far exceed that of classical algorithms, and it may even solve some problems that classical computers cannot solve. Grover's algorithm is a quantum search algorithm, which has been proved to be able to accelerate classical algorithms twice to solve problems more quickly. At present, most of the existing quantum algorithms that can effectively solve search problems are variants of Grover's algorithm. These improved algorithms of Grover's algorithm need to consume a large number of qubits for calculatio...

AI Technical Summary

Problems solved by technology

[0004] (1) The existing technology needs to consume a lot of qubits when solving the search problem on a large data set. When the size of the search space exceeds the limit of the qubit of the processor, the solution to the problem cannot be directly found

[0005] (2) Due to the decoherence of the quantum system, the more times the search algorithm is searched, the higher the error rate of the system. In the case of a large amount of data, the system may even be completely decoherent, resulting in the failure to complete the calculation.

Images