pith. sign in

arxiv: 1809.01953 · v2 · pith:YTIVTRESnew · submitted 2018-09-06 · 🪐 quant-ph · cond-mat.stat-mech· physics.optics

Classical simulability of noisy boson sampling

classification 🪐 quant-ph cond-mat.stat-mechphysics.optics
keywords quantumclassicaldemonstrationadvantagebosonnoisesamplingalgorithm
0
0 comments X
read the original abstract

Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For such a demonstration to be meaningful, experimental noise must not affect the computational power of the device; this occurs when a classical algorithm can use the noise to simulate the quantum system. In this work, we demonstrate an algorithm which simulates boson sampling, a quantum advantage demonstration based on many-body quantum interference of indistinguishable bosons, in the presence of optical loss. Finding the level of noise where this approximation becomes efficient lets us map out the maximum level of imperfections at which it is still possible to demonstrate a quantum advantage. We show that current photonic technology falls short of this benchmark. These results call into question the suitability of boson sampling as a quantum advantage demonstration.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Evaluating noises of fast-simulated boson sampling with statistical benchmark methods

    quant-ph 2025-09 unverdicted novelty 6.0

    Statistical benchmark methods originally for discriminating boson sampling can quantify noises like partial distinguishability and loss, performing better with high-order correlators, while a new fast simulation schem...