Program for stream Quantum Computing Optimization

MA-42: Hybrid Classical-Quantum Algorithms
Stream: Quantum Computing Optimization
Room: 98 (building: 306)
Chair(s): Caroline Prodhon, Wesley Coelho

• Quantum pricing-based column-generation framework for hard combinatorial problems
  Wesley Coelho
• Mixed Integer Linear Programming Solver Using Benders Decomposition Assisted by Neutral Atom Quantum Processor
  Anna Joliot, Wesley Coelho, M. Yassine NAGHMOUCHI
• Application of quantum computing in securities transactions settlement framework
  Ekaterina Alekseeva, Nicolas Wolters
• Solving an MBDA's use case related to optimal assignment on current IBM Quantum Computers
  Edouard Debry, Davide Boschetto, Rachel Roux, Janis Aiad, Alexandre Kotenkoff

MB-42: Decomposition methods for Quantum Optimization
Stream: Quantum Computing Optimization
Room: 98 (building: 306)
Chair(s): Philippe LACOMME

• SAT resolution with an Indirect Quantum based approach
  Philippe LACOMME, Gérard Fleury
• A quantum search algorithm exploiting specific time windows structure. Application to production units planning problems.
  Rodolphe Griset
• Efficient Encoding for the Traveling Salesman Problem using Quantum Variational Algorithm
  Imran Meghazi, Eric Bourreau
• Solving Combinatorial Optimization Problems with Quantum Annealers
  Janez Povh
• Quantum annealing approach for scheduling a job shop with availability constraints
  Riad Aggoune, Samuel Deleplanque

MC-42: Quantum Computing for Discrete and Combinatorial Optimization
Stream: Quantum Computing Optimization
Room: 98 (building: 306)
Chair(s): Stefan Creemers

• Discrete Optimization: A Quantum Revolution?
  Stefan Creemers, Luis Perez
• Discrete optimization: Limitations of existing quantum algorithms
  Luis Perez, Stefan Creemers
• Analog Quantum Computing for Combinatorial Optimization Problems
  M. Yassine NAGHMOUCHI, Wesley Coelho

MD-42: Optimization in Quantum Information
Stream: Quantum Computing Optimization
Room: 98 (building: 306)
Chair(s): Gereon Koßmann

• Optimization of the Relative Entropy under linear constraints via semidefinite programming
  Rene Schwonnek
• From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
  Timo Ziegler, Gereon Koßmann
• Efficient Prediction of Quantum Ground State Properties via Classical Machine Learning with Geometric Locality
  Viet Tran
• de-Finetti Methods for Channel Coding Theory
  Gereon Koßmann

TA-42: Quantum Computing for Continuous Optimization
Stream: Quantum Computing Optimization
Room: 98 (building: 306)
Chair(s): Sander Gribling

• Solving quadratic binary optimization problems using quantum SDP methods: Non-asymptotic run-time analysis
  Fabian Henze, Viet Tran, Birte Ostermann, Richard Kueng, Timo de Wolff, David Gross
• Quantum speedups for linear programming via interior point methods
  Sander Gribling