Verifiable Quantum Advantage without Structure
ORAL · Invited
Abstract
"Structure" has long played a central role in proposals for super-polynomial quantum advantage. This is especially true for problems whose solutions can be efficiently verified, where all prior results require algebraic computational conjectures or oracles with very specific features. We show a new approach for verifiable quantum advantage which, for a reasonable complexity-theoretic notion of "structure", requires no structure at all.
–
Publication: Title: Verifiable Quantum Advantage without Structure<br>Authors: Takashi Yamakawa and Mark Zhandry<br>Venue: 63rd Annual Symposium on Foundations of Computer Science (FOCS 2022)
Presenters
-
Mark Zhandry
NTT Research
Authors
-
Mark Zhandry
NTT Research
-
Takashi Yamakawa
NTT Social Informatics Laboratories