Research On Quantum Circuit Algorithm Based On IBM Q Quantum Cloud Platform

Quantum computing uses quantum mechanical phenomena(such as superposition and entanglement)to perform calculations.Quantum computing is realized by quantum circuits Quantum circuits are based on qubits and quantum gates,and their calculations are done by using quantum logic gates to manipulate the qubits.Quantum computers can be implemented in theoretical or physical ways.Based on physical realization,researchers can access quantum simulators or real quantum computers.With the rapid development of quantum theory and technology in recent years,especially the emergence of some quantum cloud computing platforms,more and more researchers are not satisfied with the theoretical derivation and simulation verification of quantum computation(especially quantum algorithms).Experimental verification on real quantum devices has become a new trend.To study the functions of quantum circuits and solve practical application problems through quantum algorithms has become our main research content.The main research work and results are as follows1.Research on unitary matrix automatic generation algorithmWe do research on generating unitary matrices for quantum circuits automatically.We consider that quantum circuits are divided into six types,and the unitary operator expressions for each type are offered.Based on this,we propose an algorithm for computing the circuit unitary matrices in detail.Then,for quantum logic circuits composed of quantum logic gates,a faster method to compute unitary matrices of quantum circuits with truth table is introduced as a supplement.Finally,we apply the proposed algorithm to different reversible benchmark circuits based on NCT library(including NOT gate,Controlled-NOT gate,Toffoli gate)and generalized Toffoli(GT)library and provide our experimental results2.Research on two robotic manipulators' path planning problem based on Grover algorithmThe Grover search algorithm of quantum algorithm is introduced in detail and the solution of two manipulators'path planning problem is given.Grover's algorithm performs searching on a "black box",an unsorted dataset,in order to find an element that satisfies the Oracle.Classically,we would test each element at a time,until we hit the searched element.This takes an average of(N+1)/2 attempts and N in the worst case;therefore,the time complexity is O(N).Grover's search algorithm offers quadratic speedup compared to its classical counterparts with the complexity O((?)).In order to take advantage of the characteristics of Grover algorithm and solve the constraint satisfiability problem of unstructured data in limited search space,we apply Grover algorithm to solve practical problems and propose a new quantum algorithm for path planning of two cooperative robotic manipulators based on Grover search algorithm.An example is provided to explain our method.The process of building Grover Oracle is shown in detail and finally the optimal path sequences for two manipulators are found with the minimum cost.The method is implemented and simulated on IBM's Qiskit.The proposed method is more generalized and enlightening for the Traveling Salesman Problem and other related path problems.