Maximum independent set
The Maximum Independent Set (MIS) library provides a flexible, powerful, and user-friendly Python interface for solving Maximum Independent Set problem using Quantum technologies. It is designed for scientists and engineers working on optimization problems—no quantum computing knowledge required and no quantum computer needed for testing.
This library lets users treat the solver as a black box: feed in a graph, get back an optimal (or near-optimal) independent set. For more advanced users, it offers tools to fine-tune algorithmic strategies, leverage quantum hardware via the Pasqal cloud, or even experiment with custom quantum sequences and processing pipelines.
Users setting their first steps into quantum computing will learn how to implement the core algorithm in a few simple steps and run it using the Pasqal Neutral Atom QPU. More experienced users will find this library to provide the right environment to explore new ideas - both in terms of methodologies and data domain - while always interacting with a simple and intuitive QPU interface.
This library is actively used to solve real-world projects. We have applied it to optimize the layout and costs of 5G network deployments, schedule satellite missions with Thales, and improve charging network planning for electric vehicles with EDF. These case studies highlight how quantum-based MIS solutions can tackle complex challenges across telecom, aerospace and energy sectors.
For a more extensive overview of interesting classes of problems a quantum MIS solution is a good fit for, the reader is invited to peruse[^1].
Getting in touch
- Pasqal Community Portal (forums, chat, tutorials, examples, code library).
- GitHub Repository (source code, issue tracker).
- Professional Support (if you need tech support, custom licenses, a variant of this library optimized for your workload, your own QPU, remote access to a QPU, ...)
Contribute
The GitHub repository is open for contributions!
Don't forget to read the Contributor License Agreement.
References
[^1] P. Cazals et al. arXiv:2502.04291 (2025)