Quantum Processing Framework And Hybrid Algorithms For Routing Problems

The theory of quantum complexity determines when quantum computers may offer a computational speed-up over classical computers. At present, there are only a few general well-known techniques in the field of quantum computing and finding the problems that are amenable to quantum speedups is a high priority. Nonetheless, efficient quantum algorithms are very limited in number and scope; no real breakthrough has yet been achieved in physical implementations. Most importantly, these algorithms are not still matured adequately to be applied in real quantum computations. The Quantum Processing Unit (QPU) is the processor of quantum computer that is able to do quantum computations. A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). The focus of this study is developing a framework of QAPU and hybrid architecture for classical-quantum algorithms. The framework is used to increase the implementation performance of quantum algorithms. The framework shows a general plan for the architecture of quantum processor which is capable to run the quantum algorithms. In particular, QAPU can be used as a quantum node to design a quantum multicomputer. A uniform platform was proposed for the QAPU used in the present study. At first, the hybrid architecture was designed for the quantum algorithms. Then, the relationship between classical and quantum parts of the hybrid algorithms were extracted and the main stages of the hybrid algorithm were determined. Next, the framework of QAPU was designed and developed. For this purpose, some gates and connections were projected in the framework which could be applied for future quantum algorithms. Furthermore, the framework was set up, implemented and simulated for the existing quantum algorithms on a classic computer. The results were shown that the framework is appropriate for the quantum algorithms and had been mathematically proven. Moreover, a quantum algorithm was designed to solve the shortest paths problem between the two points in a network. Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. These quantum algorithms can be applied to solve routing problem in the quantum networks and the quantum multicomputer. The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. Implementing and simulating results are then represented based on the probabilistic hybrid algorithm in the case of linear array, binary heap and quantum search for dense and sparse graphs.

Preview PDF FSKTM_2010_5A.pdf Download (395kB)

Actions (login required)

View Item