Hybrid Classical–Quantum Branch-and-Bound Algorithm for Solving Integer Linear Problems

Quantum annealers are suited to solve several logistic optimization problems expressed in the QUBO formulation. However, the solutions proposed by the quantum annealers are generally not optimal, as thermal noise and other disturbing effects arise when the number of qubits involved in the calculatio...

Full description

Saved in:

Bibliographic Details
Published in:	Entropy (Basel, Switzerland) Vol. 26; no. 4; p. 345
Main Authors:	Sanavio, Claudio, Tignone, Edoardo, Ercolessi, Elisa
Format:	Journal Article
Language:	English
Published:	Switzerland MDPI AG 01.04.2024
Subjects:	Algorithms Annealing binary linear problem branch and bound Hardware Knapsack problem Management science Optimization quantum annealing Quantum computing Qubits (quantum computing) Thermal noise Traveling salesman problem Variables branch and bound knapsack problem traveling salesman problem quantum annealing binary linear problem
ISSN:	1099-4300, 1099-4300
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!