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 …

We give new evidence that quantum computers--moreover, rudimentary quantum computers
built entirely out of linear-optical elements--cannot be efficiently simulated by classical …

A key step toward demonstrating a quantum system that can address difficult problems in
physics and chemistry will be performing a computation beyond the capabilities of any …

Boson sampling has emerged as a tool to explore the advantages of quantum over classical
computers as it does not require universal control over the quantum system, which favors …

The evolution of bosons undergoing arbitrary linear unitary transformations quickly becomes
hard to predict using classical computers as we increase the number of particles and modes …

Controllable quantum devices open novel directions to both quantum computation and
quantum simulation. Recently, a problem known as boson sampling has been shown to …

Scalable photonic quantum computing architectures pose stringent requirements on
photonic processing devices. The needs for low-loss high-speed reconfigurable circuits and …

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 …

Boson sampling is a computational task strongly believed to be hard for classical computers,
but efficiently solvable by orchestrated bosonic interference in a specialized quantum …