Towards quantum supremacy with lossy scattershot boson sampling

DOI10.1088/1367-2630/18/11/113008zbMath1456.81142arXiv1610.02279OpenAlexW3102177031MaRDI QIDQ5855115

F. Sciarrino, Nicolò Spagnolo, Ludovico Latmiral

Publication date: 12 March 2021

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

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

Mathematics Subject Classification ID

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

Related Items (1)

Classical benchmarking of Gaussian boson sampling on the Titan supercomputer

Cites Work

• The complexity of computing the permanent
• The permanent of a square matrix
• Universal linear optics
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• The computational complexity of linear optics
• Statistical benchmark for BosonSampling
• Unnamed Item

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