An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory

Combinatorial optimization - a field of research addressing problems that feature strongly in a wealth of scientific and industrial contexts - has been identified as one of the core potential fields of applicability of quantum computers. It is still unclear, however, to what extent quantum algorithm...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org
Hauptverfasser:	Pirnay, Niklas, Ulitzsch, Vincent, Wilde, Frederik, Eisert, Jens, Seifert, Jean-Pierre
Format:	Paper
Sprache:	Englisch
Veröffentlicht:	Ithaca Cornell University Library, arXiv.org 13.02.2024
Schlagworte:	Algorithms Combinatorial analysis Cryptography Fault tolerance Integer programming Learning theory Optimization Polynomials Potential fields Quantum computers Quantum computing
ISSN:	2331-8422
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!