Currently, the Pasqal documentation lacks comprehensive guidance on solving combinatorial optimization problems, such as the Maximum Independent Set (MIS) problem, using Digital Analog simulation with Adiabatic Algorithm like VQAA. The MIS problem is a fundamental problem in graph theory with applications in various fields, including network design, social network analysis, and scheduling.
Feature Request:
I propose an enhancement to the Pasqal documentation to include detailed instructions, examples, and best practices for solving the MIS problem using the Digital Analog Adiabatic Algorithm. This addition will enable users to leverage Pasqal's quantum computing capabilities for solving combinatorial optimization problems efficiently.
For this I was thinking to work on a jupyter notebook but I am running into some errors
@lhenriet @cdalyac
Currently, the Pasqal documentation lacks comprehensive guidance on solving combinatorial optimization problems, such as the Maximum Independent Set (MIS) problem, using Digital Analog simulation with Adiabatic Algorithm like VQAA. The MIS problem is a fundamental problem in graph theory with applications in various fields, including network design, social network analysis, and scheduling.
Feature Request: I propose an enhancement to the Pasqal documentation to include detailed instructions, examples, and best practices for solving the MIS problem using the Digital Analog Adiabatic Algorithm. This addition will enable users to leverage Pasqal's quantum computing capabilities for solving combinatorial optimization problems efficiently. For this I was thinking to work on a jupyter notebook but I am running into some errors @lhenriet @cdalyac