Quantum Project Submission of team; Do Bhai Dono Tabahi

[ojas8taori]

(best club head and technical head in pesu btw)
This PR introduces a Quantum Maze Solver, leveraging quantum computing principles to efficiently find the shortest path through a maze. The solver uses Grover’s algorithm to search for the optimal route, significantly reducing computational complexity compared to classical approaches.

Team members: Ojas Taori (email: ojas9taori@gmail.com github: @ojas8taori ) and Pratyush Bhatia (email: pratyushbhatia004@gmail.com github: @Pratonic)

The code is error free and requires the qiskit as well as qiskit-algorithms packages to be installed in order to execute.

The time complexity of the quantum approach with respect to a classical approach having O(n) is O(√n) where n is the sample space, hence it is a quadratic speed up.

On execution the program takes 10-15 seconds (depending on computational capabilities of the users machine) and outputs;

• The maze converted into an equivalent binary matrix.
• The most probable path represented in its equivalent binary value.
• The shortest path to solve the maze.
• The quantum circuit that the qubits progress through.

A sample, simple 4x4 matrix is used as an example since a matrix of any higher order will take massive amounts of computing power and long execution times.