Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms

Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation. Some problems of this class suitable for practical applications such as the traveling salesman problem (TSP), the bin...

Celý popis

Podrobná bibliografie

Vydáno v:	arXiv.org
Hlavní autoři:	Montanez-Barrera, Alejandro, Willsch, Dennis, Maldonado-Romo, Alberto, Michielsen, Kristel
Médium:	Paper
Jazyk:	angličtina
Vydáno:	Ithaca Cornell University Library, arXiv.org 07.06.2024
Témata:	Algorithms Codification Combinatorial analysis Cost function Knapsack problem Operations research Optimization Quantum computing Qubits (quantum computing) Slack variables Traveling salesman problem
ISSN:	2331-8422
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!