Quantum Computing Concepts with Deutsch Jozsa Algorithm

• 出版年: JOIV: International Journal on Informatics Visualization
• 主要な著者: Poornima Aradyamath, Naghabhushana N M, Rohitha Ujjinimatad
• フォーマット: 論文
• 言語: 英語
• 出版事項: Politeknik Negeri Padang 2019-01-01
• 主題: quantum computer; quantum algorithms; qubit; quantum cryptography.
• オンライン･アクセス: http://joiv.org/index.php/joiv/article/view/218
• ISSN: 2549-9610; 2549-9904

In this paper, we briefly review the basic concepts of quantum computation,  entanglement,  quantum cryptography and quantum fourier  transform.   Quantum algorithms like Deutsch Jozsa, Shor’s   factorization and Grover’s data search are developed using fourier  transform  and quantum computation concepts to build quantum computers.  Researchers are finding a way to build quantum computer that works more efficiently than classical computer.  Among the  standard well known  algorithms  in the field of quantum computation  and communication we  describe  mathematically Deutsch Jozsa algorithm  in detail for  2  and 3 qubits.  Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.