Related papers: The Complexity of Bipartite Gaussian Boson Samplin…
Gaussian Boson Samplers are photonic quantum devices with the potential to perform tasks that are intractable for classical systems. As with other near-term quantum technologies, an outstanding challenge is to identify specific problems of…
It is well known in quantum optics that any process involving the preparation of a multimode gaussian state, followed by a gaussian operation and gaussian measurements, can be efficiently simulated by classical computers. Here, we provide…
Gaussian boson sampling constitutes a prime candidate for an experimental demonstration of quantum advantage within reach with current technological capabilities. The original proposal employs photon-number-resolving detectors, however the…
We introduce a new family of quantum circuits in Continuous Variables and we show that, relying on the widely accepted conjecture that the polynomial hierarchy of complexity classes does not collapse, their output probability distribution…
Computational validation is vital for all large-scale quantum computers. One needs computers that are both fast and accurate. Here we apply precise, scalable, high order statistical tests to data from large Gaussian boson sampling (GBS)…
Multiphoton interference is at the very heart of quantum foundations and applications in quantum sensing and information processing. In particular, boson sampling experiments have the potential to demonstrate quantum computational supremacy…
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational…
We show how phase-space simulations of Gaussian quantum states in a photonic network permit verification of measurable correlations of Gaussian boson sampling (GBS) quantum computers. Our results agree with experiments for up to 100-th…
Results on the hardness of approximate sampling are seen as important stepping stones towards a convincing demonstration of the superior computational power of quantum devices. The most prominent suggestions for such experiments include…
The first quantum technologies to solve computational problems that are beyond the capabilities of classical computers are likely to be devices that exploit characteristics inherent to a particular physical system, to tackle a bespoke…
Quantum computers promise to dramatically outperform their classical counterparts. However, the non-classical resources enabling such computational advantages are challenging to pinpoint, as it is not a single resource but the subtle…
Photonic Quantum Computers provides several benefits over the discrete qubit-based paradigm of quantum computing. By using the power of continuous-variable computing we build an anomaly detection model to use on searches for New Physics.…
Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer. Boson-sampling is a non-universal quantum computer that is significantly more straightforward…
Universal quantum computers promise a dramatic speed-up over classical computers but a full-size realization remains challenging. However, intermediate quantum computational models have been proposed that are not universal, but can solve…
Boson-sampling is a highly simplified, but non-universal, approach to implementing optical quantum computation. It was shown by Aaronson and Arkhipov that this protocol cannot be efficiently classically simulated unless the polynomial…
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 (see Refs.~\onlinecite{zhong_quantum_2020,zhong2021phase}). Here we…
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 distinguishability and develop a more complete model for the…
Boson sampling stands out as a promising approach toward experimental demonstration of quantum computational advantage. However, the presence of physical noise in near-term experiments hinders the realization of the quantum computational…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
Gaussian Boson Sampling (GBS) is capable of solving certain classes of graph problems owing to the samples produced by such a device having a connection to the hafnian matrix function. In particular, a GBS device has been shown to provide…