Related papers: Photonic Boson Sampling in a Tunable Circuit
We demonstrate the robustness of BosonSampling to imperfections in the linear optical network that cause a small deviation in the matrix it implements. We show that applying a noisy matrix $\tilde{U}$ that is within $\epsilon$ of the…
We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract…
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…
We present a comprehensive study of the impact of non-uniform, i.e.\ path-dependent, photonic losses on the computational complexity of linear-optical processes. Our main result states that, if each beam splitter in a network induces some…
We propose boson sampling from a system of coupled photons and Bose-Einstein condensed atoms placed inside a multi-mode cavity as a simulation process testing quantum advantage of quantum systems over classical computers. Consider a…
Photonic quantum computers use the bosonic statistics of photons to construct, through quantum interference, the large entangled states required for measurement-based quantum computation. Therefore, any which-way information present in the…
We make the case for studying the complexity of approximately simulating (sampling) quantum systems for reasons beyond that of quantum computational supremacy, such as diagnosing phase transitions. We consider the sampling complexity as a…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
In a Boson Sampling quantum optical experiment we send $n$ individual photons into an $m$-mode interferometer and we measure the occupation pattern on the output. The statistics of this process depending on the permanent of a matrix…
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…
Photonics offers unique advantages as a substrate for quantum information processing, but imposes fundamental scalability challenges. Nondeterministic schemes impose massive resource overheads, while deterministic schemes require…
The subset sum problem is a typical NP-complete problem that is hard to solve efficiently in time due to the intrinsic superpolynomial-scaling property. Increasing the problem size results in a vast amount of time consuming in…
In linear optics, photons are scattered in a network through passive optical elements including beamsplitters and phase shifters, leading to many intriguing applications in physics, such as Mach-Zehnder interferometry, Hong-Ou-Mandel…
We suggest a novel scheme for generating multimode squeezed states for the boson sampling implementation. The idea is to replace a commonly used linear interferometer by a multimode resonator containing a passive optical element consisting…
An important step for photonic quantum technologies is the demonstration of a quantum advantage through boson sampling. In order to prevent classical simulability of boson sampling, the photons need to be almost perfectly identical and…
Photonic qubits are key enablers for quantum-information processing deployable across a distributed quantum network. An on-demand and truly scalable source of indistinguishable single photons is the essential component enabling…
Recently, Motes, Gilchrist, Dowling & Rohde [Phys. Rev. Lett. 113, 120501 (2014)] presented a scheme for photonic boson-sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full,…
We develop an alternative boson sampling model operating on single-photon states followed by linear interferometry and Gaussian measurements. The hardness proof for simulating such continuous-variable measurements is established in two main…
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…
Although universal continuous-variable quantum computation cannot be achieved via linear optics (including squeezing), homodyne detection and feed-forward, inclusion of ideal photon counting measurements overcomes this obstacle. These…