SaraM92 / The-K-clique-problem-on-a-quantum-computer

This repository contains the code files for the paper arXiv:2008.12525v1

Finding Small and Large k-Clique Instances on a Quantum Computer

This repository contains the code files for the paper arXiv:2008.12525v1

The paper discusses the practical implementation of the k-clique problem. The k-clique problem is a famous graph problem where a set of nodes are given, and the algorithm is asked to find cliques of size k in the graph.

We addressed the problem using Grover's algorithm with two different oracle implementations and certain symmetric states preparation such as W-states and Dicke-states.

This repository contains 6 Jupyternotbooks for the problem:

1. Oracle implementation 1 over the entire search space.
2. Oracle implementation 1 with W-state preparation to limit search space.
3. Oracle implementation 1 Dicke-state preparation to limit search space.
4. Oracle implementation 2 over the entire search space.
5. Oracle implementation 2 with W-state preparation to limit search space.
6. Oracle implementation 2 Dicke-state preparation to limit search space.

In order to run the code correctly, you will need to have installed a working version of Qiskit.

For questions and comments contact [e-mail].