Experimental demonstration of quantum advantage for NP verification with limited information.

ABSTRACT: In recent years, many computational tasks have been proposed as candidates for showing a quantum computational advantage, that is an advantage in the time needed to perform the task using a quantum instead of a classical machine. Nevertheless, practical demonstrations of such an advantage remain particularly challenging because of the difficulty in bringing together all necessary theoretical and experimental ingredients. Here, we show an experimental demonstration of a quantum computational advantage in a prover-verifier interactive setting, where the computational task consists in the verification of an NP-complete problem by a verifier who only gets limited information about the proof sent by an untrusted prover in the form of a series of unentangled quantum states. We provide a simple l

SUBMITTER: Centrone F 

PROVIDER: S-EPMC7870841 | biostudies-literature | 2021 Feb

REPOSITORIES: biostudies-literature