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

Celý popis

Podrobná bibliografie

Vydáno v:	arXiv.org
Hlavní autoři:	Pirnay, Niklas, Ulitzsch, Vincent, Wilde, Frederik, Eisert, Jens, Seifert, Jean-Pierre
Médium:	Paper
Jazyk:	angličtina
Vydáno:	Ithaca Cornell University Library, arXiv.org 13.02.2024
Témata:	Algorithms Combinatorial analysis Cryptography Fault tolerance Integer programming Learning theory Optimization Polynomials Potential fields Quantum computers Quantum computing
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!