Physically motivated quantum algorithms for specific near-term quantum hardware will likely
be the next frontier in quantum information science. Here, we show how many of the features …

A promising route towards the demonstration of near-term quantum advantage (or
supremacy) over classical systems relies on running tailored quantum algorithms on noisy …

Experimental demonstration of the quantum advantage over classical simulations with
Boson Sampling is currently under intensive investigation. There seems to be a scalability …

BosonSampling is a problem of sampling events according to the transition probabilities of
indistinguishable photons in a linear optical network. Computational hardness of …

This work shows that the majorization of photon distributions is related to the runtime of
classically simulating multimode passive linear optics, which explains one aspect of the …

Although a quantum computer is commonly modelled as a closed physical system, in
practice the computer inevitably interacts with its environment and other systems. The aim of …

On the classical complexity of quantum interference of indistinguishable bosons Page 1 On
the classical complexity of quantum interference of indistinguishable bosons VS Shchesnovich …