This project is the result of the 3-months QOSF mentorship progam.
The project is the exploration of the designs of Grover's algorithm (ancilla and non-ancilla qubits). Also, we have done complexity analysis of each design on different qubit-number designs to see how the complexity changes by increasing the number of qubits of the length code of the element to be searched for.
open the terminal
git clone https://github.com/moustafa-7/Grover-s-Algorithm-QOSF.git
cd Grover-s-Algorithm-QOSF
installing all dependencies
pip install -r requirements.txt
check the file src/Grover/main.ipynb to see examples and how to use
navigate to src/Grover and then run this command
python3 grover.py
-
Success probability of the ancilla design (length of string = 3)
-
Success probability of the noancilla design (length of string = 3)
-
length of input string VS Number of computations (u3 + cx gates) used
The project was done by:
under the supervision of Dr. Yuval Sanders.
Apache License 2.0
This project is licensed under the Apache License - see the LICENSE.md file for details