[{"command":"insert","method":null,"selector":".course-modal-ajax-placeholder-950867","data":"\u003Cdiv class=\u0022container content-rte\u0022\u003E\n  \u003Cdiv class=\u0022row\u0022\u003E\n    \u003Cdiv class=\u0022box col-md-6 bg-primary text-white\u0022\u003E\n      \u003Ch2 class=\u0022h1 text-left\u0022\u003E  [M1 DiPaQ] Optimisation combinatoire quantique\n\u003C\/h2\u003E\n                  \u003Cdiv class=\u0022field-spacing\u0022\u003E\n        \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EECTS :\n          3\n        \u003C\/div\u003E\n      \u003C\/div\u003E\n                  \u003Cdiv class=\u0022field-spacing\u0022\u003E\n        \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ESemestre calendaire :\n          Semestre 2\n        \u003C\/div\u003E\n      \u003C\/div\u003E\n            \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ED\u00e9tail du volume horaire\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                          \u003Cspan class=\u0022field__label h4 mt-5 \u0022\u003ECours magistraux :\u003C\/span\u003E\n                                      \u003Cspan\u003E10.5\u003C\/span\u003E\n                      \u003C\/div\u003E\n                                              \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                          \u003Cspan class=\u0022field__label h4 mt-5 \u0022\u003ETravaux dirig\u00e9s :\u003C\/span\u003E\n                                      \u003Cspan\u003E10.5\u003C\/span\u003E\n                      \u003C\/div\u003E\n                                                            \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ELangue d\u0026#039;enseignement\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003EAnglais\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EEnseignement \u00e0 distance\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003Enon\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n      \u003C\/div\u003E\n    \u003Cdiv class=\u0022box col-md-6\u0022\u003E\n            \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EPr\u00e9requis\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003E\u003Cstrong\u003EPrerequisites:\u003C\/strong\u003E\u003C\/p\u003E\n\u003Cul\u003E\n\u003Cli\u003EFamiliar with linear algebra\u003C\/li\u003E\n\u003Cli\u003EBasics of linear optimization\u003C\/li\u003E\n\u003Cli\u003EBasic of quantum computing\u003C\/li\u003E\n\u003C\/ul\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EProgramme \/ plan \/ contenus\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003E\u003Cstrong\u003ECourse program, plan, content:\u003C\/strong\u003E\u003C\/p\u003E\n\u003Cp\u003E\u003Cstrong\u003ETotal duration:\u003C\/strong\u003E\u0026nbsp;21 hours (7 sessions \u00d7 3 hours )\u003C\/p\u003E\n\u003Cul\u003E\n\u003Cli\u003E\u003Cstrong\u003ESession 1 (Lecture + Lab):\u003C\/strong\u003E Foundations of Combinatorial Optimization: Introduction to Combinatorial Optimization; Problem Formulation: Linear Programming, Integer Programming; Simplex Method: Formulation, Efficiency, Duality.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003ESession 2 (Lecture + Lab):\u003C\/strong\u003E Combinatorial optimization: Reformulations, Bounds, Lagrangian relaxation; Metaheuristics: Simulated annealing, Variable Neighborhood search.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003ESession 3 (Lecture + Lab): Dynamic Programming\u003C\/strong\u003E: Dynamic programming in combinatorial optimization; Application to knapsack and lot-sizing problems; Bellman\u2019s Principle.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003ESession 4 (Lecture + Lab): Introduction to Quantum Computing for Optimization:\u003C\/strong\u003E Basics of quantum computing (qubits, gates, superposition, entanglement); reformulation of combinatorial optimization problems into their quantum counterparts.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003ESession 5 (Lecture + Lab): Quantum Optimization Algorithms:\u003C\/strong\u003E Quantum Annealing: Applications in Combinatorial Optimization; Variational Quantum Algorithms (VQAs): QAOA for Optimization.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003ESession 6 (Lecture + Lab): Quantum linear programming:\u003C\/strong\u003E Introduction to Quantum Circuit Optimization, applications and implementations.\u003C\/li\u003E\n\u003C\/ul\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EObjectifs d\u0026#039;apprentissage\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003E\u003Cstrong\u003ELearning objectives:\u003C\/strong\u003E\u003C\/p\u003E\n\u003Cp\u003EAt the end of this course, students will be able to:\u003C\/p\u003E\n\u003Cul\u003E\n\u003Cli\u003EFormulate combinatorial problems and solve their relaxation by simplex algorithm.\u003C\/li\u003E\n\u003Cli\u003EUse dynamic programming and metaheuristic baselines to solve combinatorial optimization problems.\u003C\/li\u003E\n\u003Cli\u003EEncode combinatorial optimization problems as QUBO.\u003C\/li\u003E\n\u003Cli\u003EExplain and assess quantum linear programming approaches.\u003C\/li\u003E\n\u003C\/ul\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EOrganisation g\u00e9n\u00e9rale et modalit\u00e9s p\u00e9dagogiques\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003E\u003Cstrong\u003EGeneral course organization and teaching modalities:\u003C\/strong\u003E\u003C\/p\u003E\n\u003Cul\u003E\n\u003Cli\u003EThe course combines\u0026nbsp;\u003Cstrong\u003Electures\u003C\/strong\u003E\u0026nbsp;introducing theoretical concepts with\u0026nbsp;\u003Cstrong\u003Ehands-on algorithmic applications\u003C\/strong\u003E\u0026nbsp;that allow students to apply these concepts in practice.\u003C\/li\u003E\n\u003Cli\u003EEach 3-hour session blends approximately 50% lecture and 50% application exercises.\u003C\/li\u003E\n\u003Cli\u003EEvaluation is\u0026nbsp;\u003Cstrong\u003Econtinuous\u003C\/strong\u003E, based on\u0026nbsp;\u003Cstrong\u003Emultiple written exercises\u003C\/strong\u003E distributed throughout the course.\u003C\/li\u003E\n\u003C\/ul\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n                \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EComp\u00e9tences\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003E\u003Cstrong\u003ECompetencies gained in the course:\u003C\/strong\u003E\u003C\/p\u003E\n\u003Cp\u003EUpon successful completion, students will have acquired the following competencies:\u003C\/p\u003E\n\u003Cul\u003E\n\u003Cli\u003E\u003Cstrong\u003EProblem modeling:\u003C\/strong\u003E Translate real-world tasks into combinatorial formulations and QUBO encodings with correct constraint penalties.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003EAlgorithmic literacy:\u003C\/strong\u003E Understand complexity classes, relaxations (LP\/Lagrangian), and approximation guarantees for canonical problems.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003EClassical baselines:\u003C\/strong\u003E Design and implement dynamic programming and metaheuristics to benchmark quantum methods.\u003C\/li\u003E\n\u003Cli\u003E\u003Cstrong\u003EHybrid methods:\u003C\/strong\u003E Combine classical heuristics\/relaxations with quantum stages; justify integration choices and measure end-to-end gains.\u003C\/li\u003E\n\u003C\/ul\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003EBibliographie\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003E\u003Cp\u003E\u003Cstrong\u003EBibliography:\u003C\/strong\u003E\u003C\/p\u003E\n\u003Cul\u003E\n\u003Cli\u003EKorte, B., \u0026amp; Vygen, J. Combinatorial Optimization: Theory and Algorithms (6th ed., Springer, 2018).\u003C\/li\u003E\n\u003Cli\u003ENemhauser, G. L., \u0026amp; Wolsey, L. A. Integer and Combinatorial Optimization (Wiley, 1999).\u003C\/li\u003E\n\u003Cli\u003EBoyd, S., \u0026amp; Vandenberghe, L. Convex Optimization (Cambridge Univ. Press, 2004).\u003C\/li\u003E\n\u003Cli\u003ENielsen, M. A., \u0026amp; Chuang, I. L. Quantum Computation and Quantum Information (Cambridge Univ. Press, 2010\/2011).\u003C\/li\u003E\n\u003Cli\u003ERieffel, E. G., \u0026amp; Polak, W. H. Quantum Computing: A Gentle Introduction (MIT Press, 2011).\u003C\/li\u003E\n\u003C\/ul\u003E\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n        \u003Cdiv class=\u0022field-spacing\u0022\u003E\n      \u003Cdiv class=\u0022field__label h3 dash\u0022\u003ENature de l\u0026#039;\u00e9valuation\u003C\/div\u003E\n                        \u003Cdiv class=\u0022mt-5 text-justify\u0022\u003E\n                                      \u003Cspan\u003EEvaluation Continue non Int\u00e9grale\u003C\/span\u003E\n                      \u003C\/div\u003E\n                  \u003C\/div\u003E\n      \u003C\/div\u003E\n  \u003C\/div\u003E\n\u003C\/div\u003E\n","settings":null}]