Integer decomposition optimization method and system based on Grover quantum computing search algorithm

Abstract

The invention belongs to the technical field of quantum computing, and particularly relates to an integer decomposition optimization method and system based on a Grover quantum computing search algorithm. The method comprises the following steps: simulating a quantum bit line, and enabling an input ground state to be converted into a superposed state through Hadamard transformation; converting aninteger decomposition problem into an optimization problem, expressing integers to be decomposed and prime factors of the integers by using a binary system, and constructing a binary multiplication table; obtaining a binary multiplication equation set according to the binary multiplication table, and simplifying the equation set by introducing constraint conditions; setting iteration conditions, converting the simplified equation into a Boolean logic relationship, and constructing a quantum black box; reversing the target state amplitude relative to the average amplitude by using the unitary matrix, and increasing the probability of searching the target item; and changing the probability of searching the target item through repeated iteration until the probability of searching the target item is optimal. A good calculation effect can be achieved, an acceleration effect is particularly obvious in a large-scale search problem, and the method and the system have a good application value.

Description

technical field [0001] The invention belongs to the technical field of quantum computing, in particular to an integer decomposition optimization method and system based on a Grover quantum computing search algorithm. Background technique [0002] Quantum computing relies on the quantum phenomena of entanglement and superposition to perform operations, and one of the most fundamental problems in computer science is unstructured search. The Grover quantum search algorithm is designed for unstructured search problems. The Grover quantum search algorithm can be used to solve problems such as graph coloring and shortest path sorting, and can also effectively decipher cryptosystems. The Grover quantum search algorithm mainly transforms the probability amplitude of the quantum ground state, so that the probability amplitude of the quantum ground state corresponding to the query target item reaches the maximum. . For a complete quantum circuit of Grover's algorithm, it covers the ...

AI Technical Summary

Problems solved by technology

[0003] To this end, the present invention provides an integer decomposition optimization method and system based on Grover's quantum computing search algorithm, which solves the problems of large number of qubits required for integer decomposition, deep quantum circuit depth, and high requirements for quantum computer hardware, and can further improve its performance. Calculation acceleration effects and application scenarios

Images