Reaching Quantum Supremacy with a Boson Sampling Experiment
Ludovico Latmiral

TL;DR
This paper advances Boson Sampling experiments by identifying more feasible thresholds for quantum supremacy, reducing error sensitivity, and improving practical implementation prospects.
Contribution
It introduces a more general and effective approach to achieve quantum supremacy with Boson Sampling, considering realistic experimental conditions.
Findings
New threshold for Boson Sampling less sensitive to errors
Applicable to existing experimental proposals
Enhanced feasibility for quantum supremacy demonstration
Abstract
Boson Sampling represents a promising witness of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called Permanent-of-Gaussians Conjecture and has been extended to some generalizations such as scattershot Boson Sampling, approximate and lossy sampling under some reasonable constraints. However, it is still unclear how demanding these bounds are for a quantum experimental sampler. Starting from a state of the art analysis and focusing on the foreseeable practical conditions needed to reach quantum supremacy, we look at different techniques and present a more general and effective solution. We apply our approach to both the experimental suggestions presented to date and we eventually find in both cases a new threshold that is less error sensitive and experimentally more feasible.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
