Font Size: a A A

The Optimization Of Grover Quantum Search In Multiple Solutions Data Space Of Larger Than Available Quantum Bits

Posted on:2022-06-25Degree:MasterType:Thesis
Country:ChinaCandidate:Y ChenFull Text:PDF
GTID:2480306521464184Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
Quantum computing is a field of computer science based on the laws of quantum physics.With the advent of large-scale quantum computing,quantum algorithms have been shown to be more effective than classical algorithms in some specific problems,which makes quantum computing an attractive subject.As a classical quantum algorithm,Grover search algorithm has been proved to be faster than any classical search algorithm,and is often applied to database search,complex equation solving and other aspects.Based on quantum computing and mathematical theory,this paper studies Grover algorithm's search problem in large data set.The details are as follows:Grover algorithm can achieve time complexity of O(N1/2) for searching a solution in unsorted dataset.However,in many cases,the data space is a sparse space with multiple solutions,and the space is larger than the quantum bit space owned by the quantum computer,which makes it impossible to directly use Grover algorithm to search.For this kind of data space search problem,a direct solution is dividing the dataset into several subsets and apply Grover algorithm directly to each subset.However,the efficiency of Grover algorithm is not the highest in general.In this paper,according to the characteristics of Grover search efficiency,we optimize the Grover quantum search problem in multiple solutions data space of larger than available quantum bits,and propose two improved block search algorithms to improve the efficiency: 1)Grover block search method based on SQP algorithm.2)Grover algorithm search combines Bayesian theory in block search.Both of the two improved algorithms adjust the number of subsets to further improve the search efficiency,so that the above problems can be solved.Secondly,this paper provides a strict mathematical analysis of the performance of the algorithm and carries out quantitative MATALAB simulation experiments.In addition,we design the circuit diagram of Grover algorithm and the improved algorithm circuit diagram,conducts experimental simulation using IBM Quantum Experience,which is a Quantum experiment platform provided by IBM,to conduct experimental simulation and theoretical analysis,further proving the feasibility and reliability of this algorithm.
Keywords/Search Tags:Quantum Algorithms, Quantum search, Quantum computing, Grover algorithm, Bayesian Theory
PDF Full Text Request
Related items