Quantum computers promise to perform certain tasks that are believed to be intractable to
classical computers. Boson sampling is such a task and is considered a strong candidate to …

This review presents an overview of the current state‐of‐the‐art in photonics computing,
which leverages photons, photons coupled with matter, and optics‐related technologies for …

Identifying the boundary beyond which quantum machines provide a computational
advantage over their classical counterparts is a crucial step in charting their usefulness …

A crucial subroutine in quantum computing is to load the classical data of N complex
numbers into the amplitude of a superposed n=⌈ log 2 N⌉-qubit state. It has been proven …

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 …

In The Walrus, we provide a highly optimized implementation of the best known algorithms
for hafnians, loop hafnians, multidimensional Hermite polynomials, and torontonians of …

Plausible claims for quantum advantage have been made using sampling problems such as
random circuit sampling in superconducting qubit devices, and Gaussian boson sampling in …

Boson sampling is the problem of sampling from the same distribution as indistinguishable
single photons at the output of a linear optical interferometer. It is an example of a non …

The achievement of quantum computational advantage, also known as quantum supremacy,
is a major milestone at which a quantum computer can solve a problem significantly faster …

Boson sampling is expected to be an important milestone that will demonstrate quantum
computational advantage (or quantum supremacy). This work establishes the benchmarking …