RT Journal Article
T1 Combinatorial Optimization with Quantum Computers.
A1 Chicano-García, José-Francisco
A1 Luque-Polo, Gabriel Jesús
A1 Dahi, Zakaria Abdelmoiz
A1 Gil-Merino, Rodrigo
K1 Computación cuántica
K1 Proceso de datos
AB Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one operator to the input, a quantum computer can apply the operator to a superposition of binary strings to provide a superposition of binary outputs, doing computation apparently in parallel. This feature allows quantum computers to speed up the computation compared to classical algorithms. Unsurprisingly, quantum algorithms have been proposed to solve optimization problems in quantum computers. Furthermore, a family of quantum machines called quantum annealers are specially designed to solve optimization problems. In this paper, we provide an introduction to quantum optimization from a practical point of view. We introduce the reader to the use of quantum annealers and quantum gate-based machines to solve optimization problems.
PB Taylor & Francis
YR 2025
FD 2025-01
LK https://hdl.handle.net/10630/38123
UL https://hdl.handle.net/10630/38123
LA eng
NO This tutorial is a preprint submitted to Engineering Optimization in July 2024. The accepted version can be found at https://doi.org/10.1080/0305215X.2024.2435538
NO https://openpolicyfinder.jisc.ac.uk/id/publication/5213
NO This research is partially funded by project PID 2020-116727RB-I00 (HUmove) funded by MCIN/AEI/ 10.13039/501100011033; TAILOR ICT-48 Network (No 952215) funded by EU Horizon 2020 research and innovation programme; Junta de Andalucia, Spain, under contract QUAL21 010UMA; and the University of Malaga (PAR 4/2023).
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 19 ene 2026