Related papers: Classical simulation of bosonic linear-optical ran…

Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the…

Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an…

We present methods which allow orders of magnitude increase in the number of modes in linear optics experiments by moving from spatial encoding to temporal encoding and using dispersion. This enables significant practical advantages for…

Linear optical circuits with single-photon sources offer a promising platform for quantum chemistry and machine learning. However, current applications are all based on support vector machines or gradient-free optimization methods. This…

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…

We present conditions for the efficient simulation of a broad class of optical quantum circuits on a classical machine: this class includes unitary transformations, amplification, noise, and measurements. Various proposed schemes for…

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…

Boson sampling can provide strong evidence that the computational power of a quantum computer outperforms a classical one via currently feasible linear optics experiments. However, how to identify an actual boson sampling device against any…

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…

Boson sampling can simulate physical problems for which classical simulations are inefficient. However, not all problems simulated by boson sampling are classically intractable. We consider a situation in which it is known that the outcome…

We study the sampling complexity of a probability distribution associated with an ensemble ofidentical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice.With uniform nearest-neighbor hopping we show that…

We suggest a theoretical scheme for the simulation of quantum random walks on a line using beam splitters, phase shifters and photodetectors. Our model enables us to simulate a quantum random walk with use of the wave nature of classical…

To simulate noisy boson sampling approximating it by only the lower-order multi-boson interferences (e.g., by a smaller number of interfering bosons and classical particles) is very popular idea. I show that the output data from any such…

A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the…

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…

We show that several quantum circuit families can be simulated efficiently classically if it is promised that their output distribution is approximately sparse i.e. the distribution is close to one where only a polynomially small, a priori…

Boson sampling is a problem intractable for classical computers, but can be naturally solved on a specialized photonic quantum simulator which requires less resources than building a universal quantum computer. The biggest challenge to…

The first post-classical computation will most probably be performed not on a universal quantum computer, but rather on a dedicated quantum hardware. A strong candidate for achieving this is represented by the task of sampling from the…

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…

A boson sampling device is a specialised quantum computer that solves a problem which is strongly believed to be computationally hard for classical computers. Recently a number of small-scale implementations have been reported, all based on…