Chinese Journal of Quantum Electronics, Volume. 37, Issue 2, 202(2020)
Deutsch-Jozsa algorithm realization based on IBM Q
Deutsch-Jozsa algorithm realizes the exponential acceleration of classical algorithm for the first time, and solves the Deutsch problem of n qubits. The algorithm establishes the basic idea of quantum algorithms, and the implementation of which embodies the characteristics of quantum superposition and parallelism. A comprehensive algorithm is proposed for the first time, which can automatically generate all eight truth tables and quantum circuits of two-bit Deutsch-Jozsa algorithm. A synthesis method is given further to judge the properties of f(x) by constructing quantum circuit when the corresponding circuit is unknown. Generally, to solve this problem, a typical classical algorithm needs to do 2n+1+1 times of judgement and the Deutsch-Jozsa algorithm only needs one time. Although the new approach requires two steps to solve the problem, it provides another possible way to solve the problems with specific requirements in practical application. In addition, the correctness of the quantum circuits and Deutsch-Jozsa algorithm is verified by IBM Q Experience platform.
Get Citation
Copy Citation Text
DAI Juan, LI Zhiqiang, PAN Suhan, ZHANG Wei, HU Jiajia. Deutsch-Jozsa algorithm realization based on IBM Q[J]. Chinese Journal of Quantum Electronics, 2020, 37(2): 202
Category:
Received: Jun. 25, 2019
Accepted: --
Published Online: Apr. 3, 2020
The Author Email: Juan DAI (yzdxdaij@163.com)