2020/06/30 by Ulysse Chabaud, Frédéric Grosshans, Elham Kashefi +1
Computer Science · Physics and Astronomy · #Algorithm #Computer science #Neural Networks and Reservoir Computing #Parallel computing #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum computer #Quantum mechanics #Speedup #Statistical physics #Theoretical computer science #quant-ph
paper · pdf · doi:10.22331/q-2021-11-15-578
published as Quantum 5, 578 (2021) · 15+21 pages, 4 figures. Comments welcome!
arxiv created 2021/11/09 · openalex publication_date 2021/11/15 · arxiv updated 2021/11/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
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.