Contributions

Welcome to the contribution space of the Quantum OR – EURO working group.
Here you will find a selection of recently defended theses, key scientific publications in the field, and information about upcoming sessions and events.
Help us enrich this resource by sharing your work or submitting new references.

🎓 Completed and on going Phd theses.

📚 Papers Publication.

• 2025
• Samuel Deleplanque,Amina El Yaagoubi,Téo Gras,Florent Descamps,Julia Mourrier & Isabelle Lefebvre., Analog quantum computing for Max-Cut and CVRP, Int. J. Systems Science. DOI
• S. Creemers, Speeding up Grover’s algorithm, Eur. J. OR. DOI
• S. Creemers & L.F. Pérez Armas, Discrete optimization: A quantum revolution?, Eur. J. OR. DOI
• Lucas Leclerc, Constantin Dalyac, Pascale Bendotti, Rodolphe Griset, Joseph Mikael, and Loic Henriet., Smart charging optimization, Phys. Rev. A, vol. 111(3), 2025. DOI
• 2024
• Bourreau E, Fleury G and Lacomme P. IQAOA for Two Routing Problems: A Methodological. Contribution with Application to TSP and VRP. Journal of Quantum Computing. 6, 25-51. 2024. DOI
• L.F. Pérez Armas, S. Creemers and S Deleplanque ., Resource constrained project scheduling with quantum annealing, Sci Rep 14, 2024. DOI
• Constantin Dalyac, Lucas Leclerc, ,Louis Vignoli, ,Mehdi Djellabi, Wesley da Silva Coelho, Bruno Ximenez, Alexandre Dareau, Davide Dreon, Vincent E. Elfving, Adrien Signoles, Louis-Paul Henry & Loïc Henriet., Graph algorithms with neutral atoms, Eur. Phys. J. A, vol. 60(9), 2024. DOI
• M. Yassine Naghmouchi; Joseph Vovrosh; Wesley Da Silva Coelho and Alexandre Dauphin, Quantum Systems Emulation, CoDIT 2024. DOI
• Grange, C., Poss, M., Bourreau, E., T’kindt, V. and Ploton, O., Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems, Eur. J. Oper. Res. 320(3), pp. 516–526, 2025. DOI
• Grange, C., Poss, M. and Bourreau, E., An introduction to variational quantum algorithms for combinatorial optimization problems, Ann. Oper. Res. 343(2), pp. 847–884, 2024. DOI
• Chatterjee, Y., Bourreau, E. and Rančić, M.J., Solving various NP-hard problems using exponentially fewer qubits on a quantum computer, Phys. Rev. A 109(5), 052441, 2024. DOI
• 2023
• E. Bourreau , G. Fleury and P Lacomme., Adiabatic based Algorithm for SAT, Physica A. DOI
• Constantin Dalyac, Louis-Paul Henry, Minhyuk Kim, Jaewook Ahn, and Loïc Henriet , Maximum Independent Set with locality, Phys. Rev. A, vol. 108(5), 2023. DOI
• W. Coelho, L. Henriet, L.-P. Henry, Quantum pricing-based column generation, Phys. Rev. A, vol. 107(3), 2023. DOI
• Lucas Leclerc, Luis Ortiz-Gutiérrez, Sebastián Grijalva, Boris Albrecht, Julia R. K. Cline, Vincent E. Elfving, Adrien Signoles, Loïc Henriet, Gianni Del Bimbo, et al., Financial risk management on neutral atom processors, Phys. Rev. Research, vol. 5(4), 2023. DOI
• 2022
• G. Fleury and P. Lacomme, A Technical Note for a Shor’s Algorithm, J. Quantum Computing. DOI
• 2021
• Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel, Wolfgang Lechner, Simon Perdrix, Marc Porcheron and Margarita Veshchezerova, Smart-charging case study, EPJ Quantum Technology, vol. 8(1), 2021. DOI

📚 Preprints & submitted papers.

• 2024
• Eric Bourreau and Gerard Fleury and Phlippe Lacomme. Indirect Job-Shop coding using rank: application to QAOA (IQAOA). 2024. arXiv:2402.18280v1
• Gerard Fleury, Philippe Lacomme. A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach. 2024. arXiv:2402.00065v1
• Bochkarev, A., Heese, R., Jäger, S., Schiewe, P., Schöbel, A., Quantum computing for discrete optimization: a highlight of three technologies, arXiv:2409.01373 [quant-ph]. https://arxiv.org/abs/2409.01373, Contact
• Röhrs, M., Bochkarev, A., Medina, A.C., Bayesian optimisation with improved information sharing for the variational quantum eigensolver,[quant-ph]. https://arxiv.org/abs/2405.14353
• 2023
• Eric Bourreau and Gerard Fleury and Philippe Lacomme. Indirect Quantum Approximate Optimization Algorithms: application to the TSP. 2023. arXiv:2311.03294v1
• Gerard Fleury, Philippe Lacomme. Mathematical Foundations of Quantum Computing for Computer Science Researchers. 2023. arXiv:2303.01938v1.
• Eric Bourreau, Gérard Fleury, Philippe Lacomme. Adiabatic based Algorithm for SAT: A comprehensive algorithmic description. Journal Physica A: Statistical Mechanics and its Applications. Vol. 669. 2023. https://doi.org/10.1016/j.physa.2023.129206
• 2022
• G. Fleury and P. Lacomme A Technical Note for a Shor’s Algorithm by Phase Estimation. Journal of Quantum Computing. 4(2), 97-111. 2022. https://doi.org/10.32604/jqc.2022.032973
• Gerard Fleury, Philippe Lacomme. Description of the Grover algorithm based on geometric considerations. 2022. arXiv:2210.16809v2
• Eric Bourreau and Gerard Fleury and Phlippe Lacomme. Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations. 2022. arXiv:2207.11520v1
• Eric Bourreau and Gerard Fleury and Phlippe Lacomme. Adiabatic based Algorithm for SAT: a comprehensive algorithmic description. 2022. arXiv:2207.09984v2

📚 Books and Educational resources.

• Philippe Lacomme, Gérard Fleury. Les algorithmes de base de l’informatique quantique – Tome 2: Grover, Shor et métaheuristiques quantiques. Eyrolles; 2e édition. 2023.
• Eric Bourreau, Philippe Lacomme, Gérard Fleury. Introduction à l’Informatique Quantique. Eyrolles. 2022.

Scientific events and communication.