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

It is unclear to what extent quantum algorithms can outperform classical algorithms for problems of combinatorial optimization. In this work, by resorting to computational learning theory and cryptographic notions, we give a fully constructive proof that quantum computers feature a super-polynomial...

Full description

Bibliographic Details

Published in:	Science advances Vol. 10; no. 11; p. eadj5170
Main Authors:	Pirnay, Niklas, Ulitzsch, Vincent, Wilde, Frederik, Eisert, Jens, Seifert, Jean-Pierre
Format:	Journal Article
Language:	English
Published:	United States 15.03.2024
ISSN:	2375-2548, 2375-2548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!