This repository refers to the final work of the discipline: Introduction to Quantum Computing, PESC / COPPE / UFRJ CPS748, taught by Professor Franklin Marquezino during the second quarter of 2019.
Students:
Implementation based on article:
Quantum-Inspired Tabu Search Algorithm for Solving 0/1 Knapsack Problems
The purpose of this repository is to evaluate the performance of a quantum-inspired algorithm applied to the Knapsack Problem 0/1, meaning each element may or may not be in the solution, without repetition. The ideas in the implementation present in this repository can serve as a basis for different algorithms and problems that can gain with this approach.
The code were written in a Jupyter Notebook using Python 3 and are available in the qts-knapsack-problem.ipynb file.
In the data directory you can find some problems that can be executed by the algorithm.