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...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Egger, Daniel J, Marecek, Jakub, Woerner, Stefan
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 16.06.2021
Subjects:	Algorithms Combinatorial analysis Continuity (mathematics) Games Mathematical analysis Matrix methods Optimization Polynomials Rounding Semidefinite programming Solvers
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!