Related papers: Sufficient Conditions for Efficient Classical Simu…

We introduce a general statistical learning theory for processes that take as input a classical random variable and output a quantum state. Our setting is motivated by the practical situation in which one desires to learn a quantum process…

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…

We study supervised learning algorithms in which a quantum device is used to perform a computational subroutine - either for prediction via probability estimation, or to compute a kernel via estimation of quantum states overlap. We design…

It is predicted that quantum computers will dramatically outperform their conventional counterparts. However, large-scale universal quantum computers are yet to be built. Boson sampling is a rudimentary quantum algorithm tailored to the…

When the problem of boson sampling was first proposed, it was assumed that little or no photon collisions occur. However, modern experimental realizations rely on setups where collisions are quite common, i.e. the number of photons $M$…

Photon losses are among the strongest imperfections affecting multi-photon interference. Despite their importance, little is known about their effect on boson sampling experiments. In this work we show that using classical computers, one…

Experimental demonstration of the quantum advantage over classical simulations with Boson Sampling is currently under intensive investigation. There seems to be a scalability issue to the necessary number of bosons on the linear optical…

We present a classical algorithm that approximately samples from the output distribution of certain noisy Boson Sampling experiments. This algorithm is inspired by a recent result of Aharonov, Gao, Landau, Liu and Vazirani and makes use of…

BosonSampling is a quantum mechanical task involving Fock basis state preparation and detection and evolution using only linear interactions. A classical algorithm for producing samples from this quantum task cannot be efficient unless the…

We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed…

A BosonSampling device is a quantum machine expected to perform tasks intractable for a classical computer, yet requiring minimal non-classical resources as compared to full-scale quantum computers. Photonic implementations to date employed…

To understand quantum optics experiments, we must perform calculations that consider the principal sources of noise, such as losses, spectral impurity and partial distinguishability. In both discrete and continuous variable systems, these…

Boson Sampling represents a promising witness of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called Permanent-of-Gaussians…

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 computers. Boson sampling is a promising platform for such a goal, however,…

Gaussian boson sampling is a promising scheme for demonstrating a quantum computational advantage using photonic states that are accessible in a laboratory and, thus, offer scalable sources of quantum light. In this contribution, we study…

Boson sampling has been theoretically proposed and experimentally demonstrated to show quantum computational advantages. However, it still lacks the deep understanding of the practical applications of boson sampling. Here we propose that…

Gaussian boson sampling is a promising candidate for showing experimental quantum advantage. While there is evidence that noiseless Gaussian boson sampling is hard to efficiently simulate using a classical computer, the current Gaussian…

The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum…

Quantum computers are expected to be more efficient in performing certain computations than any classical machine. Unfortunately, the technological challenges associated with building a full-scale quantum computer have not yet allowed the…

While universal quantum computers ideally solve problems such as factoring integers exponentially more efficiently than classical machines, the formidable challenges in building such devices motivate the demonstration of simpler,…