Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

The quest for quantum advantage, wherein quantum computers surpass the computational
capabilities of classical computers executing state-of-the-art algorithms on well-defined …

A quantum computer attains computational advantage when outperforming the best
classical computers running the best-known algorithms on well-defined tasks. No photonic …

We report new Gaussian boson sampling experiments with pseudo-photon-number-
resolving detection, which register up to 255 photon-click events. We consider partial photon …

Macroscopic quantum phenomena, such as observed in superfluids and superconductors,
have led to promising technological advancements and some of the most important tests of …

Gaussian boson sampling (GBS) is not only a feasible protocol for demonstrating quantum
computational advantage, but also mathematically associated with certain graph-related and …

Gaussian boson sampling is a form of non-universal quantum computing that has been
considered a promising candidate for showing experimental quantum advantage. While …

Two recent landmark experiments have performed Gaussian boson sampling (GBS) with a
non-programmable linear interferometer and threshold detectors on up to 144 output modes …

The quantum advantage threshold determines when a quantum processing unit (QPU) is
more efficient with respect to classical computing hardware in terms of algorithmic …

We propose a framework to design and optimize generic photonic quantum circuits
composed of Gaussian objects (pure and mixed Gaussian states, Gaussian unitaries …