Towards quantum supremacy with lossy scattershot boson sampling

DOI10.1088/1367-2630/18/11/113008MaRDI QIDQ5855115zbMATH OpenOpenAlexFDO

Authors Ludovico Latmiral, Nicolò Spagnolo, F. Sciarrino

Publication date 12 March 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1610.02279

Mathematics Subject Classification ID

Quantum gates (81P65) Quantum computation (81P68)

Abstract: Boson Sampling represents a promising approach to obtain an evidence 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 techniques are for a quantum experimental sampler. Starting from a state of the art analysis and taking account of the foreseeable practical limitations, we evaluate and discuss the bound for quantum supremacy for different recently proposed approaches, accordingly to today's best known classical simulators.

Recommendations

• The classical complexity of boson sampling
• On the classical complexity of sampling from quantum interference of indistinguishable bosons
• Boson sampling with non-identical single photons
• Statistical benchmark for bosonsampling
• The computational complexity of linear optics

Cites work

• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• scientific article; zbMATH DE number 1559533 (Why is no real title available?)
• Statistical benchmark for bosonsampling
• The complexity of computing the permanent
• The computational complexity of linear optics
• The permanent of a square matrix
• Universal linear optics

Cited in

(6)

• The classical complexity of boson sampling
• Applications of the Lambert-Tsallis \(W_q\) function in quantum photonic Gaussian boson sampling
• Classical benchmarking of Gaussian boson sampling on the Titan supercomputer
• On the classical complexity of sampling from quantum interference of indistinguishable bosons
• Complexity-theoretic foundations of quantum supremacy experiments
• Statistical benchmark for bosonsampling

This page was built for publication: Towards quantum supremacy with lossy scattershot boson sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855115)