Event date:
Jan 14 2022 2:30 pm

Quantum Search as Quantum Simulation

Supervisor
Dr Muhammad Faryad
Student
Imama Tul Birrah
Venue
SBASSE Building, 3rd Floor, Room No. 10-304
Event
MS Synopsis defense

Abstract:

Development of new quantum algorithms for quantum computing is at the interface of modern technology. Quantum algorithms can solve certain computationally intense problems in a comparatively reasonable duration for which the classic algorithms might take impossibly long time. Such quantum algorithms can lead to polynomial and in some cases even exponential speed ups. An important algorithm in this regard is a database search algorithm, proposed by Lov Grover providing a polynomial speed up. It can be derived as a quantum simulation algorithm. One of the major motivations behind developing quantum search as a quantum simulation is a precise insight into the development of a quantum algorithm design. The correctness of the quantum search algorithm is easily verified, but it is by no means obvious how one would dream up such an algorithm from a state of ignorance. So, via developing this algorithm we can sketch a heuristic means by which one can derive the quantum search algorithm, in the hope of lending some intuition as to the tricky task of quantum algorithm design. The basic procedure used is four-fold: (1) specify the problem to be solved, including a description of the desired input and output from the quantum algorithm; (2) guess a Hamiltonian to solve the problem, and verify that it does in fact work; (3) find a procedure to simulate the Hamiltonian; and (4) analyse the resource costs of the simulation. The circuit derived is run on simulator and quantum computer and the results are successfully verified against theoretically determined values.