Related papers: Experimental loopback boson sampling
Quantum coherence is a useful resource that is consumed to accomplish several tasks that classical devices are hard to fulfill. Especially, it is considered to be the origin of quantum speedup for many computational algorithms. In this…
Since the development of Boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper we interpret and extend…
We introduce a novel approach to solve optimization problems on a boson sampling device assisted by classical machine-learning techniques. By virtue of the parity function, we map all measurement patterns, which label the basis spanning an…
Since its introduction Boson Sampling has been the subject of intense study in the world of quantum computing. The task is to sample independently from the set of all $n \times n$ submatrices built from possibly repeated rows of a larger $m…
Strongly interacting atoms trapped in optical lattices can be used to explore phase diagrams of Hubbard models. Spatial inhomogeneity due to trapping typically obscures distinguishing observables. We propose that measures using boson double…
If classical algorithms have been successful in reproducing the estimation of expectation values of observables of some quantum circuits using off-the-shelf computing resources, matching the performance of the most advanced quantum devices…
We introduce a novel application of the Hartmann sensor, traditionally designed for wavefront sensing, to measure the coherence properties of optical signals. By drawing an analogy between the coherence matrix and the density matrix of a…
We study a quantum computing system using microwave photons in transmission line resonators on a superconducting chip as qubits. We show that all control necessary for quantum computing can be implemented by coupling to Josephson devices on…
In this paper, we provide an algorithm and general framework for the simulation of photons passing through linear optical interferometers. Given $n$ photons at the input of an $m$-mode interferometer, our algorithm computes the…
Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage. Shor's algorithm, while renowned, has not been realized at a scale to…
Over the past few years, various methods have been developed to engineeer and to exploit the dynamics of photonic quantum states as they evolve through linear optical networks. Recent theoretical works have shown that the underlying Lie…
Semiconductor quantum dots can emit antibunched, single photons on demand with narrow linewidths. However, the observed linewidths are broader than lifetime measurements predict, due to spin and charge noise in the environment. This noise…
We show how phase-space simulations of Gaussian quantum states in a photonic network permit verification of measurable correlations of Gaussian boson sampling (GBS) quantum computers. Our results agree with experiments for up to 100-th…
Gaussian boson sampling is a promising model for demonstrating quantum computational supremacy, which eases the experimental challenge of the standard boson-sampling proposal. Here by analyzing the computational costs of classical…
Quantum channels in free-space, an essential prerequisite for fundamental tests of quantum mechanics and quantum technologies in open space, have so far been based on direct line-of-sight because the predominant approaches for…
Particular complexity of linear quantum optical networks is deserved recently certain attention due to possible implications for theory of quantum computation. Two relevant models of bosons are discussed in presented work. Symmetric product…
We explore the conditions under which identical particles in unitary linear networks behave as the other species, i.e. bosons as fermions and fermions as bosons. It is found that the Boson-Sampling computer of Aaronson & Arkhipov can be…
Boson Sampling, a non-universal computing paradigm, has resulted in impressive claims of quantum supremacy. ORCA Computing have developed a time-bin interferometer (TBI) that claims to use the principles of boson sampling to solve a number…
The Feynman path integral formalism has inspired the development of memory-efficient and parallelizable classical algorithms for simulating quantum computers. We adapt this approach for the calculation of probability amplitudes of…
Gaussian Boson Sampling (GBS) provides a route toward demonstrating quantum computational advantage. However, optical loss, which reduces the entanglement in the system, can render GBS results classically simulable. We propose a nonlinear…