Quantum computing for discrete optimization: a highlight of three technologies

DOI10.1016/J.EJOR.2025.07.063MaRDI QIDQ6852422zbMATH OpenFDO

Authors A. A. Bochkarev, Raoul Heese, Sven Jäger, Philine Schiewe, Anita Schöbel

Publication date 26 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.07.063

zbMATH Keywords

heuristicscombinatorial optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3910164 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1175955 (Why is no real title available?)
• A review on quantum approximate optimization algorithm and its variants
• An introduction to quantum computing, without the physics
• An introduction to variational quantum algorithms for combinatorial optimization problems
• Discrete optimization: a quantum revolution?
• Faster exact solution of sparse maxcut and QUBO problems
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
• Integer Programming Formulation of Traveling Salesman Problems
• Mathematical foundation of quantum annealing
• Minor embedding in broken chimera and derived graphs is NP-complete
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• On the Computational Complexity of Combinatorial Problems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computer Science
• Quantum annealing and related optimization methods
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• Quantum computation and quantum information. 10th anniversary edition
• Solution of a Large-Scale Traveling-Salesman Problem
• Synergies Between Operations Research and Quantum Information Science
• TSPLIB—A Traveling Salesman Problem Library
• The quadratic assignment problem
• The traveling salesman problem. A computational study.
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization
• Unit disk graph recognition is NP-hard
• Unit disk graphs

This page was built for publication: Quantum computing for discrete optimization: a highlight of three technologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852422)