Warm-starting quantum optimization

There is an increasing interest in quantum algorithms for problems of integer programming and combinatorial optimization. Classical solvers for such problems employ relaxations, which replace binary variables with continuous ones, for instance in the form of higher-dimensional matrix-valued problems...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Egger, Daniel J, Marecek, Jakub, Woerner, Stefan
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 16.06.2021
Predmet:	Algorithms Combinatorial analysis Continuity (mathematics) Games Mathematical analysis Matrix methods Optimization Polynomials Rounding Semidefinite programming Solvers
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!