Related papers: Classical modelling of a bosonic sampler with phot…
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of…
We study distinguishability of photons in multiphoton interference on a multiport when fast detectors, capable of precise time resolution, are employed. Such a setup was previously suggested for experimental realization of boson sampling…
The difficulty of validating large-scale quantum devices, such as Boson Samplers, poses a major challenge for any research program that aims to show quantum advantages over classical hardware. To address this problem, we propose a novel…
We demonstrate how the physics of multiboson correlation interference leads to the computational complexity of linear optical interferometers based on correlation measurements in the degrees of freedom of the input bosons. In particular, we…
Random point patterns are ubiquitous in nature, and statistical models such as point processes, i.e., algorithms that generate stochastic collections of points, are commonly used to simulate and interpret them. We propose an application of…
Quantum computers are unnecessary for exponentially-efficient computation or simulation if the Extended Church-Turing thesis---a foundational tenet of computer science---is correct. The thesis would be directly contradicted by a physical…
Multi-photon interference in large multi-port interferometers is key to linear optical quantum computing and in particular to boson sampling. Silicon photonics enables complex interferometric circuits with many components in a small…
Using tools from representation theory, we derive expressions for the coincidence rate of partially-distinguishable particles in an interferometry experiment. Our expressions are valid for either bosons or fermions, and for any number of…
Optical losses are the main obstacle to demonstrating a quantum advantage via boson sampling without leaving open the possibility of classical spoofing. We propose a method for generating low-depth optical circuits suitable for boson…
Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful…
Boson sampling is a simple model for non-universal linear optics quantum computing using far fewer physical resources than universal schemes. An input state comprising vacuum and single photon states is fed through a Haar-random linear…
A multi-imaging strategy is proposed and experimentally tested to improve the accuracy of photon counting with an electron multiplying charge-coupled device (EMCCD), by taking into account the random nature of its on-chip gain and the…
Boson-sampling has been presented as a simplified model for linear optical quantum computing. In the boson-sampling model, Fock states are passed through a linear optics network and sampled via number-resolved photodetection. It has been…
We perform a comprehensive set of experiments that characterize bosonic bunching of up to 3 photons in interferometers of up to 16 modes. Our experiments verify two rules that govern bosonic bunching. The first rule, obtained recently in…
Gaussian boson sampling (GBS) allows for a way to demonstrate quantum supremacy with the relatively modest experimental resources of squeezed light sources, linear optics, and photon detection. In a realistic experimental setting, numerous…
Although the $k$-mode marginal distributions of Canonical Boson Sampling (CBS) are known to be computable in polynomial time, the physical mechanism driving this computational efficiency remains mathematically opaque. In this work, we…
We discuss an experimental setup where two laser-driven atoms spontaneously emit photons and every photon causes a ``click'' at a point on a screen. By deriving the probability density for an emission into a certain direction from basic…
We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods. The complexity of the algorithm is exponential in the number of photon pairs detected, not the…
Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is a crucial step in charting their usefulness. Gaussian Boson Sampling (GBS), in which photons are measured from a…
The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical…