Skip to content

Latest commit

 

History

History
46 lines (28 loc) · 2.19 KB

README.md

File metadata and controls

46 lines (28 loc) · 2.19 KB
Raw

Classical Simulation of Quantum Algorithms

About The Project

The aim of the project is to provide classical simulation of quantum algorithms of selected research papers. Simulations can be performed classically before quantum circuit implementation. It is also useful for those who want to understand the mechanics and behavior of a quantum algorithm through classical programming languages without thinking about quantum circuits and ket notations at first. Jupyter Notebooks can be used as sandboxes for your experiments and curious journey of quantum algorithms.

Note : The classical implementations will have exponential time and space complexity.

Google Colab

Use Google Colab to get started without any installations

Local Setup

Anconda Distribution for Python

Contents

  1. Grover's Algorithm
  2. Boyer's Exponential Search Algorithm
  3. Durr-Hoyer Modified Maximum Finding Algorithm

Selected Papers for Implementation

  1. Quantum Counting
  2. Quantum Phase Estimation Algorithm
  3. Shor's Algorithm

Contributing

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.

  1. Fork the Project
  2. Create your Feature Branch (git checkout -b feature/NewAlgorithm)
  3. Commit your Changes (git commit -m 'Add new Algorithm')
  4. Push to the Branch (git push origin feature/NewAlgorithm)
  5. Open a Pull Request

License

Distributed under the MIT License. See LICENSE for more information.

Contact

Siddhartha Chatterjee - [email protected] Project Link: https://github.com/sid1993/qbitwise