Efficient verification of Boson Sampling

The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing. While quantum speedup experiments are gradually escaping...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Ulysse Chabaud, Frédéric Grosshans, Elham Kashefi, Damian Markham
Formato: article
Lenguaje:EN
Publicado: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften 2021
Materias:
Acceso en línea:https://doaj.org/article/fac8dc5dacc74154b6d602de64b48c40
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing. While quantum speedup experiments are gradually escaping the regime of classical simulation, they still lack efficient verification protocols and rely on partial validation. Here we derive an efficient protocol for verifying with single-mode Gaussian measurements the output states of a large class of continuous-variable quantum circuits demonstrating quantum speedup, including Boson Sampling experiments, thus enabling a convincing demonstration of quantum speedup with photonic computing. Beyond the quantum speedup milestone, our results also enable the efficient and reliable certification of a large class of intractable continuous-variable multimode quantum states.