Screening Test: Task 1 - for applicants of Track 1: Quantum Software

This repository contains the code for a screening test project.

What is the Screening Test?

💡 Develop a Python program to generate a list of 2n unique random positive integers, each using a maximum of n bits and represented in decimals, and another random positive integer, k, using n bits. Then, choose one (or more, if you prefer) of the following options to implement:

Check if k exists in the list.

• Find all integers less than k in the list.

• Display the results and the number of steps required to achieve them.

Prerequisites:

• Python 3.12.3
• qiskit 1.1.0
• qiskit_algorithms 0.3.0

Contributing:

If you'd like people to contribute to the test, outline any contribution guidelines (e.g., pull request process, coding style guide).

Additional Information:

I have been following these githubs to successfully build the Grover's searching algorithm:

• https://github.com/qiskit-community/qiskit-algorithms/blob/main/docs/tutorials/06_grover.ipynb
• https://github.com/qiskit-community/qiskit-algorithms/blob/main/docs/tutorials/07_grover_examples.ipynb