About this event
Hybrid Quantum-Classical Approaches to Graph Optimization
Join Fondazione Links and Pasqal for an insightful webinar exploring pioneering solutions to graph optimization problems.
We will present a novel hybrid branch-and-price algorithm that leverages the unique capabilities of Neutral Atom quantum processors, integrated with classical computing resources. This innovative approach offers a new perspective on tackling NP-hard graph coloring challenges, with potential implications for logistics, scheduling, and network design.
What You can expect
Hosted by Lucia Garbini (Community Builder, Pasqal), the session features Chiara Vercellino (Expert Researcher at Fondazione Links) and Yassine Naghmouchi (Senior Quantum Algorithm Developer at Pasqal) who will provide:
- An overview of graph coloring problems and their real-world relevance.
- A deep dive into the technical foundations of a novel quantum-enhanced approach.
- Insights into potential use cases and the growing impact of quantum-enhanced optimization.
Hosted by
-
Team member
Lucia Garbini Community Builder @ PasqalT
-
Guest speaker
Yassine Naghmouchi Sr. Quantum Algorithm Developer @ PasqalG
Yassine Naghmouchi is Senior Quantum Algorithm Developer at Pasqal, designing hybrid quantum-classical combinatorial optimization solvers and supporting both internal R&D initiatives and client-driven quantum optimization projects. He earned his PhD in Computer Science from Paris Dauphine University, in operations research.
-
Guest speaker
Chiara Vercellino Expert Researcher @ Fondazione LinksG
Chiara Vercellino holds an MSc in Mathematical Engineering and is currently a PhD student in Computer Engineering at Politecnico di Torino. She works as an expert researcher at Fondazione Links in the CPE area, focusing on optimization and machine learning for quantum computing applications.
Pasqal
Quantum computing is already transforming the world we live in. Seizing the innovative momentum of technology is a crucial opportunity for businesses and people everywhere.
