Skip to Main content Skip to Navigation
New interface
Journal articles

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 linear optical implementation that can perform this verification task efficiently (within a few seconds), while we also provide strong evidence that, fixing the size of the proof, a classical computer would take much longer time (assuming only that it takes exponential time to solve an NP-complete problem). While our computational advantage concerns a specific task in a scenario of mostly theoretical interest, it brings us a step closer to potential useful applications, such as server-client quantum computing.
Document type :
Journal articles
Complete list of metadata
Contributor : Iordanis Kerenidis Connect in order to contact the contributor
Submitted on : Tuesday, December 8, 2020 - 10:58:12 AM
Last modification on : Tuesday, September 6, 2022 - 1:27:26 PM

Links full text



Federico Centrone, Niraj Kumar, Eleni Diamanti, Iordanis Kerenidis. Experimental demonstration of quantum advantage for NP verification with limited information. Nature Communications, 2021, 12 (1), pp.850. ⟨10.1038/s41467-021-21119-1⟩. ⟨hal-03045853⟩



Record views