A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

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

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 phase-programmable Gaussian boson sampling (GBS) which produces up to 113
photon detection events out of a 144-mode photonic circuit. A new high-brightness and …

Growing interest in quantum computing for practical applications has led to a surge in the
availability of programmable machines for executing quantum algorithms,. Present-day …

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 …

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 …

Gaussian states have played an important role in the physics of continuous-variable
quantum systems. They are appealing for the experimental ease with which they can be …

Photonics is a promising platform for demonstrating a quantum computational advantage
(QCA) by outperforming the most powerful classical supercomputers on a well-defined …

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