Inspiration

The inspiration for this project comes from the fascinating world of quantum computing and its potential to revolutionize various fields, including cryptography, materials science, and optimization. Quantum phase estimation and Grover's algorithm are two fundamental quantum algorithms with profound implications. Quantum phase estimation allows us to efficiently approximate eigenvalues of unitary operators, which is crucial for many quantum applications. Grover's algorithm, on the other hand, is a powerful search algorithm that can find a marked item in an unsorted database with quadratic speedup over classical algorithms.

What it does

The project implements several key quantum algorithms:

Quantum Phase Estimation: This algorithm approximates the eigenvalue of a unitary operator using the quantum Fourier transform (QFT). It has applications in various areas, such as simulating quantum systems and solving linear equations.
Quantum Fourier Transform: The QFT is a fundamental quantum algorithm that decomposes a quantum state into a superposition of basis states with amplitudes proportional to the Fourier coefficients. It is essential for many quantum algorithms, including phase estimation and Shor's factoring algorithm.
True Random Coin Flip: The project generates true random coin flips using quantum states. Quantum randomness is fundamentally different from classical randomness, as it is based on the inherent uncertainty of quantum measurements.
Grover's Algorithm: This algorithm is used to search for a marked item in an unsorted database with quadratic speedup over classical search algorithms. It has applications in optimization, database search, and machine learning.

How we built it

The project was built using a quantum computing simulator or a real quantum hardware platform. The algorithms were implemented using quantum circuits, which consist of quantum gates that manipulate the qubits. The QFT was implemented using a series of Hadamard gates and controlled phase gates. Grover's algorithm was implemented using a combination of Hadamard gates, controlled phase gates, and the Grover diffusion operator.

Challenges we ran into

Some of the challenges encountered during the project include:

Understanding the mathematical concepts: Quantum mechanics can be complex, and understanding the underlying mathematical concepts is essential for implementing quantum algorithms correctly.
Debugging quantum circuits: Debugging quantum circuits can be challenging due to the inherent randomness of quantum measurements.
Limited availability of quantum hardware: Access to real quantum hardware can be limited, which can make it difficult to test and experiment with quantum algorithms.

Accomplishments that we're proud of

Successfully implementing quantum phase estimation and Grover's algorithm.
Generating true random coin flips using quantum states.
Gaining a deeper understanding of quantum computing concepts and algorithms.

What we learned

The power and potential of quantum computing.
The importance of understanding the underlying mathematical concepts.
The challenges and limitations of current quantum hardware.

What's next for Sahil Jayram Padwal

Explore other quantum algorithms and their applications.
Experiment with different quantum hardware platforms.
Contribute to the development of quantum computing software and tools.
Collaborate with researchers in other fields to explore potential applications of quantum computing.