Related papers: Noise in BosonSampling and the threshold of effici…

The mechanism of selectivity in ion channels is still an open question in biology. According to recent proposals, it seems that the selectivity filter of the ion channel, which plays a key role in the channel's function, may show quantum…

Analyzing the impact of noise is of fundamental importance to understand the advantages provided by quantum systems. While the classical simulability of noisy discrete-variable systems is increasingly well understood, noisy bosonic circuits…

Understanding the energetic efficiency of quantum computers is essential for assessing their scalability and for determining whether quantum technologies can outperform classical computation beyond runtime alone. In this work, we analyze…

The boson sampler proposed by Aaronson and Arkhipov is a non-universal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distribution at the output of linear unitary optical…

BosonSampling and Random Circuit Sampling are important both as a theoretical tool for separating quantum and classical computation, and as an experimental means of demonstrating quantum speedups. Prior works have shown that average-case…

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…

Boson sampling is a fundamentally and practically important task that can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In this work, we present classical sampling algorithms for single-photon and…

Magic states are essential for universal quantum computation and are widely viewed as a key source of quantum advantage, yet in realistic devices they are inevitably noisy. In this work, we characterize how noise on injected magic resources…

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 a variety of boson sampling overcoming the stable single-photon preparation difficulty of the later. However, like those in the original version, noises in GBS will also result in the deviation of output…

Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study Boson sampling from general,…

A boson sampling device could efficiently sample from the output probability distribution of noninteracting bosons undergoing many-body interference. This problem is not only classically intractable, but its solution is also believed to be…

Boson sampling is a well-defined task that is strongly believed to be intractable for classical computers, but can be efficiently solved by a specific quantum simulator. However, an outstanding problem for large-scale experimental boson…

Boson sampling is one of the main quantum computation models to demonstrate the quantum computational advantage. However, this aim may be hard to realize considering two main kinds of noises, which are photon distinguishability and photon…

Quantum simulation is a central application of near-term quantum devices, pursued in both analog and digital architectures. A key challenge for both paradigms is the effect of imperfections and noise on predictive power. In this work, we…

Gaussian boson sampling is an important protocol for testing the performance of photonic quantum simulators. As such, various noise sources have been investigated that degrade the operation of such devices. In this paper, we examine a…

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$…

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…

BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. In arXiv:1306.3995, Gogolin et al. claimed that even an ideal…

Boson sampling is a mathematical problem that is strongly believed to be intractable for classical computers, whereas passive linear interferometers can produce samples efficiently. So far, the problem remains a computational curiosity, and…