Solve graph using quantum approach

[Desk3505]

The ultimate goal of this project is to use quantum graph solution.
However for now, a dijkstra algorithm is used to solve the graph and get the streamline segment.
Multiple problems stand in the way of the goal

• The matrix gets exponentially bigger by n³ ,because of 3D, before the conversion to hamiltonian, then completely explodes for quantum gates. Therefore it is necessary to find a way to reduce the matrix.

• Reducing the matrix will most likely induce a variety of other problems because of indexes

• Classical computer are extremely limited in simulation of Qubits ( 17, meaning total nbr of edges, or non-zero in matrix). Therefore, to
  test one may use the exact_sol to get something usable without simulation.

• There is a basic code to use quantum solution but is untested and will not work right away. In particular, in file qaoa_solver_qu_edge.py, the function find_longest_path_rap() return a binary path unusable in the streamline.

• Lasty, a connection to quantum computer must be ultimately established and coded.