Programme

P.69 -- Poster, VCTP-44

Date: Thursday, 1 August 2019

Time: 08:30 - 10:00

Performance of quantum algorithms on the IBM quantum computers

Tran Minh Duc, Nguyen Van Duy, Nguyen Quoc Hung

- Hanoi University of Science and Technology, 1 Dai Co Viet, Hai Ba Trung, Hanoi - Phenikaa Institute for Advanced Study, Phenikaa University, 167 Hoang Ngan, Cau Giay, Hanoi - Nano and Energy Center, Hanoi University of Science, VNU, 334 Nguyen Trai, Thanh Xuan, Hanoi

Quantum computation is an emerging technology with the perspective to outperform classical computation in many classes of problem. However, the inacessibility of a true quantum computer, for reason of both engineering and cost, had been staunching the development of the field for years. In 2016, IBM released the Quantum Experience, an online cloud service for public users to execute quantum algorithms. The quantum computation platform enables researchers and enthusiasts from all over the world to participate and develop the new paradigm of computation. In this work, we execute standard quantum algorithms, specifically Shor's and Grover's, on the IBM Q quantum computers. Shor's algorithm is a quantum algorithm that solves prime factorization - a procedure widely used in public-key cryptography, such as RSA. Employing the power of quantum parallelism to perform quantum Fourier transformation, it requires polynomial time, in comparison to sub-exponential time with a classical algorithm. Grover's algorithm is the foundation of quantum search, a method that could speed up processes such as looking for items in unstructured data. Both algorithm are prominent examples that promise significant improvements in providing solutions for complex computational problems.

Presenter: Nguyen Quoc Hung