An Overview of Quantum Algorithms: Detailed Analysis of the Deutsch-Jozsa and Grover's Algorithms

Zhengjun Cao, Jeffrey K. Uhlmann, Lihua Liu

Shihao Zhang, Lvzhou Li

Charles Dyson

We develop the means to implement Deutsch's algorithm, the Deutsch-Jozsa algorithm and Grover's algorithm using electronic circuits, and review previous attempts to implement quantum algorithms classically. We attempt to demonstrate that these are not fundamentally quantum algorithms, but merely algorithms that scale exceptionally well on quantum computers. Finally, we discuss a prototype design for an electrical Hadamard gate and report experimental results.

Usha Rani J, Ganesan Anandhi

Seyed Massoud Amini

We give a short overview of quantum algorithms. Some famous algorithms such as Deutsch-Jozsa and Simon are covered with more details. The directions for further development are addressed,

Poornima Aradyamath, N. M. Naghabhushana, Rohitha Ujjinimatad

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.