GitHub - ShayManor/GroversLessThanK: Using Grover's algorithm and qiskit to create a function which returns all items of an unsorted array

ShayManor / GroversLessThanK Public

Using Grover's algorithm and qiskit to create a function which returns all items of an unsorted array < k in O(sqrt(n)) time.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
.idea		.idea
GroverReturn.py		GroverReturn.py
grover.py		grover.py
grover_less_than_k.ipynb		grover_less_than_k.ipynb
grover_less_than_k.py		grover_less_than_k.py
grovers.ipynb		grovers.ipynb
groversLessThanK.ipynb		groversLessThanK.ipynb
main.py		main.py
test_grovers_less_than_k.py		test_grovers_less_than_k.py