Research of Quantum Algorithm Based on IBM Q Platform

WEI Jia,NI Ming,ZHOU Ming,JIANG Wenbing

Published Dec 1, 2018• 1 citation

Abstract

To explore the implementation status of multi-bit quantum algorithm in quantum chips and simulators,Grover search algorithm,quantum random walk algorithm and quantum Fourier transform algorithm are run on IBM quantum chips and simulators respectively.For 2 bit Grover search algorithm and 2 bit quantum random walk algorithm,the influence of measurement times on operation results is analyzed and the maximum number of simulation times is selected to compare the operation results of quantum chip and simulator.A 5 bit quantum Fourier transform algorithm and a 3 bit Grover search algorithm are designed and run,and the IBM Q simulator is used to simulate the maximum number of times respectively.Experimental results show that the quantum chip test results are not optimized with the increase of the number of measurements,and the accuracy of the simulation results is obviously better than that of the quantum chip.

DOI: 10.19678/j.issn.1000-3428.0051857

Related papers

Implementation Grover’s search algorithm on IBM Eagle r3

Hong Luu Thu, Ninh Nguyen Duy

Nowadays, quantum computing has emerged as a global technology trend, attracting active research worldwide. One of the most popular quantum algorithms is the quantum search algorithm, commonly known as Grover's algorithm, for unstructured search purposes. This paper presents the implementation of the algorithm with a search space of 3 to 10 qubits using the Python-based Qiskit tool developed by IBM. The implementation results on the IBM QSAM simulator and on the IBM Eagle r3 quantum hardware are analyzed and compared. This paper also provides results with circuits of varying iteration numbers. Finally, the paper discusses the advantages of this quantum search algorithm compared to traditional methods, and the obstacles towards realizing its hardware implementation.

Journal of Military Science and TechnologyNov 25, 20240 citations

4-qubit Grover's algorithm implemented for the ibmqx5 architecture

Philip Strömberg, Vera Blomkvist Karlsson

Quantum computing is a quickly growing field of research thanks to recent hardware advances. The quantum mechanical properties of quantum computers allow them to solve certain families of problems faster than classical computers. A quantum algorithm solving such a problem is Grover's algorithm, which finds an element in an unordered set faster than any classical search algorithm. In this paper an implementation of a 4-qubit Grover's algorithm for the IBM Q computer ibmqx5 is presented. Executing the implementation on an ibmqx5 simulator yield results in line with the theoretically optimal results. The accuracy of the ibmqx5 simulation results compared to the ibmqx5 execution results suggests that current hardware is not yet suitable,due to required complexity of the circuits for a 4-qubit Grover implementation.

Jan 1, 20188 citations

Circuit Simulation and Optimization of Quantum Search Algorithm

Xiaonan Liu, Chenyan Zhao, Haoshan Xie +1 more

At present, the scale of quantum computers in the real sense is still small, and quantum simulation has become one of the important ways of quantum theory research, grover quantum search algorithm is suitable for the search problem of disordered database. Firstly, according to the implementation principle of Grover algorithm and Boolean logic relationship, the design idea of multi-objective Oracle is analyzed, based on IBMQ quantum cloud platform, the quantum circuit of Grover algorithm with multi-objective items is simulated. Based on the characteristics of Grover algorithm and the simulation process of quantum gate, the action of multiple identical quantum gates is combined to reduce the update times of probability amplitude and improve the simulation efficiency. The libquantum quantum simulator is used for experiments and the target item is successfully searched, which proves the feasibility of the optimization method and provides reference for the simulation and optimization of other quantum algorithms.

International Conference on Electronic Information Technology and Computer Engineering (EITCE)Oct 21, 20221 citation

Implementing Grover’s Algorithm on the IBM Quantum Computers

Aamir Mandviwalla, Keita Ohshiro, Bo Ji

This paper focuses on testing the current viability of using quantum computers for the processing of data-driven tasks fueled by emerging data science applications. We test the publicly available IBM quantum computers using Grover's algorithm, a well-known quantum search algorithm, to obtain a baseline for the general evaluations of these quantum devices and to investigate the impacts of various factors such as number of quantum bits (or qubits), qubit choice, and device choice. The main contributions of this paper include a new 4-qubit implementation of Grover's algorithm and test results showing the current capabilities of quantum computers. Our study indicates that quantum computers can currently only be used accurately for solving simple problems with very small amounts of data. There are also notable differences between different selections of the qubits in the implementation design and between different quantum devices that execute the algorithm.

IEEE International Conference on Big Data (BigData)Dec 1, 2018107 citations

The performance impact of the graph topology in Ibm’s Quantum devices on Grover’s search algorithm

Adrian Prodan, Vasile Manta, Alexandru Tudorache

In the context of actual information technology, data processing and storage have increased exponentially. Searching through large databases is considered an important problem, with multiple applications, where the properties of quantum computing could be used to find a potential solution. In this paper, the authors present an implementation for Grover’s search algorithm, a fast quantum algorithm for database search, and analyze the results for various graph topologies used in some of the real quantum devices provided by IBM. The algorithm provides a quadratic speedup over its classical counterpart (linear complexity). The code used in the implementation is possible with the help of the Qiskit framework and IBM Q Experience platform. Multiple tests with their results are presented. The experiments include three implementations of Grover’s search algorithm for different input register sizes: 2, 3 and 4 qubits, and exploration of multiple running configurations. We focus on the performance impact of selecting different groups of qubits on various real quantum devices, such as the probability to find the desired state and the execution time. For each experiment, we present the motivation, the results and their analysis.

International Conference on System Theory, Control and Computing (ICSTCC)Oct 20, 20211 citation

EVALUATION OF A PHYSICAL QUANTUM COMPUTER

John A. Heropoulos

In the past few years, IBM has expanded their Quantum Experience to include a high-level Python module called Qiskit as well as a 15-qubit machine (ibmq_16_melbourne). In order to evaluate IBM’s progress, we create an overview of the processes involved in developing and running an algorithm on IBM’s quantum machines. This includes exploring the new resources that IBM has made available recently including the Qiskit Python module. Then, we test textbook algorithms such as the Deutsch-Jozsa algorithm, Grover’s search algorithm, and Quantum Fourier Transform on ibmq_16_melbourne and compare the results with the output of a simulator. Constraints imposed by IBM’s Quantum Experience and significant differences between algorithm performance on IBM's quantum hardware and the simulator will be used to assess IBM’s quantum computing capabilities.

Jun 1, 20200 citations