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

Boson sampling is a computational problem that has recently been proposed as a candidate
to obtain an unequivocal quantum computational advantage. The problem consists in …

Graphs have provided an expressive mathematical tool to model quantum-mechanical
devices and systems. In particular, it has been recently discovered that graph theory can be …

Quantum computing experiments are moving into a new realm of increasing size and
complexity, with the short-term goal of demonstrating an advantage over classical …

Photonic qubits are key enablers for quantum information processing deployable across a
distributed quantum network. An on-demand and truly scalable source of indistinguishable …

Boson sampling is considered as a strong candidate to demonstrate 'quantum
computational supremacy'over classical computers. However, previous proof-of-principle …

A boson sampler implements a restricted model of quantum computing. It is defined by the
ability to sample from the distribution resulting from the interference of identical bosons …

A boson-sampling device is a quantum machine expected to perform tasks intractable for a
classical computer, yet requiring minimal nonclassical resources as compared to full-scale …

Boson sampling is a problem strongly believed to be intractable for classical computers, but
can be naturally solved on a specialized photonic quantum simulator. Here, we implement …

Quantum interference of two independent particles in pure quantum states is fully described
by the particles' distinguishability: the closer the particles are to being identical, the higher …