New approach of solving Sudoku problems apart from the thesis

[Matrixmang0]

In this work, we have introduced a whole new approach to solve the Sudoku problem using Quantum Computer (Not yet, simulators until now).

I have well documented all the procudure in the InitilalWork notebook, although some complex steps lack detailed explanation.

4x4 Sudoku shows a promising output with width of about 18 qubits and depth of 81. But, for 9x9 Sudoku, the width sclaes to 83 qubits and the depth exponentiates to around 315K, which can can be split into 9 parts of 35K depth and run separately. Yeah this is still huge, but curently we are looking for some ideas or procedures to optimize wherever possible so to finally be able to run these circuits on the latest NISQ devices and look out for results.